scientific article; zbMATH DE number 1947384

MaRDI QIDQ4411348zbMATH OpenFDO

Authors Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter

Publication date 8 July 2003

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(6)

• scientific article; zbMATH DE number 1515868 (Why is no real title available?)
• I/O-efficient point location using persistent B-trees
• The study of multidimensional R-tree-based index scalability in multicore environment
• TPIE
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• The ins and outs of Clean I/O

Describes a project that uses

Uses Software

• LEDA

This page was built for publication:

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