Optimal External Memory Interval Management
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 32 (6) , 1488-1508
- https://doi.org/10.1137/s009753970240481x
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- The Buffer Tree: A Technique for Designing Batched External Data StructuresAlgorithmica, 2003
- Indexing Moving PointsJournal of Computer and System Sciences, 2003
- Efficient Splitting and Merging Algorithms for Order Decomposable ProblemsInformation and Computation, 1999
- Multidimensional access methodsACM Computing Surveys, 1998
- External segment treesAlgorithmica, 1994
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- A new data structure for representing sorted listsActa Informatica, 1982
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Organization and maintenance of large ordered indexesActa Informatica, 1972