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
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
TL;DR: This paper introduces the priority vantage points method, which reduces the CPU overhead without adding extra space requirements, and introduces the Kvp structure, also introduced as an improvement, which stores less distance values than other vantage points algorithms.
Journal ArticleDOI
DBM-Tree: trading height-balancing for performance in metric access methods
TL;DR: A new dynamic MAM called the DBM-tree (Density-Based Metric tree), which can minimize the overlap between high-density nodes by relaxing the height-balancing of the structure, and an optimization algorithm called Shrink is presented, which improves the performance of an already builtDBM-tree by reorganizing the elements among their nodes.
Proceedings ArticleDOI
An assessment of a metric space database index to support sequence homology
TL;DR: A new hierarchical bulk-load algorithm that alternates between top-down and bottom-up clustering to initialize the index is introduced, and the bi-directional bulk load produces a more effective index than the existing M-tree initialization algorithms.
Proceedings ArticleDOI
Extracting Academic Genealogy Trees from the Networked Digital Library of Theses and Dissertations
TL;DR: This paper crawled data from the Networked Digital Library of Theses and Dissertations (NDLTD) and develops a framework to extract academic genealogy trees from this data and provides a series of analyses that describe the main properties of the academic genealog trees.
Posted Content
Indexing Metric Spaces for Exact Similarity Search
TL;DR: Different strengths and weaknesses of different indexing techniques are revealed in order to offer guidance on selecting an appropriate indexing technique for a given setting, and directing the future research for metric indexes.
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.