Compact Balanced Tries

Pierre Nicodème 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : We show how it is possible to split Compact Tries described as bit-lists in a segmented and flexible structure of B-tree type, keeping the compactness advantages of the Compact Tries and recovering all the important properties of B-trees.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00568706
Contributor : Pierre Nicodeme <>
Submitted on : Wednesday, February 23, 2011 - 1:41:12 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, May 24, 2011 - 3:56:03 AM

File

cbtries.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00568706, version 1

Collections

Citation

Pierre Nicodème. Compact Balanced Tries. Algorithms, Software, Architecture Information Processing 92, Sep 1992, Madrid, Spain. pp.477-483. ⟨hal-00568706⟩

Share

Metrics

Record views

186

Files downloads

108