The buffer tree: A technique for designing batched external data structures

Algorithmica (New York)

Volumn 37, Issue 1, 2003, Pages 1-24

  Arge, Lars ^a  

^a Duke University   (United States)

Author keywords

Batched external data structures; Buffer tree; I O efficiency; Internal memory algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STORAGE EQUIPMENT; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES; SORTING;

BATCHED EXTERNAL DATA STRUCTURES; BUFFER TREE; I-O EFFICIENCY; INTERNAL MEMORY ALGORITHMS;

DATA STRUCTURES;

EID: 85032070210     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1021-x     Document Type: Article

References (45)

1. P. K. Agarwal, L. Arge, G. S. Brodal, and J. S. Vitter. I/O-efficient dynamic point location in monotone planar subdivisions. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 1116-1127, 1999.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
3. L. Arge. The buffer tree: a new technique for optimal I/O-algorithms. In Proc. Workshop on Algorithms and Data Structures, pages 334-345. LNCS 955. Springer-Verlag, Berlin, 1995.
4. L. Arge. The I/O-complexity of ordered binary-decision diagram manipulation. In Proc. Internat. Symp. on Algorithms and Computation, pages 82-91. LNCS 1004, Springer-Verlag, Berlin, 1995. A complete version appear as BRICS Technical Report RS-96-29, University of Aarhus.
5. L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS, pages 213-254. LNCS 1340. Springer-Verlag, Berlin, 1997.
6. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-358. Kluwer, Dordrecht, 2002.
7. L. Arge, P. Ferragina, R. Grossi, and J. Vitter. On sorting strings in external memory. In Proc. ACM Symp. on Theory of Computation, pages 540-548, 1997.
8. L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. Algorithmica, 33(1):104-128, 2002.
9. L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Proc. Workshop on Algorithms and Data Structures, pages 83-94. LNCS 709. Springer-Verlag, Berlin, 1993.
10. L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization, pages 139-160. DIMACS series, volume 50. American Mathematical Society, Providence, RI, 1999.
11. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J. S. Vitter. A unified approach for indexed and non-indexed spatial joins. In Proc. Conf. on Extending Database Technology, pages 413-429, 1999.
12. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable sweeping-based spatial join. In Proc. Internat. Conf. on Very Large Databases, pages 570-581, 1998.
13. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 685-694, 1998.
14. L. Arge, L. Toma, and J. S. Vitter. I/O-efficient algorithms for problems on grid-based terrains. In Proc. Workshop on Algorithm Engineering and Experimentation, 2000.
15. L. Arge and J. Vahrenhold. I/O-efficient dynamic planar point location. In Proc. ACM Symp. on Computational Geometry, pages 191-200, 2000.
16. L. Arge, D. E. Vengroff, and J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. In Proc. European Symp. on Algorithms, pages 295-310. LNCS 979. Springer-Verlag, Berlin, 1995. To appear in special issues of Algorithmica on geographical Information systems.
17. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. IEEE Symp. on Foundations of Computer Science, pages 560-569, 1996.
18. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601-631, 1997.
19. R. D. Barve and J. S. Vitter. A simple and efficient parallel disk mergesort. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 232-241, 1999.
20. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
21. J. L. Bentley and D. Wood. An optimal worst case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers, 29:571-577, 1980.
22. K. Brengel, A. Crauser, P. Ferragina, and U. Mayer. An experimental study of priority queues in external memory. ACM Journal on Experimental Algorithmics, 5, article 17, 2001.
23. G. S. Brodal and J. Katajainen. Worst-case efficient external-memory priority queues. In Proc. Scandinavian Workshop on Algorithms Theory, pages 107-118. LNCS 1432. Springer-Verlag, Berlin, 1998.
24. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 859-860, 2000.
25. Y-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 139-149, 1995.
26. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
27. A. Crauser and K. Mehlhorn. LEDA-SM: extending LEDA to secondary memory. In Proc. Workshop on Algorithm Engineering, 1999.
28. H. Edelsbrunner and M. Overmars. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms, 6:515-542, 1985.
29. R. Fadel, K. V. Jakobsen, J. Katajainen, and J. Teuhola. Heaps and heapsort on secondary storage. Theoretical Computer Science, 220(2):345-362, 1999.
30. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symp. on Foundations of Computer Science, pages 714-723, 1993.
31. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157-184, 1982.
32. D. Hutchinson, A. Maheshwari, J.-R. Sack, and R. Velicescu. Early experiences in implementing the buffer tree. In Proc. Workshop on Algorithm Engineering, pages 92-103, 1997.
33. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley, Reading, MA, second edition, 1998.
34. V. Kumar and E. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. IEEE Symp. on Parallel and Distributed Processing, pages 169-177, 1996.
35. K. Mehlhorn. Data Structures and Algorithms, 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York, 1984.
36. M. H. Nodine and J. S. Vitter. Deterministic distribution sort in shared and distributed memory multi-processors. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 120-129, 1993.
37. M. H. Nodine and J. S. Vitter. Greed Sort: optimal deterministic sorting on parallel disks. Journal of the ACM, 42(4):919-933, 1995.
38. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
39. P. Sanders, S. Egner, and J. Korst. Fast concurrent access to parallel disks. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 849-858, 2000.
40. J. van den Bercken and B. Seeger. An evaluation of generic bulk loading techniques. In Proc. Internat. Conf. on Very Large Databases, pages 461-470, 2001.
41. J. van den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In Proc. Internat. Conf. on Very Large Databases, pages 406-415, 1997.
42. J. S. Vitter. Online data structures in external memory. In Proc. Internat. Colloq. on Automata, Languages, and Programming, pages 119-133. LNCS 1644. Springer-Verlag, Berlin, 1999.
43. J. S. Vitter. External memory algorithms and data structures: dealing with MASSIVE data. ACM Computing Surveys, 33(2):209-271, 2001.
44. J. S. Vitter and D. A. Hutchinson. Distribution sort with randomized cycling. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 77-86, 2001.
45. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory, I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.