Tree structures for high dimensionality nearest neighbor searching
- 1 January 1982
- journal article
- Published by Elsevier in Information Systems
- Vol. 7 (2) , 115-122
- https://doi.org/10.1016/0306-4379(82)90023-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering MethodIEEE Transactions on Software Engineering, 1981
- Quintary treesACM Transactions on Database Systems, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Generation and search of clustered filesACM Transactions on Database Systems, 1978
- 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
- The best-match problem in document retrievalCommunications of the ACM, 1974
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- Design of tree structures for efficient queryingCommunications of the ACM, 1973
- Some approaches to best-match file searchingCommunications of the ACM, 1973