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
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
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
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
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
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time series similarity measures (tutorial PM-2)
Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
Database techniques for archival of solid models
Proceedings of the sixth ACM symposium on Solid modeling and applications
Robust space transformations for distance-based operations
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
How to improve the pruning ability of dynamic metric access methods
Proceedings of the eleventh international conference on Information and knowledge management
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Fast and Effective Retrieval of Medical Tumor Shapes
IEEE Transactions on Knowledge and Data Engineering
A Multistep Approach for Shape Similarity Search in Image Databases
IEEE Transactions on Knowledge and Data Engineering
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
DynDex: a dynamic and non-metric space indexer
Proceedings of the tenth ACM international conference on Multimedia
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
MLDM '99 Proceedings of the First International Workshop on Machine Learning and Data Mining in Pattern Recognition
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
Fast High-Dimensional Data Search in Incomplete Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Proceedings of the 27th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Using the Real Dimension of the Data
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
The Geometric Framework for Exact and Similarity Querying XML Data
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
The VLDB Journal — The International Journal on Very Large Data Bases
Combining multi-visual features for efficient indexing in a large image database
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate similarity retrieval with M-trees
The VLDB Journal — The International Journal on Very Large Data Bases
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
M+-tree: a new dynamical multidimensional index for metric spaces
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Supporting Content-Based Searches on Time Series via Approximation
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Contorting high dimensional data for efficient main memory KNN processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Multi-camera spatio-temporal fusion and biased sequence-data learning for security surveillance
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Element matching across data-oriented XML sources using a multi-strategy clustering model
Data & Knowledge Engineering
Online event-driven subsequence matching over financial data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Identifying similarities, periodicities and bursts for online search queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Diagonal Ordering: a new approach to high-dimensional KNN processing
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Indexing High-Dimensional Data for Efficient In-Memory Similarity Search
IEEE Transactions on Knowledge and Data Engineering
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
On Optimizing Distance-Based Similarity Search for Biological Databases
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Database Systems (TODS)
A multi-step strategy for approximate similarity search in image databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Reference-based indexing of sequence databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A hyperplane based indexing technique for high-dimensional data
Information Sciences: an International Journal
K nearest neighbor search in navigation systems
Mobile Information Systems
An efficient indexing structure for content based multimedia retrieval with relevance feedback
Proceedings of the 2007 ACM symposium on Applied computing
Finding near neighbors through cluster pruning
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing schemes for similarity search in datasets of short protein fragments
Information Systems
t-Spanners for metric space searching
Data & Knowledge Engineering
The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Reference-based indexing for metric spaces with costly distance measures
The VLDB Journal — The International Journal on Very Large Data Bases
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Parallel query processing on distributed clustering indexes
Journal of Discrete Algorithms
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Efficient skyline computation in metric space
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Optimal Pivots to Minimize the Index Size for Metric Access Methods
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
Adapting indexing trees to data distribution in feature spaces
Computer Vision and Image Understanding
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Knowledge and Information Systems
Optimal distance bounds for fast search on compressed time-series query logs
ACM Transactions on the Web (TWEB)
The MM-tree: a memory-based metric tree without overlap between nodes
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Studying of multi-dimensional based replica management in object storage system
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Clustering-based similarity search in metric spaces with sparse spatial centers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Effectiveness of optimal incremental multi-step nearest neighbor search
Expert Systems with Applications: An International Journal
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Efficient methods in finding aggregate nearest neighbor by projection-based filtering
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Indexing high-dimensional data for main-memory similarity search
Information Systems
On the asymptotic behavior of nearest neighbor search using pivot-based indexes
Proceedings of the Third International Conference on SImilarity Search and APplications
Combining elimination rules in tree-based nearest neighbor search algorithms
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Selecting vantage objects for similarity indexing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Effective monitoring by efficient fingerprint matching using a forest of NAQ-trees
Journal of Intelligent Information Systems
DAPSS: exact subsequence matching for data streams
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
A partitioning method for high dimensional data
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
BM+-Tree: a hyperplane-based index method for high-dimensional metric spaces
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
SC-tree: an efficient structure for high-dimensional data indexing
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Towards a similarity metric for comparing machine-readable privacy policies
iNetSec'11 Proceedings of the 2011 IFIP WG 11.4 international conference on Open Problems in Network Security
Efficient similarity search in metric spaces with cluster reduction
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
Inter-media hashing for large-scale retrieval from heterogeneous data sources
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Effective hashing for large-scale multimedia search
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
| Hi-index | 0.00 |
In many database applications, one of the common queries is to find 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 data domain is high dimensional, or the distance function used to compute distances between data objects is non-Euclidean. In this paper, we introduce a distance based index structure called multi-vantage point (mvp) tree for similarity queries on high-dimensional metric spaces. The mvp-tree uses more than one vantage point to partition the space into spherical cuts at each level. It also utilizes the pre-computed (at construction time) distances between the data points and the vantage points. We have done experiments to compare mvp-trees with vp-trees which have a similar partitioning strategy, but use only one vantage point at each level, and do not make use of the pre-computed distances. Empirical studies show that mvp-tree outperforms the vp-tree 20% to 80% for varying query ranges and different distance distributions.