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