The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The LSDh-Tree: An Access Structure for Feature Vectors
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Behaviour of Texture Features in a CBIR System
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
A fast and robust bulk-loading algorithm for indexing very large digital elevation datasets
Computers & Geosciences
| Hi-index | 0.00 |
In many database applications similarity search is a typical operation that must be efficiently processed. A class of techniques to implement similarity queries which has demonstrated acceptable results includes the use of a nearest neighbor search algorithm on top of a multidimensional access method. We propose a new algorithm based on the space organization induced by the Q-tree. Specifically, a metric is used to discard internal zones of a cube that have been previously extracted from it. Our experiments based on both synthetic and real data sets show that our approach outperforms other competitive techniques like R*-tree, M-tree, and Hybrid-tree.