Reference-based indexing for metric spaces with costly distance measures

Authors:
Jayendra Venkateswaran;Tamer Kahveci;Christopher Jermaine;Deepak Lachwani
Affiliations:
Computer and Information Science and Engineering, University of Florida, Gainesville, USA 32611;Computer and Information Science and Engineering, University of Florida, Gainesville, USA 32611;Computer and Information Science and Engineering, University of Florida, Gainesville, USA 32611;Google Inc., Mountain View, USA 94043
Venue:
The VLDB Journal — The International Journal on Very Large Data Bases
Year:
2008

Citing 27
Cited 5

Random sampling with a reservoir

ACM Transactions on Mathematical Software (TOMS)
Algorithms for approximate string matching

Information and Control
An algorithm for finding nearest neighbours in (approximately) constant average time

Pattern Recognition Letters
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

Pattern Recognition Letters
Distance-based indexing for high-dimensional metric spaces

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
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
Searching in metric spaces

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
Similarity Search without Tears: The OMNI Family of All-purpose Access Methods

Proceedings of the 17th International Conference on Data Engineering
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
Efficient Index Structures for String Databases

Proceedings of the 27th International Conference on Very Large Data Bases
Fast and Practical Approximate String Matching

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Proximity Matching Using Fixed-Queries Trees

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces

SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Pivot selection techniques for proximity searching in metric spaces

Pattern Recognition Letters
A Metric for Distributions with Applications to Image Databases

ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
ViVo: Visual Vocabulary Construction for Mining Biomedical Images

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Similarity Search: The Metric Space Approach (Advances in Database Systems)

Similarity Search: The Metric Space Approach (Advances in Database Systems)
Reference-based indexing of sequence databases

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Selecting vantage objects for similarity indexing

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval

ISM '06 Proceedings of the Eighth IEEE International Symposium on Multimedia
Indexing spatially sensitive distance measures using multi-resolution lower bounds

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology

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
On the asymptotic behavior of nearest neighbor search using pivot-based indexes

Proceedings of the Third International Conference on SImilarity Search and APplications
Indexing dense nested metric spaces for efficient similarity search

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A generic framework for efficient and effective subsequence retrieval

Proceedings of the VLDB Endowment
Efficient range queries over uncertain strings

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of similarity search in databases with costly metric distance measures. Given limited main memory, our goal is to develop a reference-based index that reduces the number of comparisons in order to answer a query. The idea in reference-based indexing is to select a small set of reference objects that serve as a surrogate for the other objects in the database. We consider novel strategies for selection of references and assigning references to database objects. For dynamic databases with frequent updates, we propose two incremental versions of the selection algorithm. Our experimental results show that our selection and assignment methods far outperform competing methods.