scispace - formally typeset
Journal ArticleDOI

Some approaches to best-match file searching

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

Shape retrieval and recognition on mobile devices

TL;DR: This paper presents a proof-of-concept shape/contour-based visual recognition and retrieval approach with the main goal of lightweight implementation on mobile devices locally, not relying on network connection or server side processing.
DissertationDOI

Consultas por similaridade no modelo relacional

TL;DR: This work proposes new ways to represent queries with multiple predicates, including similarity, identity or OR, as well as new operators derived from k-NN that are better suited for a RDBMS environment containing hybrid queries, and also enable control over the untying process.
Proceedings Article

Inducing Search Keys for Name Filtering

TL;DR: The accuracy of ETK in a preliminary empirical evaluation suggests that it is well-suited for phonetic filtering applications such as recognizing alternative cross-lingual transliterations.
Proceedings Article

Aumento da Eficiência das Estruturas de Indexação Métricas com Uso de Conceitos da Lógica Nebulosa.

TL;DR: This paper shows that it is possible to enhance the performance of these structures by using Fuzzy Logic concepts, through an algorithm that uses more than one parameter to define how the most appropriate subtree must be chosen in insertion operations.
Proceedings Article

Efficient Name Variation Detection.

TL;DR: Five algorithms for efficient candidate retrieval ofNames frequently occur in orthographic variations resulting from phonetic variations and transcription errors, and the high-recall retrieval algorithms were multiple orders of magnitude more costly than the low-Recall algorithms.
References
More filters
Book

Perceptrons: An Introduction to Computational Geometry

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

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.
Related Papers (5)