Affiliation:
1. Univ. of California, San Diego
2. Princeton Univ., Princeton, NJ
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
217 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Commonsense Knowledge Graph towards Super APP and Its Applications in Alipay;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04
2. LiteHST: A Tree Embedding based Method for Similarity Search;Proceedings of the ACM on Management of Data;2023-05-26
3. Spelling Check for Handwritten Homework and Exams;2023 6th International Conference on Artificial Intelligence and Big Data (ICAIBD);2023-05-26
4. MetricJoin: Leveraging Metric Properties for Robust Exact Set Similarity Joins;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
5. Offline Arabic Handwritten Text Recognition for Unsegmented Words Using Convolutional Recurrent Neural Network;Communications in Computer and Information Science;2023