Some approaches to best-match file searching
Communications of the ACM
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Hierarchical file organization and its application to similar-string matching
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
ACM Computing Surveys (CSUR)
Best-Match Retrieval for Structured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Computing Surveys (CSUR)
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Query Processing for Distance Metrics
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering in massive data sets
Handbook of massive data sets
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
Disk aware discord discovery: finding unusual time series in terabyte sized datasets
Knowledge and Information Systems
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Document visual similarity measure for document search
Proceedings of the 11th ACM symposium on Document engineering
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Nearest neighbours search using the PM-Tree
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
| Hi-index | 48.22 |
Improvements to the exhaustive search method of best-match file searching have previously been achieved by doing a preprocessing step involving the calculation of distances from a reference point. This paper discusses the proper choice of reference points and extends the previous algorithm to use more than one reference point. It is shown that reference points should be located outside of data clusters. The results of computer simulations are presented which show that large improvements can be achieved by the proper choice and location of multiple reference points.