, Volume 16, Issue 3, pp 467–496 | Cite as

PNN query processing on compressed trajectories

  • Shuo Shang
  • Bo Yuan
  • Ke Deng
  • Kexin Xie
  • Kai Zheng
  • Xiaofang Zhou


Trajectory compression is widely used in spatial-temporal databases as it can notably reduce (i) the computation/communication load of clients (GPS-enabled mobile devices) and (ii) the storage cost of servers. Compared with original trajectories, compressed trajectories have clear advantages in data processing, transmitting, storing, etc. In this paper, we investigate a novel problem of searching the Path Nearest Neighbor based on Compressed Trajectories (PNN-CT query). This type of query is conducted on compressed trajectories and the target is to retrieve the PNN with the highest probability (lossy compression leads to the uncertainty), which can bring significant benefits to users in many popular applications such as trip planning. To answer the PNN-CT query effectively and efficiently, a two-phase solution is proposed. First, we use the meta-data and sample points to specify a tight search range. The key of this phase is that the number of data objects/trajectory segments to be processed or decompressed should be kept as small as possible. Our efficiency study reveals that the candidate sets created are tight. Second, we propose a reconstruction algorithm based on probabilistic models to account for the uncertainty when decompressing the trajectory segments in the candidate set. Furthermore, an effective combination strategy is adopted to find the PNN with the highest probability. The complexity analysis shows that our solution has strong advantages over existing methods. The efficiency of the proposed PNN-CT query processing is verified by extensive experiments based on real and synthetic trajectory data in road networks.


Compressed trajectory Path nearest neighbor Road networks Spatial databases 



