Skip to content
master
Go to file
Code
This branch is 10 commits ahead, 2 commits behind ktsiegel:master.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
ort
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

README.md

HODOR: HODOR On-Disk Orthogonal Range-trees

The orthogonal range tree is a data structure for efficient range queries on d dimensions. HODOR is an on-disk implementation introducing the idea of 'back seek' complexity, or complexity in the number of reads of locations falling before the current disk position. By serializing the tree in a particular way, HODOR achieves a constant number of back seeks per range query. Check out hodor.pdf for more details.

About

Serializing orthogonal range (k-d) trees for fast on-disk queries

Resources

Releases

No releases published

Packages

No packages published
You can’t perform that action at this time.