The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.
Lars ArgeMark de BergHerman J. HaverkortKe YiPublished in: Cache-Oblivious and Cache-Aware Algorithms (2004)
Keyphrases
- r tree
- worst case
- indexing structure
- tree construction
- index structure
- range queries
- query processing
- spatial data
- multi dimensional
- spatial databases
- similarity search
- indexing method
- access methods
- b tree
- data structure
- number of distance computations
- spatial index
- tree structure
- spatial access methods
- spatial join
- spatial objects
- spatial queries
- multidimensional data
- upper bound
- cache conscious
- database systems
- data distribution
- np hard
- lower bound
- data analysis
- space partitioning
- bounding rectangle
- decision trees
- index tree
- data mining