Variable length tree structures having minimum average search time
Communications of the ACM
Randomized binary search technique
Communications of the ACM
Storage and search properties of a tree-organized memory system
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
An associative file store using fragments for run-time indexing and compression
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
On the use of bit maps for multiple key retrieval
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Hi-index | 48.25 |
A standard information retrieval operation is to determine which records in a data collection satisfy a given query expressed in terms of data values. The process of locating the desired responses can be represented by a tree search model. This paper poses an optimization problem in the design of such trees to serve a well-specified application. The problem is academic in the sense that ordinarily the optimal tree cannot be implemented by means of practical techniques. On the other hand, it is potentially useful for the comparison it affords between observed performance and that of an intuitively attractive ideal search procedure.As a practical application of such a model this paper considers the design of a novel tree search scheme based on a bit vector representation of data and shows that essentially the same algorithm can be used to design either an ideal search tree or a bit-vector tree. An experimental study of a small formatted file illustrates the concepts.