Skip to main content
SpringerLink
Log in

Efficient k-nearest neighbor search on moving object trajectories

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

With the growing number of mobile applications, data analysis on large sets of historical moving objects trajectories becomes increasingly important. Nearest neighbor search is a fundamental problem in spatial and spatio-temporal databases. In this paper, we consider the following problem: Given a set of moving object trajectories D and a query trajectory mq, find the k nearest neighbors to mq within D for any instant of time within the lifetime of mq. We assume D is indexed in a 3D-R-tree and employ a filter-and-refine strategy. The filter step traverses the index and creates a stream of so-called units (linear pieces of a trajectory) as a superset of the units required to build the result of the query. The refinement step processes an ordered stream of units and determines the pieces of units forming the precise result. To support the filter step, for each node p of the index, in preprocessing a time-dependent coverage function C p (t) is computed which is the number of trajectories represented in p present at time t. Within the filter step, sophisticated data structures are used to keep track of the aggregated coverages of the nodes seen so far in the index traversal to enable pruning. Moreover, the R-tree index is built in a special way to obtain coverage functions that are effective for pruning. As a result, one obtains a highly efficient kNN algorithm for moving data and query points that outperforms the two competing algorithms by a wide margin. Implementations of the new algorithms and of the competing techniques are made available as well. Algorithms can be used in a system context including, for example, visualization and animation of results. Experiments of the paper can be easily checked or repeated, and new experiments be performed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. BerlinMOD. http://dna.fernuni-hagen.de/secondo/BerlinMOD.html

  2. Nearest Neighbor Algebra Plugin. http://dna.fernuni-hagen.de/Secondo.html/files/plugins/NN.zip

  3. R-tree Portal. http://www.rtreeportal.org

  4. Scripts to execute the experiments of this paper. http://dna.fernuni-hagen.de/papers/KNN/knn-experiment-script.zip

  5. Secondo. A Database System for Moving Objects. http://dna.fernuni-hagen.de/Secondo.html/Secondo-mod.pdf

  6. Secondo Plugins. http://dna.fernuni-hagen.de/Secondo.html/start_content_plugins.html

  7. Secondo User Manual. http://dna.fernuni-hagen.de/Secondo.html/files/SecondoManual.pdf

  8. Secondo Web Site. http://dna.fernuni-hagen.de/Secondo.html/

  9. Benetis R., Jensen C.S., Karciauskas G., Saltenis S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229–249 (2006)

    Article  Google Scholar 

  10. Bentley J.L., Ottmann T.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 28(9), 643–647 (1979)

    Article  MATH  Google Scholar 

  11. Berchtold, S., Böhm, C., Kriegel, H.P.: Improving the query performance of high-dimensional index structures by bulk load operations. In: EDBT, pp. 216–230 (1998)

  12. Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: VLDB, pp. 406–415 (1997)

  13. Cao H., Wolfson O., Trajcevski G.: Spatio-temporal data reduction with deterministic error bounds. VLDB J. 15(3), 211–228 (2006)

    Article  Google Scholar 

  14. Chakka, V.P., Everspaugh, A., Patel. J.M.: Indexing large trajectory data sets with SETI. In: CIDR (2003)

  15. de Berg M., Cheong O., van Kreveld M., Overmars M.: Computational Geometry: Algorithms and Applications. 3rd edn. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  16. Düntgen C., Behr T., Güting R.H.: BerlinMOD: a benchmark for moving object databases. VLDB J. 18(6), 1335–1368 (2009)

    Article  Google Scholar 

  17. Forlizzi, L., Güting, R.H., Nardelli, E., Schneider, M.: A data model and data structures for moving objects databases. In: SIGMOD, pp. 319–330 (2000)

  18. Frentzos, E.: Personal communication

  19. Frentzos E., Gratsias K., Pelekis N., Theodoridis Y.: Algorithms for nearest neighbor search on moving object trajectories. GeoInformatica 11(2), 159–193 (2007)

    Article  Google Scholar 

  20. Frentzos, E., Gratsias, K., Theodoridis, Y.: Index-based most similar trajectory search. In: ICDE, pp. 816–825. IEEE (2007)

  21. Gao, Y., Li, C., Chen, G., Li, Q., Chen, C.: Efficient algorithms for historical continuous k NN query processing over moving object trajectories. In: APWeb/WAIM, pp. 188–199 (2007)

  22. Gao Y.J., Li C., Chen G.C., Chen L., Jiang X.T., Chen C.: Efficient k-nearest neighbor search algorithms for historical moving object trajectories. J. Comput. Sci. Technol. 22(2), 232–244 (2007)

    Article  MathSciNet  Google Scholar 

  23. Giannotti, F., Pedreschi, D. (eds): Mobility, Data Mining and Privacy—Geographic Knowledge Discovery. Springer, Heidelberg (2008)

    Google Scholar 

  24. Gudmundsson, J., van Kreveld, M.J.: Computing longest duration flocks in trajectory data. In: de By R.A., Nittel, S. (eds.) GIS, pp. 35–42. ACM (2006)

  25. Güting R.H., Böhlen M.H., Erwig M., Jensen C.S., Lorentzos N.A., Schneider M., Vazirgiannis M.: A foundation for representing and querying moving objects. ACM TODS 25(1), 1–42 (2000)

    Article  Google Scholar 

  26. Güting R.H., Schneider M.: Moving Objects Databases. Elsevier, Amsterdam (2005)

    Google Scholar 

  27. Hjaltason G.R., Samet H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265–318 (1999)

    Article  Google Scholar 

  28. Huang Y.-K., Chen C.-C., Lee C.: Continous k-nearest neighbor query for moving objects with uncertain velocity. Geoinformatica 13(1), 1–25 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  29. Iwerks, G.S., Samet, H., Smith, K.P.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: VLDB, pp. 512–523 (2003)

  30. Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J., (eds): Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12–15, 2001, Proceedings, volume 2121 (2001)

  31. Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S., Shen, H.T.: Discovery of convoys in trajectory databases. In: VLDB (2008)

  32. Jürgens, M., Lenz, H.-J.: The ra*-tree: an improved r-tree with materialized data for supporting range queries on olap-data. In: DEXA Workshop, pp. 186–191 (1998)

  33. Kellaris, G., Pelekis, N., Theodoridis, Y.: Trajectory compression under network constraints. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD, pp. 392–398 (2009)

  34. Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: SIGMOD Conference, pp. 401–412 (2001)

  35. Mokbel M.F., Ghanem T.M., Aref W.G.: Spatio-temporal access methods. IEEE Data Eng. Bull. 26(2), 40–49 (2003)

    Google Scholar 

  36. Morton, G.M.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. Technical report, IBM Ltd. Ottawa (1966)

  37. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD, pp. 634–645 (2005)

  38. Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient olap operations in spatial data warehouses. In: Jensen et al. [30], pp. 443–459

  39. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving object trajectories. In: VLDB, pp. 395–406 (2000)

  40. Raptopoulou K., Papadopoulos A., Manolopoulos Y.: Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2), 113–137 (2003)

    Article  Google Scholar 

  41. Rasetic, S., Sander, J., Elding, J., Nascimento, M.A.: A trajectory splitting model for efficient spatio-temporal indexing. In: VLDB (2005)

  42. Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD (1995)

  43. Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Gray, W.A., Larson, P.-Å. (eds.) Proceedings of the Thirteenth International Conference on Data Engineering, April 7–11, 1997 Birmingham UK, pp. 422–432. IEEE Computer Society (1997). ISBN 0-8186-7807-0. DBLP, http://dblp.uni-trier.de

  44. Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen et al. [30], pp. 79–96

  45. Tao, Y., Papadias, D.: Time-parameterized queries in spatio- temporal databases. In: SIGMOD, pp. 334–345 (2002)

  46. Tao Y., Papadias D.: Historical spatio-temporal aggregation. ACM Trans. Inf. Syst. 23(1), 61–102 (2005)

    Article  Google Scholar 

  47. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287–298 (2002)

  48. Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: Issues and solutions. In: SSDBM, pp. 111–122 (1998)

  49. Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp. 643–654 (2005)

  50. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Hagen, 58084, Hagen, Germany

    Ralf Hartmut Güting, Thomas Behr & Jianqiu Xu

Authors
  1. Ralf Hartmut Güting
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Behr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianqiu Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ralf Hartmut Güting.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Güting, R.H., Behr, T. & Xu, J. Efficient k-nearest neighbor search on moving object trajectories. The VLDB Journal 19, 687–714 (2010). https://doi.org/10.1007/s00778-010-0185-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-010-0185-7

Keywords

Search

Navigation