[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2213836.2213842acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Parallel main-memory indexing for moving-object query and update workloads

Published: 20 May 2012 Publication History

Abstract

We are witnessing a proliferation of Internet-worked, geo-positioned mobile devices such as smartphones and personal navigation devices. Likewise, location-related services that target the users of such devices are proliferating. Consequently, server-side infrastructures are needed that are capable of supporting the location-related query and update workloads generated by very large populations of such moving objects.
This paper presents a main-memory indexing technique that aims to support such workloads. The technique, called PGrid, uses a grid structure that is capable of exploiting the parallelism offered by modern processors. Unlike earlier proposals that maintain separate structures for updates and queries, PGrid allows both long-running queries and rapid updates to operate on a single data structure and thus offers up-to-date query results. Because PGrid does not rely on creating snapshots, it avoids the stop-the-world problem that occurs when workload processing is interrupted to perform such snapshotting. Its concurrency control mechanism relies instead on hardware-assisted atomic updates as well as object-level copying, and it treats updates as non-divisible operations rather than as combinations of deletions and insertions; thus, the query semantics guarantee that no objects are missed in query results.
Empirical studies demonstrate that PGrid scales near-linearly with the number of hardware threads on four modern multi-core processors. Since both updates and queries are processed on the same current data-store state, PGrid outperforms snapshot-based techniques in terms of both query freshness and CPU cycle-wise efficiency.

References

[1]
V. Akman, W. R. Franklin, M. Kankanhalli, and C. Narayanaswami. Geometric computing and the uniform grid data technique. Computer Aided Design, 21(7):410--420, 1989.
[2]
T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6:153--180, 2002.
[3]
S. K. Cha, S. Hwang, K. Kim, and K. Kwon. Cache-conscious concurrency control of main-memory indexes on shared-memory multiprocessor systems. In VLDB, pp. 181--190, 2001.
[4]
K. Chakrabarti and S. Mehrotra. Efficient concurrency control in multidimensional access methods. In SIGMOD, pp. 25--36, 1999.
[5]
S. Chen, C. S. Jensen, and D. Lin. A benchmark for evaluating moving object indexes. PVLDB, 1(2):1574--1585, 2008.
[6]
A. Civilis, C. S. Jensen, and S. Pakalnis. Techniques for efficient road-network-based tracking of moving objects. IEEE TKDE, 17(5):698--712, 2005.
[7]
J. Dittrich, L. Blunschi, and M. A. V. Salles. Indexing moving objects using short-lived throwaway indexes. In SSTD, pp. 189--207, 2009.
[8]
J. Gray and A. Reuter. Transaction processing: concepts and techniques. Morgan Kaufmann Publishers, 1993.
[9]
J. N. Gray, R. A. Lorie, and G. R. Putzolu. Granularity of locks and degrees of consistency in a shared data base. In VLDB, pp. 428--451, 1975.
[10]
S. Hwang, K. Kwon, S. Cha, and B. Lee. Performance evaluation of main-memory R-tree variants. In SSTD, pp. 10--27, 2003.
[11]
Intel 64 and IA-32 Architectures Software Developer's Manual. Volume 3A: System Programming Guide, Part 1. Order number: 253668-037US, January 2011.
[12]
C. S. Jensen, D. Lin, and B. C. Ooi. Query and update efficient B+-tree based indexing of moving objects. In VLDB, pp. 768--779, 2004.
[13]
K. Kim, S. K. Cha, and K. Kwon. Optimizing multidimensional index trees for main memory access. In SIGMOD, pp. 139--150, 2001.
[14]
M. Kornacker and D. Banks. High-concurrency locking in r-trees. In VLDB, pp. 134--145, 1995.
[15]
M. Kornacker, C. Mohan, and J. M. Hellerstein. Concurrency and recovery in generalized search trees. In SIGMOD, pp. 62--72, 1997.
[16]
M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In VLDB, pp. 608--619, 2003.
[17]
P. L. Lehman and s. B. Yao. Efficient locking for concurrent operations on B-trees. ACM TODS, 6(4):650--670, 1981.
[18]
D. Molka, D. Hackenberg, R. Schone, and M. S. Muller. Memory performance and cache coherency effects on an Intel Nehalem multiprocessor system. PACT, 0:261--270, 2009.
[19]
V. Ng and T. Kameda. Concurrent access to R-trees. In SSD, pp. 142--161, 1993.
[20]
L.-V. Nguyen-Dinh, W. G. Aref, and M. F. Mokbel. Spatio-temporal access methods: Part 2 (2003-2010). IEEE DEB, 33(2):46--55, 2010.
[21]
J. M. Patel, Y. Chen, and V. P. Chakka. Stripes: an efficient index for predicted trajectories. In SIGMOD, pp. 635--646, 2004.
[22]
POSIX.1-2008. The open group base specifications. Also published as IEEE Std 1003.1--2008, July 2008.
[23]
R. Rastogi, S. Seshadri, P. Bohannon, D. W. Leinbaugh, A. Silberschatz, and S. Sudarshan. Logical and physical versioning in main memory databases. In VLDB, pp. 86--95, 1997.
[24]
B. Salzberg. Grid file concurrency. Information Systems, 11(3):235--244, 1986.
[25]
S. I. Song, Y. H. Kim, and J. S. Yoo. An enhanced concurrency control scheme for multidimensional index structures. IEEE TKDE, 16(1):97--111, 2004.
[26]
M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era: (it's time for a complete rewrite). In VLDB, pp. 1150--1160, 2007.
[27]
Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In VLDB, pp. 790--801, 2003.
[28]
D. Šidlauskas, K. A. Ross, C. S. Jensen, and S. Šaltenis. Thread-level parallel indexing of update intensive moving-object workloads. In SSTD, pp. 186--204, 2011.
[29]
D. Šidlauskas, S. Šaltenis, C. W. Christiansen, J. M. Johansen, and D. Šaulys. Trees or grids? Indexing moving objects in main memory. In GIS, pp. 236--245, 2009.
[30]
M. Yiu, Y. Tao, and N. Mamoulis. The Bdual-tree: indexing moving objects by space filling curves in the dual space. PVLDB, 17(3):379--400, 2008.

Cited By

View all
  • (2024)RayJoin: Fast and Precise Spatial JoinProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656610(124-136)Online publication date: 30-May-2024
  • (2024)Individual Dynamic Real-Time Range Queries in Adaptive Quad Streaming2024 33rd International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN61486.2024.10637619(1-9)Online publication date: 29-Jul-2024
  • (2024)Exploiting hashing for concurrent query processing and indexing of current location of moving objectsConcurrency and Computation: Practice and Experience10.1002/cpe.801336:11Online publication date: 3-Jan-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
May 2012
886 pages
ISBN:9781450312479
DOI:10.1145/2213836
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 ACM 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: 20 May 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. parallelism
  2. spatio-temporal indexing

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '12
Sponsor:

Acceptance Rates

SIGMOD '12 Paper Acceptance Rate 48 of 289 submissions, 17%;
Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)13
  • Downloads (Last 6 weeks)2
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)RayJoin: Fast and Precise Spatial JoinProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656610(124-136)Online publication date: 30-May-2024
  • (2024)Individual Dynamic Real-Time Range Queries in Adaptive Quad Streaming2024 33rd International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN61486.2024.10637619(1-9)Online publication date: 29-Jul-2024
  • (2024)Exploiting hashing for concurrent query processing and indexing of current location of moving objectsConcurrency and Computation: Practice and Experience10.1002/cpe.801336:11Online publication date: 3-Jan-2024
  • (2023)A hash-based index for processing frequent updates and continuous location-based range queriesKnowledge and Information Systems10.1007/s10115-023-01884-965:10(4233-4271)Online publication date: 19-May-2023
  • (2022)WaffleProceedings of the VLDB Endowment10.14778/3551793.355180015:11(2375-2388)Online publication date: 29-Sep-2022
  • (2022)A Survey of Spatio-Temporal Big Data Indexing Methods in Distributed EnvironmentIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing10.1109/JSTARS.2022.317565715(4132-4155)Online publication date: 2022
  • (2022)Query Processing: kNNEncyclopedia of Big Data Technologies10.1007/978-3-319-63962-8_220-2(1-6)Online publication date: 15-Jun-2022
  • (2021)AxomDB: A Distributed and Scalable In-memory Database System2021 19th OITS International Conference on Information Technology (OCIT)10.1109/OCIT53463.2021.00016(20-25)Online publication date: Dec-2021
  • (2021)Concurrency control for real‐time and mobile transactions: Historical view, challenges, and evolution of practicesConcurrency and Computation: Practice and Experience10.1002/cpe.654934:3Online publication date: 5-Aug-2021
  • (2020)A Resilient Large-Scale Trajectory Index for Cloud-Based Moving Object ApplicationsApplied Sciences10.3390/app1020722010:20(7220)Online publication date: 16-Oct-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media