Compact Balanced Tries

Pierre Nicodème (1)

1 ALGO - Algorithms

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.

Mots clés: algorithm; memory compactness; databases

Domaines: Algorithme et structure de données [cs.DS]

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