Abstract
Efficient processing of spatiotemporal queries over moving objects with uncertainty has become imperative due to the increasing need for real-time information in highly dynamic environments. Most of the existing approaches focus on designing an index structure for managing moving objects with uncertainty and then utilize it to improve the query performance. All the proposed indexes, however, have their own limitations. In this paper, we devote to developing an efficient index, named the R lsd-tree, to index moving objects with uncertain speed and direction varying within respective known ranges. We design several pruning criteria combined with the R lsd-tree to answer the probabilistic range queries. Moreover, two models, the sampling-based probability model and the ER-based probability model, are proposed to quantify the possibility of each object being the query result. Finally, a thorough experimental evaluation is conducted to show the merits of the proposed techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM management of data conference, Atlantic City, NJ, pp 322–331
Cho HJ, Chung CW (2005) An efficient and scalable approach to CNN queries in a road network. In: Proceedings of the very large database conference, Trondheim, Norway, pp 865–876
Chen J, Cheng R (2007) Efficient evaluation of imprecise location-dependent queries. In: Proceedings of the data engineering conference, Istanbul, Turkey, pp 586–595
Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. IEEE Trans Knowl Data Eng 16(9):1112–1127
Chung BSE, Lee WC, Chen ALP (2009) Processing probabilistic spatio-temporal range queries over moving objects with uncertainty. In: Proceedings of the extending database technology conference, Saint Petersburg, Russia, pp 60–71
Chen S, Ooi BC, Zhang Z (2010) An adaptive updating protocol for reducing moving object database workload. In: Proceedings of the very large database conference, Singapore, pp 735–746
Fan P, Li G, Yuan L, Li Y (2012) Vague continuous K-nearest neighbor queries over moving objects with uncertain velocity in road networks. Inf Syst 37(1):13–32
Huang YK, Liao SJ, Lee C (2009) Evaluating continuous K-nearest neighbor query on moving objects with uncertainty. Inf Syst 34(4–5):415–437
Jensen CS, Kolářvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: Proceedings of the advances in geographic information systems conference, New Orleans, Louisiana, pp 1–8
Kolahdouzan M, Shahabi C (2004a) Voronoi-based K nearest neighbor search for spatial network databases. In: Proceedings of the very large database conference, Toronto, Canada, pp 840–851
Kolahdouzan M, Shahabi C (2004b) Continuous K-nearest neighbor queries in spatial network databases. In: Proceedings of the spatio-temporal database management workshop, Toronto, Canada, pp 33–40
Moon B, Jagadish HV, Faloutsos C, Saltz JH (2001) Analysis of the clustering properties of the hilbert space-filling curve. IEEE Trans Knowl Data Eng 13(1):124–141
Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the very large database conference, Berlin, Germany, pp 802–813
Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: Proceedings of the ACM management of data conference, Dallas, Texas, pp 331–342
Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the spatial and temporal databases conference, Redondo Beach, CA, USA, pp 79–96
Sistla AP, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: Proceedings of the data engineering conference, Birmingham, UK, pp 422–432
Tao Y, Cheng R, Xiao X, Ngai WK, Kao B, Prabhakar S (2005) Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of the very large database conference, Trondheim, Norway, pp 922–933
Tao Y, Faloutsos C, Papadias D, Liu B (2004) Prediction and indexing of moving objects with unknown motion patterns. In: Proceedings of the ACM management of data conference, Paris, France, pp 611–622
Tao Y, Xiao X, Cheng R (2007) Range search on multidimensional uncertain data. ACM Trans Database Syst 32(3):1–54
Wolfson O, Yin H (2003) Accuracy and resource consumption in tracking and location prediction. In: Proceedings of the spatial and temporal databases conference, Santorini Island, Greece, pp 325–343
Xiong X, Mokbel MF, Aref WG (2005) SEA-CNN: scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. In: Proceedings of the data engineering conference, Tokyo, Japan, pp 643–654
Yu X, Pu KQ, Koudas N (2005) Monitoring K-nearest neighbor queries over moving objects. In: Proceedings of the data engineering conference, Tokyo, Japan, pp 631–642
Zhang M, Chen S, Jensen CS, Ooi BC, Zhang Z (2009) Effectively indexing uncertain moving objects for predictive queries. In: Proceedings of the very large database conference, Lyon, France, pp 1198–1209
Acknowledgments
This work was supported by National Science Council of Taiwan (ROC) under Grant nos. NSC101-2119-M-244-001 and NSC102-2119-M-244-001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, YK. Indexing and querying moving objects with uncertain speed and direction in spatiotemporal databases. J Geogr Syst 16, 139–160 (2014). https://doi.org/10.1007/s10109-013-0191-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10109-013-0191-6