File searching using variable length keys

  title={File searching using variable length keys},
  author={Rene De La Briandais},
  booktitle={IRE-AIEE-ACM Computer Conference},
Many computer applications require the storage of large amounts of information within the computer's memory where it will be readily available for reference and updating. Quite commonly, more storage space is required than is available in the computer's high-speed working memory. It is, therefore, a common practice to equip computers with magnetic tapes, disks, or drums, or a combination of these to provide additional storage. This additional storage is always slower in operation than the… 

Figures from this paper

Storage and search properties of a tree-organized memory system
The purpose of this paper is to examine the storage and search properties of a tree-organized storage system assuming that a memory possessing certain list properties is available.
B-tries for disk-based string management
This work proposes new algorithms for the insertion, deletion, and equality search of variable-length strings in a disk-resident B-trie, as well as novel splitting strategies which are a critical element of a practical implementation.
Multi-character Tries for Text Searching
Experience with a generalized information processing system
A generalized computer information storage and retrieval system has been in use at the Naval Ordnance Laboratory, Corona, California since 1960 and has permitted the establishment and use of files of many varied and interrelated types of data with a minimum of effort on the part of the user.
File Organization and Addressing
The principal approaches to random-access file organization and addressing are reviewed and the relation between sorting and random- access file addressing is clarified by viewing both as belonging to a common class of ordering operations.
Partial match retrieval for non-uniform query distributions*
  • V. Alagar, C. Soockan
  • Computer Science
    1979 International Workshop on Managing Requirements Knowledge (MARK)
  • 1979
This paper addresses both file design and algorithm design when searches are to be made in a data base for queries of speciaJ type, with information retrieval based on secondary keys.
Associative Retrieval Trie Hash-Coding
Burst tries: a fast, efficient data structure for string keys
These experiments show that the burst trie is particularly effective for the skewed frequency distributions common in text collections, and dramatically outperforms all other data structures for the task of managing strings while maintaining sort order.
Trie memory
In this paper several paradigms of trie memory are described and compared with other memory paradigm, their advantages and disadvantages are examined in detail, and applications are discussed.
Hashing and trie algorithms for partial match retrieval
A new class of partial match file designs (called PMF designs) based upon hash coding and trie search algorithms which provide good worst-case performance is introduced.


Addressing for Random-Access Storage
Estimates are made of the amount of searching required for the exact location of a record in several types of storage systems, including the index-table method of addressing and the sorted-file
Programming the logic theory machine
A companion paper has discussed a system, called the Logic Theory Machine (LT), that discovers proofs for theorems in symbolic logic in much the same way as a human does. It manipulates symbols, it