Parallel R-trees
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 21 (2) , 195-204
- https://doi.org/10.1145/130283.130315
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Segment indexesPublished by Association for Computing Machinery (ACM) ,1991
- The hB-tree: a multiattribute indexing method with good guaranteed performanceACM Transactions on Database Systems, 1990
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Parallel processing of large node B-treesIEEE Transactions on Computers, 1990
- Fractals for secondary key retrievalPublished by Association for Computing Machinery (ACM) ,1989
- Spatial query processing in an object-oriented database systemPublished by Association for Computing Machinery (ACM) ,1986
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- An effective way to represent quadtreesCommunications of the ACM, 1982
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975