skip to main content
10.1145/3347146.3359077acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Efficient Bundled Spatial Range Queries

Published: 05 November 2019 Publication History

Abstract

Efficiently querying multiple spatial data sets is a growing challenge for scientists. Astronomers query data sets that contain different types of stars (e.g., dwarfs, giants, stragglers) while neuroscientists query different data sets that model different aspects of the brain in the same space (e.g., neurons, synapses, blood vessels). The results of each query determine the combination of data sets to be queried next. Not knowing a priori the queried data sets makes it hard to choose an efficient indexing strategy.
In this paper, we show that indexing and querying the data sets separately incurs considerable overhead but so does using one index for all data sets. We therefore develop STITCH, a novel index structure for the scalable execution of spatial range queries on multiple data sets. Instead of indexing all data sets separately or indexing all of them together, the key insight we use in STITCH is to partition all data sets individually and to connect them to the same reference space. By doing so, STITCH only needs to query the reference space and follow the links to the data set partitions to retrieve the relevant data. With experiments we show that STITCH scales with the number of data sets and outperforms the state-of-the-art by a factor of up to 12.3.

References

[1]
V. Akcelik, J. Bielak, et al. 2003. High resolution forward and inverse earthquake modeling on terascale computers. In Supercomputing. 52--52.
[2]
V. Akman, W. R. Franklin, M. Kankanhalli, and C. Narayanaswami. 1989. Geometric computing and uniform grid technique. CAD 21, 7 (1989), 410--420.
[3]
L. Arge, M. de Berg, H. J. Haverkort, and K. Yi. 2004. The Priority R-tree: A Practically Efficient and Worst-case Optimal R-tree. In Proc. SIGMOD. 347--358.
[4]
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. SIGMOD. 322--331.
[5]
N. Beckmann and B. Seeger. 2009. A Revised R*-tree in Comparison with Related Index Structures. In Proc. SIGMOD. 799--812.
[6]
J. L. Bentley. 1975. Multidimensional binary search trees used for associative searching. CACM 18, 9 (1975), 509--517.
[7]
S. Brakatsoulas, D. Pfoser, and Y. Theodoridis. 2002. Revisiting R-tree Construction Principles. Technical Report. Revision.
[8]
Yván J. García R., Mario Lopez, and Scott T. Leutenegger. 1998. A greedy algorithm for bulk loading R-trees. In Proc. GIS. 163--164.
[9]
A. Guttman. 1984. R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14, 2 (1984), 47--57.
[10]
C. L. Jackins and S. L. Tanimoto. 1980. Oct-trees and their use in representing three-dimensional objects. Computer Graphics and Image Processing 14, 3 (1980), 249--270.
[11]
I. Kamel and C. Faloutsos. 1994. Hilbert R-tree: An improved R-tree using fractals. In Proc. VLDB. 500--509.
[12]
YC. Kwon, D. Nunley, J. P. Gardner, M. Balazinska, B. Howe, and S. Loebman. 2010. Scalable clustering algorithm for N-body simulations in a shared-nothing cluster. In Proc. SSDBM. 132--150.
[13]
Scott T. Leutenegger, Mario Lopez, and J. Edgington. 1997. STR: A simple and efficient algorithm for R-tree packing. In Proc. ICDE. 497--506.
[14]
Zhisheng Li, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee, Dik Lee, and Xufa Wang. 2011. IR-Tree: An Efficient Index for Geographic Document Search. IEEE TKDE 23, 4 (2011), 585--599.
[15]
Henry Markram et al. 2011. Introducing the Human Brain Project. Procedia Computer Science 7 (2011), 39--42.
[16]
T. Sellis, N. Roussopoulos, and C. Faloutsos. 1987. The R+-tree: A dynamic index for multi-dimensional objects. In Proc. VLDB. 507--518.
[17]
D. Šidlauskas, S. Chester, E. Tzirita Zacharatou, and A. Ailamaki. 2018. Improving Spatial Data Processing by Clipping Minimum Bounding Boxes. In Proc. ICDE. 425--436.
[18]
E. Stefanakis, Y. Theodoridis, T. Sellis, and Y.-C. Lee. 1997. Point Representation of Spatial Objects and Query Window Extension: A new Technique for Spatial Access Methods. IJGIS 11, 6 (1997), 529--554.
[19]
F. Tauheed, L. Biveinis, T. Heinis, F. Schürmann, H. Markram, and A. Ailamaki. 2012. Accelerating Range Queries For Brain Simulations. In Proc. ICDE. 941--952.
[20]
T. Ulrich. 2000. Loose Octrees. In Game Programming Gems, Mark DeLoura (Ed.). Charles River Media, 444--453.

Cited By

View all
  • (2024)Analysis of Geospatial Data LoadingProceedings of the Tenth International Workshop on Testing Database Systems10.1145/3662165.3662761(36-42)Online publication date: 9-Jun-2024
  • (2024)Location Data Quadtree Partitioning Algorithm Based on Differential PrivacyData Science10.1007/978-981-97-8746-3_22(318-327)Online publication date: 31-Oct-2024
  • (2024)Selectivity Estimation for Spatial Filters Using Optimizer Feedback: A Machine Learning PerspectiveWeb Information Systems Engineering – WISE 202410.1007/978-981-96-0573-6_8(101-115)Online publication date: 27-Nov-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGSPATIAL '19: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 2019
648 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 November 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Multiple Spatial Data Sets
  2. Spatial Data Management
  3. Spatial Data Partitioning
  4. Spatial Indexing
  5. Spatial Range Query

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

SIGSPATIAL '19
Sponsor:

Acceptance Rates

SIGSPATIAL '19 Paper Acceptance Rate 34 of 161 submissions, 21%;
Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)11
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Analysis of Geospatial Data LoadingProceedings of the Tenth International Workshop on Testing Database Systems10.1145/3662165.3662761(36-42)Online publication date: 9-Jun-2024
  • (2024)Location Data Quadtree Partitioning Algorithm Based on Differential PrivacyData Science10.1007/978-981-97-8746-3_22(318-327)Online publication date: 31-Oct-2024
  • (2024)Selectivity Estimation for Spatial Filters Using Optimizer Feedback: A Machine Learning PerspectiveWeb Information Systems Engineering – WISE 202410.1007/978-981-96-0573-6_8(101-115)Online publication date: 27-Nov-2024
  • (2023)Defining and designing spatial queries: the role of spatial relationshipsGeo-spatial Information Science10.1080/10095020.2022.216392427:6(1868-1892)Online publication date: 17-May-2023
  • (2022)Fast dataset search with earth mover's distanceProceedings of the VLDB Endowment10.14778/3551793.355181115:11(2517-2529)Online publication date: 29-Sep-2022
  • (2022)Proteus: A Self-Designing Range FilterProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526167(1670-1684)Online publication date: 10-Jun-2022
  • (2022)Exploiting Pareto distribution for user modeling in location-based information retrievalExpert Systems with Applications: An International Journal10.1016/j.eswa.2021.116275192:COnline publication date: 6-May-2022
  • (2021)A Unified Approach to Spatial Proximity Query Processing in Dynamic Spatial NetworksSensors10.3390/s2116525821:16(5258)Online publication date: 4-Aug-2021
  • (2020)Explora: Interactive Querying of Multidimensional Data in the Context of Smart CitiesSensors10.3390/s2009273720:9(2737)Online publication date: 11-May-2020
  • (2020)How Good Are Modern Spatial Libraries?Data Science and Engineering10.1007/s41019-020-00147-96:2(192-208)Online publication date: 7-Nov-2020

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media