Some approaches to best-match file searching

Authors:
W. A. Burkhard;R. M. Keller
Affiliations:
Univ. of California, San Diego;Princeton Univ., Princeton, NJ
Venue:
Communications of the ACM
Year:
1973

Citing 5
Cited 88

An Analysis of Some Graph Theoretical Cluster Techniques

Journal of the ACM (JACM)
Corrections to Bierstone's Algorithm for Generating Cliques

Journal of the ACM (JACM)
Scatter storage techniques

Communications of the ACM
Shift Register Sequences

Shift Register Sequences
Perceptrons: An Introduction to Computational Geometry

Perceptrons: An Introduction to Computational Geometry

New techniques for best-match retrieval

ACM Transactions on Information Systems (TOIS)
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

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
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Hierarchical file organization and its application to similar-string matching

ACM Transactions on Database Systems (TODS)
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Analysis of Effectiveness of Retrieval in Clustered Files

Journal of the ACM (JACM)
Indexing large metric spaces for similarity search queries

ACM Transactions on Database Systems (TODS)
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space

ACM Transactions on Mathematical Software (TOMS)
The use of normal multiplication tables for information storage and retrieval

Communications of the ACM
The choice of reference points in best-match file searching

Communications of the ACM
The best-match problem in document retrieval

Communications of the ACM
Best-Match Retrieval for Structured Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Searching in metric spaces

ACM Computing Surveys (CSUR)
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

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
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees

IEEE Transactions on Knowledge and Data Engineering
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
Query Processing for Distance Metrics

VLDB '90 Proceedings of the 16th 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
String Matching with Metric Trees Using an Approximate Distance

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Priority Vantage Points Structures for Similarity Queries in Metric Spaces

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
Searching in metric spaces by spatial approximation

The VLDB Journal — The International Journal on Very Large Data Bases
Clustering in massive data sets

Handbook of massive data sets
Efficient Content-Based Image Retrieval: Experimental Results

CBAIVL '99 Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries
A tree algorithm for nearest neighbor searching in document retrieval systems

SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Pivot selection techniques for proximity searching in metric spaces

Pattern Recognition Letters
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
A pivot-based routine for improved parent-finding in hybrid MDS

Information Visualization - Special issue of selected and extended InfoVis 03 papers
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces

IEEE Transactions on Knowledge and Data Engineering
Accelerating approximate similarity queries using genetic algorithms

Proceedings of the 2005 ACM symposium on Applied computing
A compact space decomposition for effective metric indexing

Pattern Recognition Letters
Exploiting distance coherence to speed up range queries in metric indexes

Information Processing Letters
Scaling distributional similarity to large corpora

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Engineering efficient metric indexes

Pattern Recognition Letters
DBM*-Tree: an efficient metric access method

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Genetic algorithms for approximate similarity queries

Data & Knowledge Engineering
Detecting time series motifs under uniform scaling

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Partial-match queries and file designs

VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient

The VLDB Journal — The International Journal on Very Large Data Bases
t-Spanners for metric space searching

Data & Knowledge Engineering
CM-tree: A dynamic clustered index for similarity search in metric databases

Data & Knowledge Engineering
On k-Nearest Neighbor Voronoi Diagrams in the Plane

IEEE Transactions on Computers
Reference-based indexing for metric spaces with costly distance measures

The VLDB Journal — The International Journal on Very Large Data Bases
Merging nodes under sequential observability

Proceedings of the 45th annual Design Automation Conference
Context-sensitive queries for image retrieval in digital libraries

Journal of Intelligent Information Systems
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
Searching and Updating Metric Space Databases Using the Parallel EGNAT

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion

SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
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
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data

SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
The Onion-Tree: Quick Indexing of Complex Data in the Main Memory

ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
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
New prune rules for similarity search

ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Exploiting distance coherence to speed up range queries in metric indexes

Information Processing Letters
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space

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

Proceedings of the Third International Conference on SImilarity Search and APplications
Slicing the metric space to provide quick indexing of complex data in the main memory

Information Systems
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
Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Real time tracking of musical performances

MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Improved fast similarity search in dictionaries

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Contour based shape retrieval

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part III
Improving hybrid MDS with pivot-based searching

INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Navigating k-nearest neighbor graphs to solve nearest neighbor searches

MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Geodesics on the Manifold of Multivariate Generalized Gaussian Distributions with an Application to Multicomponent Texture Discrimination

International Journal of Computer Vision
Recursive lists of clusters: a dynamic data structure for range queries in metric spaces

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
A partitioning method for high dimensional data

Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
An index data structure for searching in metric space databases

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Indexing issues in supporting similarity searching

PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
An indexing approach for representing multimedia objects in high-dimensional spaces based on expectation maximization algorithm

MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems
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
On the Geometry of Multivariate Generalized Gaussian Models

Journal of Mathematical Imaging and Vision
The list of clusters revisited

MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
DSACL+-tree: a dynamic data structure for similarity search in secondary memory

SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Shape retrieval and recognition on mobile devices

MUSCLE'11 Proceedings of the 2011 international conference on Computational Intelligence for Multimedia Understanding
Modelling efficient novelty-based search result diversification in metric spaces

Journal of Discrete Algorithms
A fast generative spell corrector based on edit distance

ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
An improved method of locality sensitive hashing for indexing large-scale and high-dimensional features

Signal Processing
A scalable re-ranking method for content-based image retrieval

Information Sciences: an International Journal

Quantified Score

Hi-index	48.27

Visualization

Abstract

The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After “closest,” in terms of a metric on the the key space, is suitably defined, three file structures are presented together with their corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result. These methods are derived using certain inequalities satisfied by metrics and by graph-theoretic concepts. Some empirical results are presented which compare the efficiency of the methods.