The buffer tree: A new technique for optimal I/O-algorithms
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 334-345
- https://doi.org/10.1007/3-540-60220-8_74
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- External-memory computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for parallel memory, I: Two-level memoriesAlgorithmica, 1994
- External-Storage Data Structures for Plane-Sweep AlgorithmsBRICS Report Series, 1994
- An introduction to disk drive modelingComputer, 1994
- Deterministic distribution sort in shared and distributed memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1993
- Indexing for data models with constraints and classes (extended abstract)Published by Association for Computing Machinery (ACM) ,1993
- Priority search trees in secondary memory (extended abstract)Published by Springer Nature ,1988
- Computational GeometryPublished by Springer Nature ,1985
- A new data structure for representing sorted listsActa Informatica, 1982
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980