Kun-Lun Chen
ABSTRACT
To1 improve updating efficiency and querying accuracy for spatial moving object data, we propose a parallel data structure for indexing moving objects. The structure contains a main index and an auxiliary index, which are used for supporting range based and identity based spatial object query operations, respectively. It also utilizes a query index which hooks updating operations to querying operations that may be influenced. Thus, it avoids locking relevant spatial objects and indexing structures as existing approaches do when range query operations are processed. At the same time, it also supports time slice semantics for parallel operations. Experimental results show that, under high working load, the structure can not only guarantee querying accuracy, the throughput is also obviously higher than that of the existing methods. The index improves the degree of system parallelism, makes it possible for object updating and querying operations in same ranges be processed in parallel, and therefore improves the overall efficiency of the system.
- Li C W, Gu Y, and Qi J, et al. 2014. A safe region based approach to moving KNN queries in obstructed space. Knowledge and Information Systems, published online. Google Scholar
Digital Library
- Samet H, Sankaranarayanan J, and Auerbach M. 2013. Indexing methods for moving object databases: games and other applications. Proceedings of the SIGMOD International Conference on Management of Data, New York: ACM, 2013, 169--180. Google ScholarDigital Library
- Jensen C S, Lin D, and Ooi B C. 2004. Query and update efficient B+-tree based indexing of moving objects. Proceedings of Very Large Data Bases, Toronto: VLDB Endowment, 768--779. Google ScholarDigital Library
- S. Hwang, K. Kwon, S. Cha, and B. Lee. 2003. Performance evaluation of main-memory R-tree variants. In SSTD, 10--27.Google Scholar
- M. Kornacker, C. Mohan, and J. M. Hellerstein. 1997. Concurrency and recovery in generalized search trees. In SIGMOD, 62--72. Google ScholarDigital Library
- S. Chen, C. S. Jensen, and D. Lin. 2008. A benchmark for evaluating moving object indexes. PVLDB, 1(2), 1574--1585. Google ScholarDigital Library
- P. L. Lehman and s. B. Yao. 1981. Efficient locking for concurrent operations on B-trees. ACM TODS, 6(4), 650--670. Google ScholarDigital Library
- Nguyen-Dinh L-V, Aref W G, and Mokbel M. 2010. Spatio-temporal access methods: Part 2 (2003-2010). IEEE Data Engineering Bulletin, 33(2), 46--55.Google Scholar
- Ward P G, He Z, and Zhang R, et al. 2014. Real-time continuous intersection joins over large sets of moving objects using graphic processing units. The Very Large Data Base Journal, 23(6), 965--985. Google ScholarDigital Library
- Gray J, and Reuter A. 1993. Transaction Processing: Concepts and Techniques {M}. San Francisco: Morgan Kaufmann Publishers, 373--445. Google ScholarDigital Library
- Šidlauskas D, Šaltenis S, and Jensen C S. 2014.Processing of extreme moving-object update and query workloads in main memory. The Very Large Data Base Journal, 23(5), 817--841. Google ScholarDigital Library
- Šidlauskas D, Šaltenis S, and Jensen C S. 2012. Parallel main-memory indexing for moving-object query and update workloads. Proceedings of the Management of Data, Scottsdale: ACM, 37--48. Google ScholarDigital Library
- Moon B, Jagadish H V, and Faloutsos C, et al. 2001. Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Transactions on Knowledge and Data Engineering, 13(1), 124--141. Google ScholarDigital Library
- Šidlauskas D, Ross K A, and Jensen C S, et al. 2011.Thread-level parallel indexing of update intensive moving-object workloads. Proceedings of Advances in Spatial and Temporal Databases, Berlin: Springer, 186--204. Google ScholarDigital Library
- Sarma A D, Gollapudi S, and Najork M, et al. 2010. A sketch-based distance oracle for web-scale graphs. Proceedings of ACM international conference on Web search and data mining, New York: ACM, 401--410. Google ScholarDigital Library
Index Terms
- Indexing Moving Objects Using Query Oriented Parallel Grids
Recommendations
Indexing moving objects for directions and velocities queries
Moving object databases are required to support different types of queries with a large number of moving objects. New types of queries namely directions and velocity queries (DV queries), are to be supported and covered. The TPR-tree and its successors ...
Spatial inverse query processing
Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database ...
Parallel spatial query processing on GPUs using R-trees
BigSpatial '13: Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial DataR-Trees are popular spatial indexing techniques that have been widely adopted in many geospatial applications. As commodity GPUs (Graphics Processing Units) are increasingly becoming available on personal workstations and cluster computers, there are ...
Comments