Distance browsing in spatial databases
- 1 June 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 24 (2) , 265-318
- https://doi.org/10.1145/320248.320255
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Efficient color histogram indexing for quadratic form distance functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Rule-based optimization and query processing in an extensible geometric database systemACM Transactions on Database Systems, 1992
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- Strategies for efficient incremental nearest neighbor searchPattern Recognition, 1990
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- A consistent hierarchical representation for vector dataACM SIGGRAPH Computer Graphics, 1986
- Ubiquitous B-TreeACM Computing Surveys, 1979
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Some approaches to best-match file searchingCommunications of the ACM, 1973