New techniques for best-match retrieval

Dennis Shasha, Tsong Li Wang

Research output: Contribution to journalArticle

Abstract

A scheme to answer best-match queries from a file containing a collection of objects is described. A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target. Previous work [5, 33] suggests that one can reduce the number of comparisons required to achieve the desired results using the triangle inequality, starting with a data structure for the file that reflects some precomputed intrafile distances. We generalize the technique to allow the optimum use of any given set of precomputed intrafile distances. Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.

Original languageEnglish (US)
Pages (from-to)140-158
Number of pages19
JournalACM Transactions on Information Systems
Volume8
Issue number2
DOIs
StatePublished - Apr 1990

Fingerprint

Data structures
Query
Relative performance
Empirical results
Similarity measure

ASJC Scopus subject areas

  • Information Systems

Cite this

New techniques for best-match retrieval. / Shasha, Dennis; Wang, Tsong Li.

In: ACM Transactions on Information Systems, Vol. 8, No. 2, 04.1990, p. 140-158.

Research output: Contribution to journalArticle

Shasha, Dennis ; Wang, Tsong Li. / New techniques for best-match retrieval. In: ACM Transactions on Information Systems. 1990 ; Vol. 8, No. 2. pp. 140-158.
@article{150a6126e1f546e781a10d4e84e96d0b,
title = "New techniques for best-match retrieval",
abstract = "A scheme to answer best-match queries from a file containing a collection of objects is described. A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target. Previous work [5, 33] suggests that one can reduce the number of comparisons required to achieve the desired results using the triangle inequality, starting with a data structure for the file that reflects some precomputed intrafile distances. We generalize the technique to allow the optimum use of any given set of precomputed intrafile distances. Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.",
author = "Dennis Shasha and Wang, {Tsong Li}",
year = "1990",
month = "4",
doi = "10.1145/96105.96111",
language = "English (US)",
volume = "8",
pages = "140--158",
journal = "ACM Transactions on Information Systems",
issn = "1046-8188",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - New techniques for best-match retrieval

AU - Shasha, Dennis

AU - Wang, Tsong Li

PY - 1990/4

Y1 - 1990/4

N2 - A scheme to answer best-match queries from a file containing a collection of objects is described. A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target. Previous work [5, 33] suggests that one can reduce the number of comparisons required to achieve the desired results using the triangle inequality, starting with a data structure for the file that reflects some precomputed intrafile distances. We generalize the technique to allow the optimum use of any given set of precomputed intrafile distances. Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.

AB - A scheme to answer best-match queries from a file containing a collection of objects is described. A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target. Previous work [5, 33] suggests that one can reduce the number of comparisons required to achieve the desired results using the triangle inequality, starting with a data structure for the file that reflects some precomputed intrafile distances. We generalize the technique to allow the optimum use of any given set of precomputed intrafile distances. Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0025406349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025406349&partnerID=8YFLogxK

U2 - 10.1145/96105.96111

DO - 10.1145/96105.96111

M3 - Article

VL - 8

SP - 140

EP - 158

JO - ACM Transactions on Information Systems

JF - ACM Transactions on Information Systems

SN - 1046-8188

IS - 2

ER -