SOME APPROACHES TO BEST-MATCH FILE SEARCHING
SOME APPROACHES TO BEST-MATCH FILE SEARCHING
复制标题
DOI：
10.1145/362003.362025
复制
发表时间：
1973-01-01
影响因子：
22.7
通讯作者：
KELLER, RM
中科院分区：
文献类型：
--
作者：
BURKHARD, WA;KELLER, RM
讨论了在一个文件中搜索一组键，以找到一个与给定查询键最接近的键的问题。在适当地定义了“最接近”之后，就关键字空间的度量而言，给出了三个文件结构及其相应的搜索算法，这旨在减少实现所需结果所需的比较次数。这些方法是使用度量和图论概念满足的某些不等式导出的。一些实证结果比较的方法的效率。
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.