External memory data structures. (Invited paper)

DOI10.1007/3-540-44676-1_1MaRDI QIDQ4796163zbMATH OpenFDO

Authors Lars Arge

Publication date 2 March 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/2161/21610001

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1792106
• Computing and Combinatorics
• scientific article; zbMATH DE number 1424311
• The buffer tree: A technique for designing batched external data structures
• Algorithms and data structures for external memory

Cited in

(6)

• On R-trees with low query complexity
• Analyzing clustering and partitioning problems in selected VLSI models
• Implementing I/O-efficient data structures using TPIE
• scientific article; zbMATH DE number 1792106 (Why is no real title available?)
• Computing and Combinatorics
• scientific article; zbMATH DE number 1424311 (Why is no real title available?)

This page was built for publication: External memory data structures. (Invited paper)

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