ACM Transactions on Algorithms (TALG): Volume 4 Issue 1, March 2008
Citation Count: 21
Downloads (6 Weeks): 4, Downloads (12 Months): 75, Downloads (Overall): 1,122
Full text available:
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 ...