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

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2012, Pages 37-48

  Šidlauskas, Darius ^a   Šaltenis, Simonas ^a   Jensen, Christian S ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

parallelism; spatio temporal indexing

Indexed keywords

EMPIRICAL STUDIES; GRID STRUCTURES; HARDWARE THREADS; HARDWARE-ASSISTED; INDEXING TECHNIQUES; LARGE POPULATION; MAIN-MEMORY; MODERN PROCESSORS; MOVING OBJECTS; MULTI-CORE PROCESSOR; PARALLELISM; PERSONAL NAVIGATION; QUERY RESULTS; QUERY SEMANTICS; SPATIO-TEMPORAL; UPDATE WORKLOAD;

CONCURRENCY CONTROL; DATA STRUCTURES; HARDWARE; MOBILE DEVICES; SEMANTICS;

PARALLEL PROCESSING SYSTEMS;

EID: 84862646917     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213842     Document Type: Conference Paper

References (30)

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