The Buffer Tree: A New Technique for Optimal I/O Algorithms
AbstractIn this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure. We show how the technique can be used to develop a search tree like structure, a priority queue, a (one-dimensional) range tree and a segment tree, and give examples of how these structures can be used to develop efficient I/O algorithms. All our algorithms are either extremely simple or straightforward generalizations of known internal-memory algorithms - given the developed external data structures. We believe that algorithms relying on the developed structure will be of practical interest due to relatively small constants in the asymptotic bounds.
How to Cite
Arge, L. (1996). The Buffer Tree: A New Technique for Optimal I/O Algorithms. BRICS Report Series, 3(28). https://doi.org/10.7146/brics.v3i28.20009
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.