Thumbnail
Access Restriction
Subscribed

Author Keller, R. M. ♦ Burkhard, W. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Matching ♦ Heuristics ♦ Best match ♦ File searching ♦ File structuring
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.
Description Affiliation: Princeton Univ., Princeton, NJ (Keller, R. M.) || Univ. of California, San Diego (Burkhard, W. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 4
Page Count 7
Starting Page 230
Ending Page 236


Open content in new tab

   Open content in new tab
Source: ACM Digital Library