Bibliography

1

Alok Aggarwal and Jeffrey Scott Vitter.
The input/output complexity of sorting and related problems.
Commun. ACM, 31(9):1116-1127, 1988.

2

Largs Arge, Klaus Hinrichs, Darren Erik Vengroff, and Jeffery Scott Vitter.
Efficient bulk operations on dynamic r-trees.
In ALENEX, pages 328-248, 1999.

3

Lars Arge.
Efficient External-Memory Data Structures and Applications.
PhD thesis, 1996.

4

Lars Arge.
The buffer tree: A technique for designing batched external data structures.
Algorithmica, pages 1-24, 2003.

5

Lars Arge, Mark de Berg, Herman J. Haverkort, and Ke Yi.
The priority r-tree: A practically efficient and worst-case optimal r-tree.
In SIGMOD Conference, pages 347-358, 2004.

6

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, and Jeffrey Scott Vitter.
Theory and practice of i/o-efficient algorithms for multidimensional batched searching problems (extended abstract).
In SODA, pages 685-694, 1998.

7

Lars Arge, Darren Erik Vengroff, and Jeffery Scott Vitter.
External-memory algorithms for processing line segments in geographic information systems.
Algorithmica, 38:OF01-OF25, 2006.

8

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger.
The r*-tree: An efficient and robust access method for points and rectangles+.
In Proceedings ACM SIGMOD Conference on the Management of Data, pages 322-331, 1990.

9

Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, and Jeffrey Scott Vitter.
External-memory graph algorithms.
In SODA, pages 139-149, 1995.

10

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos.
Randomized external-memory algorithms for some geometric problems.
In Symposium on Computational Geometry, pages 259-268, 1998.

11

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos.
Randomized external-memory algorithms for line segment intersection and other geometric problems.
Int. J. Comput. Geometry Appl., 11(3):305-337, 2001.

12

Wolfgang Dittrich, David A. Hutchinson, and Anil Maheshwari.
Blocking in parallel multisearch problems.
Theory Comput. Syst., 34(2):145-189, 2001.

13

Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, and Jeffrey Scott Vitter.
External-memory computational geometry (preliminary version).
In FOCS, pages 714-723, 1993.

14

Antonin Guttman.
R-trees: A dynamic index structure for spatial searching.
In Beatrice Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984, pages 47-57. ACM Press, 1984.

15

Scott Huddleston and Kurt Mehlhorn.
A new data structure for representing sorted lists.
ACM Computing Surveys, 17(2):157-184, 1982.

16

Arge Lars, Mark de Berg, and Herman Haverkort.
Cache-oblivious r-trees.
In Proceedings of the Twenty-First Annual Symposium on Computational Geometry, pages 170-179, 2005.

17

Timos K. Sellis, Nick Roussopoulos, and Christos Faloutsos.
The r+-tree: A dynamic index for multi-dimensional objects.
In Peter M. Stocker, William Kent, and Peter Hammersley, editors, VLDB'87, Proceedings of 13th International Conference on Very Large Data Bases, September 1-4, 1987, Brighton, England, pages 507-518. Morgan Kaufmann, 1987.

18

Jeffery Scott Vitter.
External memory algorithms and data structures: Dealing with massive data.
ACM Computing Surveys, 33(2):209-271, 2001.