Skip to main content
Log in

Partition-based range query for uncertain trajectories in road networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Query processing for trajectory data is a hot topic in the field of moving objects databases (MODs). Most of the previous research work focused on the Euclidean space, and the uncertain trajectories are represented as sheared cylinders. However, in many applications (e.g. traffic management), the movements of moving objects (MOs) are constrained by the road network environments, which makes the previous methods ineffective. In this paper, we firstly construct an uncertain trajectory model, which is composed of a sequence of segment units with earliest arrival time and latest departure time, based on the assuming availability of a maximum speed on each road segment. Secondly, we present a partition-based uncertain trajectory index (PUTI) to facilitate the search of possible MOs within the space and time range in the road networks based on the uncertain trajectory model. It provides appropriate groups to gather segment units of trajectories according to their network distances. Finally, an efficient algorithm for range query is proposed by leveraging the index. The experiments on two datasets demonstrate that the uncertain trajectory model is effective, and PUTI also significantly outperforms the network distance based MON-tree on range query.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Figure 9
Fig. 10

Similar content being viewed by others

Notes

  1. http://www.oracle.com/technetwork/products/berkeleydb/overview/index.html

References

  1. Brinkhoff T (2002) A framework for generating network-based moving objects. GeoInformatica 6(2):153–180

    Article  Google Scholar 

  2. Chung BS, Lee WC and Chen AL (2009) Processing probabilistic spatio-temporal range queries over moving objects with uncertainty. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology 60–71

  3. De Almeida VT, Güting RH (2005) Indexing the trajectories of moving objects in networks*. GeoInformatica 9(1):33–60

    Article  Google Scholar 

  4. De Almeida VT and Güting RH (2005) Supporting uncertainty in moving objects in network databases. Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems 31–40

  5. Ding Z (2008) UTR-tree: An index structure for the full uncertain trajectories of network-constrained moving objects. MDM’08. 9th International Conference 33–40

  6. Frentzos E (2003) Indexing objects moving on fixed networks. Advances in spatial and temporal databases 289–305

  7. Güting RH, De Almeida VT, Ding Z (2006) Modeling and querying moving objects in networks. VLDB J 15(2):165–190

    Article  Google Scholar 

  8. Güttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD 47–57

  9. Hua M and Pei J (2010) Probabilistic path queries in road networks: traffic uncertainty aware path selection. Proceedings of the 13th International Conference on Extending Database Technology 347–358

  10. Kuijpers B, Miller HJ, Neutens T (2010) Anchor uncertainty and space-time prisms on road networks. Int J Geogr Inf Sci 24(8):1223–1248

    Article  Google Scholar 

  11. Kuijpers B, Othman W (2009) Modeling uncertainty of moving objects on road networks via space-time prisms. Int J Geogr Inf Sci 23(9):1095–1117

    Article  Google Scholar 

  12. Kuijpers B, Othman W (2010) Trajectory databases: data models, uncertainty and complete query languages. J Comput Syst Sci 76(7):538–560

    Article  Google Scholar 

  13. Lange R, Weinschrott H, Geiger L and Blessing A (2009) On a generic uncertainty model for position information. Quality of Context 76–87

  14. Li X, Lin H (2006) Indexing network‐constrained trajectories for connectivity‐based queries. Int J Geogr Inf Sci 20(3):303–328

    Article  Google Scholar 

  15. Liu H and Schneider M (2011) Querying moving objects with uncertainty in spatio-temporal databases. Database Syst Adv Appl 357371

  16. Liu S, Chen L and Chen G (2011) Voronoi-based range query for trajectory data in spatial networks. Proceedings of the 2011 ACM Symposium on Applied Computing 1022–1026

  17. Moulitsas I, Karypis G (2008) Architecture aware partitioning algorithms. Algorithm Architectures Parallel Process 42–53

  18. Papadias D, Zhang J and Mamoulis N (2003) Query processing in spatial network databases. Proceedings of the 29th International Conference on Very Large Data Bases (29), 802–813

  19. Pfoser D, Jensen C (1999) Capturing the uncertainty of moving-object representations. Adv Spat Databases 111–131

  20. Pfoser D, Jensen CS (2005) Trajectory indexing using movement constraints*. GeoInformatica 9(2):93–115

    Article  Google Scholar 

  21. Sandu Popa I, Zeitouni K and Oria V (2010) PARINET: A tunable access method for in-network trajectories. Data Engineering (ICDE), 2010 I.E. 26th International Conference 177–188

  22. Sandu Popa I, Zeitouni K, Oria V (2011) Indexing in-network trajectory flows. Int J Very Large Data Bases 20(5):643–669

    Article  Google Scholar 

  23. Trajcevski G (2003) Probabilistic range queries in moving objects databases with uncertainty. Proceedings of the 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access 39–45

  24. Trajcevski G, Tamassia R, Cruz IF (2011) Ranking continuous nearest neighbors for uncertain trajectories. VLDB J 20(5):767–791

    Article  Google Scholar 

  25. Trajcevski G, Tamassia R and Ding H (2009) Continuous probabilistic nearest-neighbor queries for uncertain trajectories. Proceedings of the 12th International Conference on Extending Database Technology: Adv Database Technol 874–885

  26. Trajcevski G, Wolfson K, Hinrichs K (2004) Managing uncertainty in moving objects databases. ACM Trans on Database Syst (TODS) 29(3):463–507

    Article  Google Scholar 

  27. Xuan K, Zhao K, Taniar D (2011) Voronoi-based range and continuous range query processing in mobile databases. J Comput Syst Sci 77(4):637–651

    Article  Google Scholar 

  28. Zhang M, Chen S, Jensen CS (2009) Effectively indexing uncertain moving objects for predictive queries. Proc VLDB Endowment 2(1):1198–1209

    Article  Google Scholar 

  29. Zheng K, Trajcevski G and Zhou X (2011) Probabilistic range queries for uncertain trajectories on road networks. Proceedings of the 14th International Conference on Extending Database Technology 283–294

  30. Zheng K, Zheng Y and Xie X (2012) Reducing uncertainty of low-sampling-rate trajectories. Data Engineering (ICDE), IEEE 28th International Conference 1144–1155

Download references

Acknowledgments

This work was funded by the Ministry of Industry and Information Technology of China (No.2010ZX01042-002-003-001), Natural Science Foundation of China (Nos. 60703040, 61332017), and Science and Technology Department of Zhejiang Province (Nos. 2007C13019, 2011C13042, 2013C01046).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ling Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, L., Tang, Y., Lv, M. et al. Partition-based range query for uncertain trajectories in road networks. Geoinformatica 19, 61–84 (2015). https://doi.org/10.1007/s10707-014-0206-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-014-0206-6

Keywords

Navigation