Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
- 31 March 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 9 (4) , 211-236
- https://doi.org/10.1016/s0925-7721(97)00020-5
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Memory Paging for Connectivity and Path Problems in GraphsJournal of Graph Algorithms and Applications, 1998
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk SystemsSIAM Journal on Computing, 1998
- A Data Structure for Dynamically Maintaining Rooted TreesJournal of Algorithms, 1997
- OODB indexing by class-divisionACM SIGMOD Record, 1995
- The I/O-complexity of Ordered Binary-Decision Diagram manipulationPublished by Springer Nature ,1995
- Algorithms for parallel memory, I: Two-level memoriesAlgorithmica, 1994
- Fast Permuting on Disk ArraysJournal of Parallel and Distributed Computing, 1993
- The Maximum Size of Dynamic Data StructuresSIAM Journal on Computing, 1991
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Ubiquitous B-TreeACM Computing Surveys, 1979