The Priority R-tree
- 13 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 347-358
- https://doi.org/10.1145/1007568.1007608
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- I/O-efficient dynamic planar point locationComputational Geometry, 2004
- Bkd-Tree: A Dynamic Scalable kd-TreeLecture Notes in Computer Science, 2003
- Box-Trees and R-Trees with Near-Optimal Query TimeDiscrete & Computational Geometry, 2002
- Multidimensional access methodsACM Computing Surveys, 1998
- On packing R-treesPublished by Association for Computing Machinery (ACM) ,1993
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Organization and maintenance of large ordered indexesActa Informatica, 1972