Efficient Point-Based Trajectory Search

  • Shuyao Qi
  • Panagiotis Bouros
  • Dimitris Sacharidis
  • Nikos Mamoulis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9239)

Abstract

Trajectory data capture the traveling history of moving objects such as people or vehicles. With the proliferation of GPS and tracking technology, huge volumes of trajectories are rapidly generated and collected. Under this, applications such as route recommendation and traveling behavior mining call for efficient trajectory retrieval. In this paper, we first focus on distance-based trajectory search; given a collection of trajectories and a set query points, the goal is to retrieve the top-k trajectories that pass as close as possible to all query points. We advance the state-of-the-art by combining existing approaches to a hybrid method and also proposing an alternative, more efficient range-based approach. Second, we propose and study the practical variant of bounded distance-based search, which takes into account the temporal characteristics of the searched trajectories. Through an extensive experimental analysis with real trajectory data, we show that our range-based approach outperforms previous methods by at least one order of magnitude.

References

  1. 1.
    Zheng, Y.: Trajectory data mining: an overview. ACM Trans. Intell. Syst. Technol. 6, 29:1–29:41 (2015)CrossRefGoogle Scholar
  2. 2.
    Zheng, Y., Zhou, X. (eds.): Computing with Spatial Trajectories. Springer, New York (2011)Google Scholar
  3. 3.
    Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: SIGMOD, pp. 255–266 (2010)Google Scholar
  4. 4.
    Tang, L.-A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 223–241. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  5. 5.
    Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS, pp. 102–113 (2001)Google Scholar
  6. 6.
    Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 11:1–11:58 (2008)CrossRefGoogle Scholar
  7. 7.
    Güntzer, U., Balke, W., Kießling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: ITCC, pp. 622–628 (2001)Google Scholar
  8. 8.
    Güntzer, U., Balke, W.T., Kießling, W.: Optimizing multi-feature queries for image databases. In: VLDB, pp. 419–428 (2000)Google Scholar
  9. 9.
    Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529–576 (2005)CrossRefGoogle Scholar
  10. 10.
    Zheng, Y., Zhang, L., Xie, X., Ma, W.Y.: Mining interesting locations and travel sequences from GPS trajectories. In: WWW 2009, pp. 791–800 (2009)Google Scholar
  11. 11.
    Zheng, Y., Li, Q., Chen, Y., Xie, X., Ma, W.: Understanding mobility based on GPS data. In: UbiComp 2008: Proceedings of the 10th International Conference on Ubiquitous Computing, UbiComp 2008, Seoul, Korea, 21–24 September, pp. 312–321 (2008)Google Scholar
  12. 12.
    Zheng, Y., Xie, X., Ma, W.: Geolife: a collaborative social networking service among user, location and trajectory. IEEE Data Eng. Bull. 33(2), 32–39 (2010)Google Scholar
  13. 13.
    Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, 22–25 May, pp. 71–79 (1995)Google Scholar
  14. 14.
    Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265–318 (1999)CrossRefGoogle Scholar
  15. 15.
    Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322–373 (2001)CrossRefGoogle Scholar
  16. 16.
    Jagadish, H.V., Ooi, B.C., Tan, K., Yu, C., Zhang, R.: iDistance: an adaptive b\({}^{\text{+ }}\)-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364–397 (2005)CrossRefGoogle Scholar
  17. 17.
    Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp. 563–576 (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Shuyao Qi
    • 1
  • Panagiotis Bouros
    • 2
  • Dimitris Sacharidis
    • 3
  • Nikos Mamoulis
    • 1
  1. 1.Department of Computer ScienceThe University of Hong KongHong KongChina
  2. 2.Department of Computer ScienceHumboldt-Universität zu BerlinBerlinGermany
  3. 3.Faculty of InformaticsTechnische Universität WienWienAustria

Personalised recommendations