The Priority R-tree: a practically efficient and worst-case optimal R-tree

Authors:
Lars Arge;Mark de Berg;Herman J. Haverkort;Ke Yi
Affiliations:
Duke University, Durham, NC;TU Eindhoven, Eindhoven, The Netherlands;Utrecht University, Utrecht, The Netherlands;Duke University, Durham, NC
Venue:
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Year:
2004

Citing 17
Cited 30

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multidimensional access methods

ACM Computing Surveys (CSUR)
A greedy algorithm for bulk loading R-trees

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Direct spatial search on pictorial databases using packed R-trees

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
The discrepancy method: randomness and complexity

The discrepancy method: randomness and complexity
Box-trees for collision checking in industrial installations

Proceedings of the eighteenth annual symposium on Computational geometry
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Client-Server Paradise

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Implementing I/O-efficient Data Structures Using TPIE

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
I/O-efficient dynamic planar point location

Computational Geometry: Theory and Applications

Cache-oblivious R-trees

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Improving the R*-tree with outlier handling techniques

Proceedings of the 13th annual ACM international workshop on Geographic information systems
Efficient query processing on unstructured tetrahedral meshes

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
WeR-trees

Data & Knowledge Engineering
K-anonymization as spatial indexing: toward scalable and incremental anonymization

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Query Responsive Index Structures

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Cache-oblivious range reporting with optimal queries requires superlinear space

Proceedings of the twenty-fifth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting

Proceedings of the twenty-fifth annual symposium on Computational geometry
Worst-case efficient range search indexing: invited tutorial

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A revised r*-tree in comparison with related index structures

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Recent Advances in Worst-Case Efficient Range Search Indexing

SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Adaptive Management of Multigranular Spatio-Temporal Object Attributes

SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Approximate range searching in external memory

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Bulk-loading the ND-tree in non-ordered discrete data spaces

DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A general approach for cache-oblivious range reporting and approximate range counting

Computational Geometry: Theory and Applications
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
ArrayStore: a storage manager for complex parallel array processing

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Fast regridding of large, complex geospatial datasets

Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
NEFOS: rapid cache-aware range query processing with probabilistic guarantees

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Shepherdable indexes and persistent search services for mobile users

ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Measuring two-event structural correlations on graphs

Proceedings of the VLDB Endowment
The priority R-tree

SIGSPATIAL Special
Machine Learning for Traffic Prediction

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Sort-based parallel loading of R-trees

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Accelerating spatial range queries

Proceedings of the 16th International Conference on Extending Database Technology
TOUCH: in-memory spatial join by hierarchical data-oriented partitioning

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Approximate high-dimensional nearest neighbor queries using R-forests

Proceedings of the 17th International Database Engineering & Applications Symposium
PL-Tree: an efficient indexing method for high-dimensional data

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1 1/d + T/B) I/Os, where N is the number of d-dimensional (hyper-) rectangles stored in the R-tree, B is the disk block size, and T is the output size. This is provably asymptotically optimal and significantly better than other R-tree variants, where a query may visit all N/B leaves in the tree even when T = 0. We also present an extensive experimental study of the practical performance of the PR-tree using both real-life and synthetic data. This study shows that the PR-tree performs similar to the best known R-tree variants on real-life and relatively nicely distributed data, but outperforms them significantly on more extreme data.