The buffer tree: A new technique for optimal I/O-algorithms

DOI10.1007/3-540-60220-8_74MaRDI QIDQ5057446zbMATH OpenOpenAlexFDO

Authors Lars Arge

Publication date 16 December 2022

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

Full work available at URL https://doi.org/10.1007/3-540-60220-8_74

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

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

Cites work

• A general lower bound on the I/O-complexity of comparison-based algorithms
• A new data structure for representing sorted lists
• Algorithms for parallel memory, I: Two-level memories
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
• External-memory algorithms for processing line segments in geographic information systems
• scientific article; zbMATH DE number 4020488 (Why is no real title available?)
• scientific article; zbMATH DE number 4060691 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 176491 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• scientific article; zbMATH DE number 910894 (Why is no real title available?)
• Indexing for data models with constraints and classes

Cited in

(18)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• The buffer tree: A technique for designing batched external data structures
• Heaps and heapsort on secondary storage
• On the existence and construction of non-extreme (a,b)-trees.
• An external memory data structure for shortest path queries
• Optimal External Memory Interval Management
• scientific article; zbMATH DE number 1476487 (Why is no real title available?)
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• Parallel and I/O-efficient randomisation of massive networks using global curveball trades
• Predecessor queries in dynamic integer sets
• Worst-case efficient external-memory priority queues
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
• Topology B-trees and their applications
• scientific article; zbMATH DE number 975346 (Why is no real title available?)
• Belga B-trees
• Belga B-trees
• From tcs to learning theory (invited paper)
• Lazy B-trees

This page was built for publication: The buffer tree: A new technique for optimal I/O-algorithms

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