Trie memory

  title={Trie memory},
  author={Edward Fredkin},
  journal={Commun. ACM},
  • E. Fredkin
  • Published 1 September 1960
  • Computer Science
  • Commun. ACM
Trie memory is a way of storing and retrieving information. ~ It is applicable to information that consists of function-argument (or item-term) pairs--information conventionally stored in unordered lists, ordered lists, or pigeonholes. The main advantages of trie memory over the other memoIw plans just mentioned are shorter access time, greater ease of addition or up-dating, greater convenience in handling arguments of diverse lengths, and the ability to take advantage of redundancies in the… 

Figures from this paper

A Trie Compaction Algorithm for a Large Set of Keys
Theoretical and experimental observations show that the method presented is more practical than existing ones considering the use of dynamic key sets, information storage of keys and compression of transitions, and can uniquely determine information corresponding to keys while a DAWG cannot.
Efficient In-Memory Indexing with Generalized Prefix Trees
The generalized trie is presented, which is a prefix tree with variable prefix length for indexing arbitrary data types of fixed or variable length and yields improvements compared to existing in-memory index structures, especially for skewed data.
A Structure-Shared Trie Compression Method
An alternative approach using a new tie structure called, structure-shared trie (SS-trie) is proposed to reduce unused space using shared common structure and bit compression and shows that the method outperforms other methods.
An enhanced dynamic hash TRIE algorithm for lexicon search
An enhanced dynamic hash TRIE (eDH-TRIE) algorithm is proposed that can be used in a lexicon search in Chinese, Japanese and Korean (CJK) segmentation and in URL identification and is suitable for Unicode retrieval.
A compression algorithm using integrated record information for translation dictionaries
A compression scheme is proposed by replacing long strings into corresponding leaf node numbers of the trie to show that the new method of integrating dictionaries into one is more practical and efficient than previous ones.
Heuristics for trie index minimization
  • D. Comer
  • Computer Science
    ACM Trans. Database Syst.
  • 1979
This paper investigates several heuristics for reordering attributes, and derives bounds on the sizes of the worst tries produced by them in terms of the underlying file, and shows that for most applications, &Ogr;-tries are smaller than other implementations of tries, even when heuristic for improving storage requirements are employed.
A method of compressing trie structures
A new structure which reduces the total number of states in a traditional trie, called a double‐trie, is introduced in this paper and the efficiency of this method is shown by the results of simulations for various key sets.
Items of information that have been stored in a computer normally need to be accessed via their contents. In principle this is always possible by doing an exhaustive scan of the entire file of
An Efficient Trie Construction for Natural Language Dictionaries
A compression method for long strings by using trie arc for single words by replacing long strings into the corresponding leaf node numbers of the trie using the double array structure.
A new compact deletion algorithm for double-array structures
A fast and compact deletion method by using the property of nodes that have no brothers, which is about 330 times faster than Morita's method and keeps the space efficiency ratio at 100%.


File searching using variable length keys
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, and therefore care must be taken when using it to avoid excessive operating time.
A command structure for complex information processing
The general purpose digital computer, by virtue of its large capacity and general-purpose nature, has opened the possibility of research, into the nature of complex mechanisms per se. The challenge
Prediction and entropy of printed English
A new method of estimating the entropy and redundancy of a language is described. This method exploits the knowledge of the language statistics possessed by those who speak the language, and depends
Informal Memorandum, Bolt Beranek and Newman Inc
  • Informal Memorandum, Bolt Beranek and Newman Inc
  • 1959