Abstract
Indexing moving objects has been extensively studied in the past decades. Moving objects, such as vehicles and mobile device users, usually exhibit some patterns on their velocities, which can be utilized for velocity-based partitioning to improve performance of the indexes. Existing velocity-based partitioning techniques rely on some kinds of heuristics rather than analytically calculate the optimal solution. In this paper, we propose a novel speed partitioning technique based on a formal analysis over speed values of the moving objects. We first formulate the optimal speed partitioning problem based on search space expansion analysis and then compute the optimal solution using dynamic programming. We then build the partitioned indexing system where queries are duplicated and processed in each index partition. Extensive experiments demonstrate that our method dramatically improves the performance of indexes for moving objects and outperforms other state-of-the-art velocity-based partitioning approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)
Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153–180 (2002)
Chen, S., Jensen, C.S., Lin, D.: A benchmark for evaluating moving object indexes. PVLDB 1(2), 1574–1585 (2008)
Chen, S., Ooi, B.C., Tan, K.-L., Nascimento, M.A.: St\(^{\text{2 }}\)b-tree: a self-tunable spatio-temporal b\(^{\text{+ }}\)-tree index for moving objects. In: SIGMOD, pages 29–42, 2008
Dittrich, J., Blunschi, L., Vaz Salles, M.A.: Indexing moving objects using short-lived throwaway indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 189–207. Springer, Heidelberg (2009)
Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Inf. 4, 1–9 (1974)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient b\(^{\text{+ }}\)-tree based indexing of moving objects. In: VLDB, pp. 768–779 (2004)
Jensen, C.S., Lu, H., Yang, B.: Indexing the trajectories of moving objects in symbolic indoor space. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 208–227. Springer, Heidelberg (2009)
Jensen, C.S., Pakalnis, S.: Trax - real-world tracking of moving objects. In: VLDB, pp. 1362–1365 (2007)
Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation of access structures for discretely moving points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 171–188. Springer, Heidelberg (1999)
Nguyen, T., He, Z., Zhang, R., Ward, P.: Boosting moving object indexing through velocity partitioning. PVLDB 5(9), 860–871 (2012)
Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: an efficient index for predicted trajectories. In: SIGMOD, pp. 637–646 (2004)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: SIGMOD, pp. 331–342 (2000)
Schiller, J., Voisard, A.: Location-Based Services. Elsevier, Amsterdam (2004)
Sidlauskas, D., Saltenis, S., Christiansen, C.W., Johansen, J.M., Saulys, D.: Trees or grids?: indexing moving objects in main memory. In: SIGSPATIAL, pp. 236–245 (2009)
Sidlauskas, D., Saltenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: SIGMOD, pp. 37–48 (2012)
Sidlauskas, D., Saltenis, S., Jensen, C.S.: Processing of extreme moving-object update and query workloads in main memory. VLDB J. 23(5), 817–841 (2014)
Silva, Y.N., Xiong, X., Aref, W.G.: The rum-tree: supporting frequent updates in r-trees using memos. VLDB J. 18(3), 719–738 (2009)
Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: ICDE, pp. 422–432 (1997)
Tao, Y., Papadias, D., Sun, J.: The tpr*-tree: an optimized spatio-temporal access method for predictive queries. In: VLDB, pp. 790–801 (2003)
Yiu, M.L., Tao, Y., Mamoulis, N.: The b\(^{ \text{ dual }}\)-tree: indexing moving objects by space filling curves in the dual space. VLDB J. 17(3), 379–400 (2008)
Zhang, M., Chen, S., Jensen, C.S., Ooi, B.C., Zhang, Z.: Effectively indexing uncertain moving objects for predictive queries. PVLDB 2(1), 1198–1209 (2009)
Zhu, Y., Wang, S., Zhou, X., Zhang, Y.: RUM+-tree: a new multidimensional index supporting frequent updates. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 235–240. Springer, Heidelberg (2013)
Acknowledgments
This research is supported by the AFOSR DDDAS program (Grant No. FA9550-12-1-0240) and National Natural Science Foundation of China (Grant No. 11271351).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Xu, X., Xiong, L., Sunderam, V., Liu, J., Luo, J. (2015). Speed Partitioning for Indexing Moving Objects. In: Claramunt, C., et al. Advances in Spatial and Temporal Databases. SSTD 2015. Lecture Notes in Computer Science(), vol 9239. Springer, Cham. https://doi.org/10.1007/978-3-319-22363-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-22363-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22362-9
Online ISBN: 978-3-319-22363-6
eBook Packages: Computer ScienceComputer Science (R0)