Implementing I/O-efficient data structures using TPIE

DOI10.1007/3-540-45749-6_12MaRDI QIDQ4411348zbMATH OpenFDO

Authors Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter

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/24610088.htm

Mathematics Subject Classification ID

Theory of software (68N99) Data structures (68P05) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1424311
• scientific article; zbMATH DE number 1792107
• External memory data structures. (Invited paper)
• Algorithms and data structures for external memory
• The buffer tree: A technique for designing batched external data structures

Cited in

(6)

• TPIE
• The study of multidimensional R-tree-based index scalability in multicore environment
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• I/O-efficient algorithms for CDBs
• The ins and outs of Clean I/O
• I/O-efficient point location using persistent B-trees

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: Implementing I/O-efficient data structures using TPIE

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