Efficient tree layout in a multilevel memory hierarchy

DOI10.1007/3-540-45749-6_18MaRDI QIDQ4411356zbMATH OpenFDO

Authors Erik D. Demaine, Martin Farach-Colton, Michael A. Bender

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610165.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cache-Oblivious B-Trees
• scientific article; zbMATH DE number 2119642
• Worst-case optimal tree layout in external memory
• Packing trees
• How to Pack Trees

Cited in

(8)

• How to pack directed acyclic graphs into small blocks
• Worst-case optimal tree layout in external memory
• scientific article; zbMATH DE number 3907783 (Why is no real title available?)
• How to Pack Trees
• Array layouts for comparison-based searching
• Optimal cache-oblivious mesh layouts
• The cost of cache-oblivious searching
• Minimizing access pointers into trees and arrays

This page was built for publication: Efficient tree layout in a multilevel memory hierarchy

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