Performance of nearest neighbor queries in R-trees
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 394-408
- https://doi.org/10.1007/3-540-62222-5_59
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The design of the cell tree: an object-oriented index structure for geometric databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Combining fuzzy information from multiple systems (extended abstract)Published by Association for Computing Machinery (ACM) ,1996
- An introduction to spatial database systemsThe VLDB Journal, 1994
- Beyond uniformity and independencePublished by Association for Computing Machinery (ACM) ,1994
- Spatial SQL: a query and presentation languageIEEE Transactions on Knowledge and Data Engineering, 1994
- Efficient processing of spatial joins using R-treesPublished by Association for Computing Machinery (ACM) ,1993
- 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
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977