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

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.
Associative Retrieval Trie Hash-Coding
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.
Algorithms for trie compaction
The quality of the compaction is shown to be insensitive to the number of nodes, while a more relevant parameter is the alphabet size of the key, and analysis indicate that for actual tries, reductions of around 70 percent in the space required by the uncompacted trie can be expected.
Associative retrieval trie hash-coding (Extended Abstract)
A family of data base designs referred to as the H αβ&kgr; PMF-trie designs which yield a data structure with good worst case and average case performances and requires an amount of storage space essentially equal to that required of the records themselves is introduced.
Redesigning the string hash table, burst trie, and BST to exploit cache
Two alternatives to the standard representation of strings are explored: the simple expedient of including the string in its node, and, for linked lists, the more drastic step of replacing each list of nodes by a contiguous array of characters.


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