2 search results - page 1 / 1 » The Priority R-Tree: A Practically Efficient and Worst-Case ... |
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
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 ddimensio...
DAGSTUHL
2004
13 years 6 months ago
2004
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 ddimensio...