We wish to thank the anonymous reviewers for several comments and suggestions that have improved the paper. This work was supported by the ARC grant DP110103423 and the National Natural Science Foundation of China (No.60905030).


  1. 1.
    Aggarwal CC, Agrawal D (2003) On nearest neighbor indexing of nonlinear trajectories. In: PODS, pp 252–259Google Scholar
  2. 2.
    Alt H, Efrat A, Rote G, Wenk C (2003) Matching planar maps. In: SODA, pp 589–598Google Scholar
  3. 3.
    Bellman R, Dreyfus S (1962) Applied dynamic programming. Princeton University Press, PrincetonGoogle Scholar
  4. 4.
    Bellman RE (1961) On the approximation of curves by line segments using dynamic programming. CACM 4(6):284Google Scholar
  5. 5.
    Bhattacharya A, Das SK (1999) Lezi-update: an information-theoretic approach to track mobile users in pcs networks. In: MobiCom, pp 1–12Google Scholar
  6. 6.
    Brakatsoulas S, Pfoser D, Salas R, Wenk C (2005) On map-matching vehicle tracking data. In: VLDB, pp 853–864Google Scholar
  7. 7.
    Cao H, Wolfson O, Trajcevski G (2006) Spatio-temporal data reduction with deterministic error bounds. In: VLDB J, vol 15, pp 211–228Google Scholar
  8. 8.
    Chen Z, Shen HT, Zhou X, Yu JX (2009) Monitoring path nearest neighbor in road networks. In: SIGMOD, pp 591–602Google Scholar
  9. 9.
    Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269–271CrossRefGoogle Scholar
  10. 10.
    Douglas D, Peucker T (1973) Algorithms for the reduction of the number of points required to represent a line or its caricature. In: The Canadian cartographer, vol 10, pp 112–122Google Scholar
  11. 11.
    Giannotti F, Nanni M, Pinelli F, Pedreschi D (2007) Trajectory pattern mining. In: SIGKDD, pp 330–339Google Scholar
  12. 12.
    Greenfeld J (2002) Matching gps observations to locations on a digital map. In: 81th annual meeting of the transportation research boardGoogle Scholar
  13. 13.
    Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM TODS 24(2):265–318CrossRefGoogle Scholar
  14. 14.
    Jensen CS, Lin D, Ooi BC (2004) Query and update efficient b+-tree based indexing of moving objects. In: VLDB, pp 768–779Google Scholar
  15. 15.
    Jeung H, Liu Q, Shen HT, Zhou X (2008) A hybrid prediction model for moving objects. In: ICDE, pp 70–79Google Scholar
  16. 16.
    Kleinberg J, Tardos E (2005) Algorithm design. Addison-Wesley, Reading, MAGoogle Scholar
  17. 17.
    Lange R, Farrell T, Drr F, Rothermel K (2009) Remote real-time trajectory simplification. In: PerCom, pp 1–10Google Scholar
  18. 18.
    Liu K, Deng K, Ding Z, Li M, Zhou X (2009) Moir/mt: monitoring large-scale road network traffic in real-time. In: VLDB, pp 1538–1541Google Scholar
  19. 19.
    Meratnia N, By RAd (2004) Spatiotemporal compression techniques for moving point objects. In: EDBT, pp 765–782Google Scholar
  20. 20.
    Muckell J, Hwang J-H, Lawson C, Ravi S (2010) Algorithms for compressing gps trajectory data: an empirical evaluation. In: ACM GISGoogle Scholar
  21. 21.
    Patel JM, Chen Y, Chakka VP (2004) Stripes: an efficient index for predicted trajectories. In: SIGMOD, pp 635–646Google Scholar
  22. 22.
    Pei J, Hua M, Tao Y, Lin X (2008) Query answering techniques on uncertain and probabilistic data: tutorial summary. In: SIGMODGoogle Scholar
  23. 23.
    Rabiner L (1989) A tutorial on hidden markov models and selected applications in speech recognition. In: IEEE Proceedings, vol 77, pp 257–286Google Scholar
  24. 24.
    Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: SIGMOD, pp 71–79Google Scholar
  25. 25.
    Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: SIGMOD, pp 331–342Google Scholar
  26. 26.
    Shekhar S, Yoo JS (2003) Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: ACM GIS, pp 9–16Google Scholar
  27. 27.
    Suciu D, Dalvi N (2005) Foundations of probabilistic answers to queries. In: SIGMOD tutorialGoogle Scholar
  28. 28.
    Tao Y, Faloutsos C, Papadias D, Liu B (2004) Prediction and indexing of moving objects with unknown motion patterns. In: SIGMODGoogle Scholar
  29. 29.
    Tao Y, Kollios G, Considine J, Li F, Papadias D (2004) Spatio-temporal aggregation using sketches. In: ICDE, p 214Google Scholar
  30. 30.
    Tao Y, Papadias D (2003) Spatial queries in dynamic environments. ACM TODS 28(2):101–139CrossRefGoogle Scholar
  31. 31.
    Tao Y, Papadias D, Sun J (2003) The tpr*-tree: an optimized spatiotemporal access method for predictive queries. In: VLDB, pp 790–801Google Scholar
  32. 32.
    Tao Y, Xiao X, Cheng R (2007) Range search on multidimensional uncertain data. ACM TODS 32(3):15–54CrossRefGoogle Scholar
  33. 33.
    Trajcevski G, Tamassia R, Ding H, Scheuermann P, Cruz IF (2009) Continuous probabilistic nearest-neighbor queries for uncertain trajectories. In: EDBT, pp 874–885Google Scholar
  34. 34.
    Trajcevski G, Wolfson O, Hinrichs K, Chamberlain S (2004) Managing uncertainty in moving objects databases. ACM TODS 29(3):463–507CrossRefGoogle Scholar
  35. 35.
    Wenk C, Salas R, Pfoser D (2006) Addressing the need for map-matching speed: localizing globalb curve-matching algorithms. In: SSDBMGoogle Scholar
  36. 36.
    Yoo JS, Shekhar S (2005) In-route nearest neighbor queries. GeoInformatica 9:117–137CrossRefGoogle Scholar
  37. 37.
    Zheng K, Trajcevski G, Zhou X, Scheuermann P (2011) Probabilistic range queries for uncertain trajectories on road networks. In: EDBTGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Shuo Shang
    • 1
  • Bo Yuan
    • 2
  • Ke Deng
    • 1
  • Kexin Xie
    • 1
  • Kai Zheng
    • 1
  • Xiaofang Zhou
    • 1
  1. 1.School of Information Technology & Electrical EngineeringThe University of QueenslandBrisbane St. LuciaAustralia
  2. 2.Division of Informatics, Graduate School at ShenzhenTsinghua UniversityShenzhenPeople’s Republic of China

Personalised recommendations