Skip to main content
SpringerLink
Log in

Nearest and reverse nearest neighbor queries for moving objects

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

Abstract

With the continued proliferation of wireless communications and advances in positioning technologies, algorithms for efficiently answering queries about large populations of moving objects are gaining interest. This paper proposes algorithms for k nearest and reverse k nearest neighbor queries on the current and anticipated future positions of points moving continuously in the plane. The former type of query returns k objects nearest to a query object for each time point during a time interval, while the latter returns the objects that have a specified query object as one of their k closest neighbors, again for each time point during a time interval. In addition, algorithms for so-called persistent and continuous variants of these queries are provided. The algorithms are based on the indexing of object positions represented as linear functions of time. The results of empirical performance experiments are reported.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Albers, G., Guibas, L.J., Mitchell J.S.B, Roos, T.: Voronoi diagrams of moving points. Int. J. Comput. Geom. Appl. 8(3), 365–380 (1998)

    Article  MathSciNet  Google Scholar 

  2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 322–331 (1990)

  3. Benetis, R., Jensen, C.S., Karciauskas, G., Šaltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of the International Data Engineering and Applications Symposium, pp. 44–53 (2002)

  4. Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.P., Seidl, T.: Fast nearest neighbor search in high-dimensional space. In: Proceedings of the International Conference on Data Engineering, pp. 209–218 (1998)

  5. Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record 27(3), 16–21 (1998)

    Article  Google Scholar 

  6. Čivilis, A., Jensen, C.S., Pakalnis S.: Techniques for Efficient tracking of road-network-based moving objects. IEEE Trans. Knowledge Data Eng. 17(5), 15 (to appear)

  7. Elliott, J.: Text messages turn towns into giant computer game. Sunday Times, April 29 (2001)

  8. Federal Communications Commission: Enhanced 911. URL: http://www.fcc.gov/911/enhanced/. Current as of June 1, 2003.

  9. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47–57 (1984)

  10. Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proceedings of the VLDB Conference, pp. 562–573 (1995)

  11. Henrich, A.: A distance scan algorithm for spatial access structures. In: Proceedings of the Second ACM Workshop on Geographic Information Systems, pp. 136–143 (1994)

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

    Article  Google Scholar 

  13. Jensen, C.S. (ed): Indexing of Moving Objects. Special issue of the IEEE Data Eng. Bull. 25(2) (2002)

  14. Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 369–380 (1997)

  15. Kollios, G., Gunopulos, D., Tsotras, V.J.: Nearest neighbor queries in a mobile environment. In: Proceedings of the International Workshop on Spatio-Temporal Database Management, pp. 119–134 (1999)

  16. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 201–212 (2000)

  17. Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast nearest neighbor search in medical image databases. In: Proceedings of the VLDB Conference, pp. 215–226 (1996)

  18. Leutenegger, S.T., Lopez, M.A.: The effect of buffering on the performance of R-trees. In: Proceedings of the International Conference on Data Engineering, pp. 164–171 (1998)

  19. Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: Proceedings of the Canadian Conference on Computational Geometry, pp. 128–132 (2002)

  20. Preparata, F.P., Shamos, M.I.: Computational geometry: An introduction (texts and monographs in computer science), 5th edn. Springer, Berlin, Heidelberg, New York (1993)

    Google Scholar 

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

    Google Scholar 

  22. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 71–79 (1995)

  23. Šaltenis, S., Jensen, C.S.: Indexing of moving objects for location-based services. In: Proceedings of the International Conference on Data Engineering, pp. 463–472 (2002)

  24. Šaltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 331–342 (2000)

  25. Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 154–165 (1998)

  26. Singh, A., Ferhatosmanoglu, H., Tosun, A.: High dimensional reverse nearest neighbor queries. In: Proceedings of ACM CIKM International Conference on Information and Knowledge Management, pp. 91–98 (2003)

  27. Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Proceedings of the International Conference on Data Engineering, pp. 422–432 (1997)

  28. Smid, M.: Closest point problems in computational geometry. In: Sack J.R., Urrutia J. (eds.) Handbook on computational geometry. Elsevier Science Publishing, pp. 877–935 (1997)

  29. Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proceedings of the International Symposium on Spatial and Temporal Databases, pp. 79–96 (2001)

  30. Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44–53 (2000)

  31. Tao, Y., Papadias, D.: Spatial queries in dynamic environments. ACM TODS 28(2), 101–139 (2003)

    Article  Google Scholar 

  32. Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: an optimized spatio-temporal access method for predictive queries In: Proceedings of the VLDB Conference, pp. 790–801 (2003)

  33. Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality In: Proceedings of the VLDB Conference, pp. 744–755 (2004)

  34. White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the International Conference on Data Engineering, pp. 516–523 (1996)

  35. Yang, C., Lin, K.-Ip.: An index structure for efficient reverse nearest neighbor queries. In: Proceedings of the International Conference on Data Engineering, pp. 485–492 (2001)

  36. Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: Issues and solutions. In: Proceedings of the International Conference on Scientific and Statistical Database Management, pp. 111–122 (1998)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University, Aalborg Øst, Denmark

    Rimantas Benetis, Christian S. Jensen, Gytis Karĉiauskas & Simonas Ŝaltenis

Authors
  1. Rimantas Benetis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian S. Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gytis Karĉiauskas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Simonas Ŝaltenis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian S. Jensen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benetis, R., Jensen, C.S., Karĉiauskas, G. et al. Nearest and reverse nearest neighbor queries for moving objects. The VLDB Journal 15, 229–249 (2006). https://doi.org/10.1007/s00778-005-0166-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-005-0166-4

Keywords

Search

Navigation