Theory and Practice of I/O efficient Algorithms for Multidimensional Batched Searching Problems
View/ Open
Issue Date
1998Author
Arge, Lars
Procopiuc, Octavian
Ramaswamy, Sridhar
Suel, Torsten
Vitter, Jeffrey Scott
Publisher
Society for Industrial and Applied Mathematics
Type
Article
Article Version
Scholarly/refereed, publisher version
Published Version
http://portal.acm.org/citation.cfm?id=315048Metadata
Show full item recordAbstract
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
Collections
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
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.