A unified approach for indexed and non-indexed spatial joins

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

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

    Abstract

    Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process, or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, extends naturally to multi-way joins, and can be built easily from a few standard operations. We present the results of a comparative study of the new algorithm with several index-based and non-index based spatial join algorithms. We consider a number of factors, including the relative performance of CPU and disk, the quality of the spatial indexes, and the sizes of the input relations. An important conclusion from our work is that using an index-based approach whenever indexes are available does not always lead to the best execution time, and hence we propose the use of a simple cost model to decide when to follow an index-based approach.

    Original languageEnglish (US)
    Title of host publicationAdvances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings
    PublisherSpringer Verlag
    Pages413-429
    Number of pages17
    Volume1777
    ISBN (Print)3540672273, 9783540672272
    StatePublished - 2000
    Event7th International Conference on Extending Database Technology, EDBT 2000 - Konstanz, Germany
    Duration: Mar 27 2000Mar 31 2000

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1777
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other7th International Conference on Extending Database Technology, EDBT 2000
    CountryGermany
    CityKonstanz
    Period3/27/003/31/00

    Fingerprint

    Join
    Spatial Index
    Sweeping
    Sorting
    Cost Model
    Program processors
    Execution Time
    Comparative Study
    Partitioning
    Costs

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vahrenhold, J., & Scott, J. V. (2000). A unified approach for indexed and non-indexed spatial joins. In Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings (Vol. 1777, pp. 413-429). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1777). Springer Verlag.

    A unified approach for indexed and non-indexed spatial joins. / Arge, Lars; Procopiuc, Octavian; Ramaswamy, Sridhar; Suel, Torsten; Vahrenhold, Jan; Scott, Jeffrey Vitter.

    Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings. Vol. 1777 Springer Verlag, 2000. p. 413-429 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1777).

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

    Arge, L, Procopiuc, O, Ramaswamy, S, Suel, T, Vahrenhold, J & Scott, JV 2000, A unified approach for indexed and non-indexed spatial joins. in Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings. vol. 1777, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1777, Springer Verlag, pp. 413-429, 7th International Conference on Extending Database Technology, EDBT 2000, Konstanz, Germany, 3/27/00.
    Arge L, Procopiuc O, Ramaswamy S, Suel T, Vahrenhold J, Scott JV. A unified approach for indexed and non-indexed spatial joins. In Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings. Vol. 1777. Springer Verlag. 2000. p. 413-429. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Arge, Lars ; Procopiuc, Octavian ; Ramaswamy, Sridhar ; Suel, Torsten ; Vahrenhold, Jan ; Scott, Jeffrey Vitter. / A unified approach for indexed and non-indexed spatial joins. Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings. Vol. 1777 Springer Verlag, 2000. pp. 413-429 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{e4987fe11e3c4f398c5c1d2d8a4fccc2,
    title = "A unified approach for indexed and non-indexed spatial joins",
    abstract = "Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process, or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, extends naturally to multi-way joins, and can be built easily from a few standard operations. We present the results of a comparative study of the new algorithm with several index-based and non-index based spatial join algorithms. We consider a number of factors, including the relative performance of CPU and disk, the quality of the spatial indexes, and the sizes of the input relations. An important conclusion from our work is that using an index-based approach whenever indexes are available does not always lead to the best execution time, and hence we propose the use of a simple cost model to decide when to follow an index-based approach.",
    author = "Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jan Vahrenhold and Scott, {Jeffrey Vitter}",
    year = "2000",
    language = "English (US)",
    isbn = "3540672273",
    volume = "1777",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "413--429",
    booktitle = "Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings",

    }

    TY - GEN

    T1 - A unified approach for indexed and non-indexed spatial joins

    AU - Arge, Lars

    AU - Procopiuc, Octavian

    AU - Ramaswamy, Sridhar

    AU - Suel, Torsten

    AU - Vahrenhold, Jan

    AU - Scott, Jeffrey Vitter

    PY - 2000

    Y1 - 2000

    N2 - Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process, or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, extends naturally to multi-way joins, and can be built easily from a few standard operations. We present the results of a comparative study of the new algorithm with several index-based and non-index based spatial join algorithms. We consider a number of factors, including the relative performance of CPU and disk, the quality of the spatial indexes, and the sizes of the input relations. An important conclusion from our work is that using an index-based approach whenever indexes are available does not always lead to the best execution time, and hence we propose the use of a simple cost model to decide when to follow an index-based approach.

    AB - Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process, or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, extends naturally to multi-way joins, and can be built easily from a few standard operations. We present the results of a comparative study of the new algorithm with several index-based and non-index based spatial join algorithms. We consider a number of factors, including the relative performance of CPU and disk, the quality of the spatial indexes, and the sizes of the input relations. An important conclusion from our work is that using an index-based approach whenever indexes are available does not always lead to the best execution time, and hence we propose the use of a simple cost model to decide when to follow an index-based approach.

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

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

    M3 - Conference contribution

    AN - SCOPUS:84937438024

    SN - 3540672273

    SN - 9783540672272

    VL - 1777

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 413

    EP - 429

    BT - Advances in Database Technology - EDBT 2000 - 7th International Conference on Extending Database Technology, Proceedings

    PB - Springer Verlag

    ER -