The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree

@article{Arge2004ThePR,
  title={The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree},
  author={Lars Arge and Mark de Berg and Herman J. Haverkort and Ke Yi},
  journal={ACM Trans. Algorithms},
  year={2004},
  volume={4},
  pages={9:1-9:30}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 178 citations. REVIEW CITATIONS

14 Figures & Tables

Topics

Statistics

0102030'03'05'07'09'11'13'15'17
Citations per Year

178 Citations

Semantic Scholar estimates that this publication has 178 citations based on the available data.

See our FAQ for additional information.