The design and analysis of spatial data structures
The design and analysis of spatial data structures
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
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
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Some approaches to best-match file searching
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Processing Complex Similarity Queries with Distance-Based Access Methods
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
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 R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th 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
Proximity Matching Using Fixed-Queries Trees
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Time series similarity measures (tutorial PM-2)
Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Similarity search in metric databases through hashing
MULTIMEDIA '01 Proceedings of the 2001 ACM workshops on Multimedia: multimedia information retrieval
Best-Match Retrieval for Structured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Bitmap-Based Indexing for Multi-dimensional Multimedia XML Documents
ICADL '02 Proceedings of the 5th International Conference on Asian Digital Libraries: Digital Libraries: People, Knowledge, and Technology
String Matching with Metric Trees Using an Approximate Distance
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
The SH-tree: A Super Hybrid Index Structure for Multidimensional Data
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
D-Index: Distance Searching Index for Metric Data Sets
Multimedia Tools and Applications
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On Optimizing Distance-Based Similarity Search for Biological Databases
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Two-scale image retrieval with significant meta-information feedback
Proceedings of the 13th annual ACM international conference on Multimedia
On the Stationarity of Multivariate Time Series for Correlation-Based Data Analysis
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Finding and identifying unknown commercials using repeated video sequence detection
Computer Vision and Image Understanding
M-Grid: similarity searching in grid
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
An efficient k nearest neighbor search for multivariate time series
Information and Computation
ACM Transactions on Database Systems (TODS)
The VLDB Journal — The International Journal on Very Large Data Bases
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
CM-tree: A dynamic clustered index for similarity search in metric databases
Data & Knowledge Engineering
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Axes rectifying of impression space in music impression-based retrieval and its evaluation
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
BAG: a graph theoretic sequence clustering algorithm
International Journal of Data Mining and Bioinformatics
Proceedings of the 2008 ACM symposium on Applied computing
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
A metric cache for similarity search
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Caching content-based queries for robust and efficient image retrieval
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient skyline computation in metric space
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continually answering constraint k-NN queries in unstructured P2P systems
Journal of Computer Science and Technology
Top-k typicality queries and efficient query answering methods on large databases
The VLDB Journal — The International Journal on Very Large Data Bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Similarity join in metric spaces
ECIR'03 Proceedings of the 25th European conference on IR research
Dimension reduction for distance-based indexing
Proceedings of the Third International Conference on SImilarity Search and APplications
Proceedings of the Third International Conference on SImilarity Search and APplications
BP-tree: an efficient index for similarity search in high-dimensional metric spaces
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Pivot selection method for optimizing both pruning and balancing in metric space indexes
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Exact indexing for support vector machines
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Selecting vantage objects for similarity indexing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Melodic similarity through shape similarity
CMMR'10 Proceedings of the 7th international conference on Exploring music contents
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Clustered trie structures for approximate search in hierarchical objects collections
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
An access structure for similarity search in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Measuring the difficulty of distance-based indexing
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Pivot selection: Dimension reduction for distance-based indexing
Journal of Discrete Algorithms
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
Similarity caching in large-scale image retrieval
Information Processing and Management: an International Journal
A generic framework for efficient and effective subsequence retrieval
Proceedings of the VLDB Endowment
iKernel: Exact indexing for support vector machines
Information Sciences: an International Journal
A scalable re-ranking method for content-based image retrieval
Information Sciences: an International Journal
Hi-index | 0.00 |
One of the common queries in many database applications is finding approximate matches to a given query item from a collection of data items. For example, given an image database, one may want to retrieve all images that are similar to a given query image. Distance-based index structures are proposed for applications where the distance computations between objects of the data domain are expensive (such as high-dimensional data) and the distance function is metric. In this paper we consider using distance-based index structures for similarity queries on large metric spaces. We elaborate on the approach that uses reference points (vantage points) to partition the data space into spherical shell-like regions in a hierarchical manner. We introduce the multivantage point tree structure (mvp-tree) that uses more than one vantage point to partiton the space into spherical cuts at each level. In answering similarity-based queries, the mvp-tree also utilizes the precomputed (at construction time) distances between the data points and the vantage points. We summarize the experiments comparing mvp-trees to vp-trees that have a similar partitioning strategy, but use only one vantage point at each level and do not make use of the precomputed distances. Empirical studies show that the mvp-tree outperforms the vp-tree by 20% to 80% for varying query ranges and different distance distributions. Next, we generalize the idea of using multiple vantage points and discuss the results of experiments we have made to see how varying the number of vantage points in a node affects affects performance and how much is gained in performance by making use of precomputed distances. The results show that, after all, it may be best to use a large number of vantage points in an internal node in order to end up with a single directory node and keep as many of the precomputed distances as possible to provide more efficient filtering during search operations. Finally, we provide some experimental results that compare mvp-trees with M-trees, which is a dynamic distance-based index structure for metric domains.