Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    Editors Anon
    Place of PublicationPhiladelphia, PA, United States
    PublisherSIAM
    Pages685-694
    Number of pages10
    StatePublished - 1998
    EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
    Duration: Jan 25 1998Jan 27 1998

    Other

    OtherProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
    CitySan Francisco, CA, USA
    Period1/25/981/27/98

    Fingerprint

    Efficient Algorithms
    Intersection
    Rectangle
    Range Searching
    Point Location
    Geographic information systems
    Computer aided design
    External Memory
    Spatial Database
    Geographic Information Systems
    Large-scale Problems
    Dynamic Problem
    Data storage equipment
    Decomposable
    Line segment
    Higher Dimensions
    Batch
    Join
    Two Dimensions
    High-dimensional

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., & Vitter, J. S. (1998). Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 685-694). Philadelphia, PA, United States: SIAM.

    Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. / Arge, Lars; Procopiuc, Octavian; Ramaswamy, Sridhar; Suel, Torsten; Vitter, Jeffrey Scott.

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. Philadelphia, PA, United States : SIAM, 1998. p. 685-694.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Arge, L, Procopiuc, O, Ramaswamy, S, Suel, T & Vitter, JS 1998, Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, United States, pp. 685-694, Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/25/98.
    Arge L, Procopiuc O, Ramaswamy S, Suel T, Vitter JS. Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA, United States: SIAM. 1998. p. 685-694
    Arge, Lars ; Procopiuc, Octavian ; Ramaswamy, Sridhar ; Suel, Torsten ; Vitter, Jeffrey Scott. / Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. Philadelphia, PA, United States : SIAM, 1998. pp. 685-694
    @inproceedings{c94e04177aff40a19aa6c48cd5d1610e,
    title = "Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems",
    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.",
    author = "Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Vitter, {Jeffrey Scott}",
    year = "1998",
    language = "English (US)",
    pages = "685--694",
    editor = "Anon",
    booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
    publisher = "SIAM",

    }

    TY - GEN

    T1 - Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

    AU - Arge, Lars

    AU - Procopiuc, Octavian

    AU - Ramaswamy, Sridhar

    AU - Suel, Torsten

    AU - Vitter, Jeffrey Scott

    PY - 1998

    Y1 - 1998

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0032267459&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032267459&partnerID=8YFLogxK

    M3 - Conference contribution

    SP - 685

    EP - 694

    BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

    A2 - Anon, null

    PB - SIAM

    CY - Philadelphia, PA, United States

    ER -