A unifying framework for trie design heuristics

DOI10.1016/0020-0190(90)90129-LzbMATH Open0696.68035OpenAlexW1969126555MaRDI QIDQ911258FDOQ911258

Authors: O. J. Murphy 

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90129-l

Recommendations

• Algorithms for trie compaction
• Improved behaviour of tries by adaptive branching
• Dynamical sources in information theory: A general analysis of trie structures
• scientific article; zbMATH DE number 2127731
• Combinatorial Pattern Matching

zbMATH Keywords

information theoryNP-hardretrievalinformation storagemulti-key searchingtrie index construction

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Artificial intelligence (68T99) Communication, information (94A99)

Cites Work

• A Mathematical Theory of Communication
• Application of information theory to the construction of efficient decision trees
• Performance bounds on the splitting algorithm for binary testing
• The Complexity of Trie Index Construction

Cited In (7)

• An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
• Combinatorial Pattern Matching
• Decision tree design by simulated annealing
• Variable-depth trie index optimization: theory and experimental results
• A study of trie-like structures under the density model
• Breadth-first search strategies for trie-based syntactic pattern recognition
• Algorithms for trie compaction

This page was built for publication: A unifying framework for trie design heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911258)