Loading...
Theory and Practice of I/O efficient Algorithms for Multidimensional Batched Searching Problems
Arge, Lars Procopiuc, Octavian Ramaswamy, Sridhar Suel, Torsten Vitter, Jeffrey Scott
Arge, Lars
Procopiuc, Octavian
Ramaswamy, Sridhar
Suel, Torsten
Vitter, Jeffrey Scott
Citations
Altmetric:
Abstract
We describe a powerful framework for designing efficient batch algorithms for certain large-scale dynamic problems that must be solved using external memory. The class of problems we consider, which we call colorable external decomposable problems, include rectangle intersection, orthogonal line segment intersection, range searching, and point location. We are particularly interested in these problems in two and higher dimensions. They have numerous applications in geographic information systems (GIS), spatial databases, and VLSI and CAD design. We present simplified algorithms for problems previously solved by more complicated approaches (such as rectangle intersection), and
we present efficient algorithms for problems not previously solved in an efficient way (such as point location and higher dimensional versions of range searching and rectangle intersection).
We give experimental results concerning the running time for our approach applied to the red-blue rectangle intersection problem, which is a key component of the extremely important database operation spatial join. Our algorithm
scales well with the problem size, and for large problems sizes it greatly outperforms the well-known sweepline approach.
Description
Extended Abstract
Date
1998
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics
Files
Loading...
vitter_1998.pdf
Adobe PDF, 1.2 MB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. “Theory and Practice of I/Oefficient Algorithms for Multidimensional Batched Searching Problems,” Proceedings of the 9th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA ’98), San Francisco, CA, January 1998, 685–694