Journal ArticleDOI
Some approaches to best-match file searching
W. A. Burkhard,Robert M. Keller +1 more
Reads0
Chats0
TLDR
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.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.read more
Citations
More filters
Book ChapterDOI
Improved fast similarity search in dictionaries
TL;DR: An algorithm is engineer to solve the approximate dictionary matching problem and presents data structures that support fault tolerant queries by generating an index and a generalization of the method that eases memory consumption and preprocessing time significantly.
Proceedings ArticleDOI
Fast retrieval of multi- and hyperspectral images using relevance feedback
TL;DR: It is shown that a triangle inequality search technique applied to a relevance feedback retrieval algorithm can significantly speed up the search for and retrieval of physical events of interest in large remote-sensing databases.
Journal ArticleDOI
An intersection inequality sharper than the tanimoto triangle inequality for efficiently searching large databases.
TL;DR: A new intersection inequality is derived which provides a bound on the Tanimoto similarity between two fingerprint vectors and it is shown that this bound is considerably sharper than the bound associated with the triangle inequality of the TAnimoto distance.
Book ChapterDOI
An index data structure for searching in metric space databases
TL;DR: Empirical results show that the EGNAT is suitable for conducting similarity searches on very large metric space databases, and it is shown that this data structure allows efficient parallelization on distributed memory parallel architectures.
Journal ArticleDOI
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries
TL;DR: This paper proposes a new hashing scheme, called bucket-oriented symbolic Gray code, which can be used to produce any arbitrary Cartesian product file, which has been shown to be good for partial match queries.
References
More filters
Book
Perceptrons: An Introduction to Computational Geometry
Marvin Minsky,Seymour A. Papert +1 more
TL;DR: The aim of this book is to seek general results from the close study of abstract version of devices known as perceptrons.
Book
Shift register sequences
TL;DR: The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Journal ArticleDOI
An Analysis of Some Graph Theoretical Cluster Techniques
J. Gary Augustson,Jack Minker +1 more
TL;DR: Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored and two algorithms have been tested that find maximal complete subgraphs.
Journal ArticleDOI
Scatter storage techniques
TL;DR: L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
Journal ArticleDOI
Corrections to Bierstone's Algorithm for Generating Cliques
TL;DR: The counterexamples to their and the modified version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph are presented.