A unifying framework for trie design heuristics

DOI10.1016/0020-0190(90)90129-LzbMath0696.68035OpenAlexW1969126555MaRDI QIDQ911258

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

zbMATH Keywords

NP-hardinformation theoryretrievalinformation storagemulti-key searchingtrie index construction

Mathematics Subject Classification ID

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

Related Items (1)

Decision tree design by simulated annealing

Cites Work

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

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