Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Authors:
- 23 January 2009
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 22 (1) , 1-26
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- A compact space decomposition for effective metric indexingPattern Recognition Letters, 2005
- CVA file: an index structure for high-dimensional datasetsKnowledge and Information Systems, 2005
- Indexing high-dimensional data for efficient in-memory similarity searchIEEE Transactions on Knowledge and Data Engineering, 2005
- Similarity search without tears: the OMNI-family of all-purpose access methods2002
- The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.2002
- Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distancesThe VLDB Journal, 2000
- When Is “Nearest Neighbor” Meaningful?1999
- Distance-based indexing for high-dimensional metric spaces1997
- Some approaches to best-match file searchingCommunications of the ACM, 1973