Worst-case optimal tree layout in external memory

DOI10.1007/s00453-013-9856-2zbMath1322.68060arXivcs/0410048OpenAlexW2137457770MaRDI QIDQ2354018

John Iacono, Erik D. Demaine, Stefan Langerman

Publication date: 10 July 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0410048

zbMATH Keywords

data structurestreesexternal-memory

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

I/O efficient dynamic data structures for longest prefix queries ⋮ Succinct and I/O efficient data structures for traversal in trees ⋮ On the Weak Prefix-Search Problem ⋮ The power and limitations of static binary search trees with lazy finger ⋮ Belga B-trees

Cites Work

• Unnamed Item
• Blocking for external graph searching
• The string B-tree
• How to Pack Trees