A pruned TRIE to index a sorted file and its evaluation

DOI10.1016/0306-4379(84)90024-3zbMATH Open0546.68084OpenAlexW1985998685MaRDI QIDQ798013FDOQ798013

Authors: D. Plateau 

Publication date: 1984

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(84)90024-3

Recommendations

• Variable-depth trie index optimization: theory and experimental results
• Algorithms for trie compaction
• scientific article; zbMATH DE number 3845094
• New trie data structures which support very fast search operations
• Improved behaviour of tries by adaptive branching

zbMATH Keywords

system performancedata base machine VERSOdata base management systemindexing a sorted fileTRIE structure

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cited In (2)

• Variable-depth trie index optimization: theory and experimental results
• Title not available (Why is that?)

This page was built for publication: A pruned TRIE to index a sorted file and its evaluation

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