Skip to main content
SpringerLink
Log in

Fast Nearest-Neighbor Query Processing in Moving-Object Databases

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change positions continuously, and therefore we can not rely on a given fixed reference position to determine the answer. Existing techniques are either based on sampling, or on repetitive application of time-parameterized queries in order to provide the answer. In this paper we develop an efficient method in order to process nearest-neighbor queries in moving-object databases. The basic advantage of the proposed approach is that only one query is issued per time interval. The time-parameterized R-tree structure is used to index the moving objects. An extensive performance evaluation, based on CPU and I/O time, shows that significant improvements are achieved compared to existing techniques.

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. P.K. Agarwal, L. Arge, and J. Erickson. “Indexing moving points,” Proceedings 19th ACM PODS Symposium, 175–186, 2000.

  2. N. Beckmann, H.P. Kriegel, and B. Seeger. “The R*-tree: an efficient and robust method for points and rectangles,” Proceedings ACM SIGMOD Conference, 322–331, 1990.

  3. R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis. “Nearest neighbor and reverse nearest neighbor queries for moving objects,” Proceedings IDEAS Conference, 44–53, 2002.

  4. A. Guttman. “R-trees: A dynamic index structure for spatial searching,” Proceedings ACM SIGMOD Conference, 47–57, 1984.

  5. M. Hadjieleftheriou, G. Kollios, V.J. Tsotras, and D. Gunopoulos. “Efficient indexing of spatio-temporal objects,” Proceedings 8th EDBT Conference, 251–268, 2002.

  6. G. Hjaltason and H. Samet. “Ranking in spatial databases,” Proceedings 4th SSD Symposium, 83–95, 1995.

  7. G. Hjaltason and H. Samet. “Distance browsing in spatial databases,” ACM Transactions on Database Systems, Vol. 24(2):265–318, 1999.

    Google Scholar 

  8. Y. Ishikawa, H. Kitagawa, and T. Kawashima. “Continual neighborhood tracking for moving objects using adaptive distances,” Proceedings IDEAS Conference, 54–63, 2002.

  9. D.V. Kalashnikov, S. Prabhakar, S.E. Hambrusch, and W.G. Aref. “Efficient evaluation of continuous range queries on moving objects,” Proceedings 13th DEXA Conference, 731–740, 2002.

  10. G. Kollios, D. Gounopoulos, and V.J. Tsotras. “Nearest neighbor queries in a mobile environment,” Proceedings Workshop on Spatio-temporal Database Management, 119–134, 1999a.

  11. G. Kollios, D. Gunopoulos, and V. Tsotras. “On indexing mobile objects,” Proceedings 18th ACM PODS Symposium, 261–272, 1999b.

  12. A. Kumar, V.J. Tsotras, and C. Faloutsos. “Designing access methods for bitemporal databases,” IEEE Transactions on Knowledge and Data Engineering, Vol. 10(1):1–20, 1998.

    Google Scholar 

  13. I. Lazaridis, I. Porkaew, and S. Mehrotra. “Dynamic queries over mobile objects,” Proceedings 8th EDBT Conference, 269–286, 2002.

  14. D. Lomet and B. Salsberg. “Access methods for multiversion data,” Proceedings ACM SIGMOD Conference, 315–324, 1989.

  15. J. Moreira, C. Ribeiro, and T. Abdessalem. “Query operations for moving objects database systems,” Proceedings 8th ACM-GIS Workshop, 108–114, 2000.

  16. M.A. Nascimento and J.R.O. Silva. “Towards historical R-trees,” Proceedings 13th ACM SAC Symposium, 235–240, 1998.

  17. D. Pfoser, C.S. Jensen, and Y. Theodoridis. “Novel approaches to the indexing of moving object trajectories,” Proceedings 26th VLDB Conference, 395–406, 2000.

  18. C.M. Procopiuc, P.K. Agarwal, and S. Har-Peled. “STAR-tree: An efficient self-adjusting index for moving objects,” Proceedings ALENEX Conference, 178–193, 2002.

  19. N. Roussopoulos, S. Kelley, and F. Vincent. “Nearest neighbor queries,” Proceedings ACM SIGMOD Conference, 71–79, 1995.

  20. C. Ruemmler and J. Wilkes. “An introduction to disk drive modeling,” IEEE Computer, Vol. 27(3):17–29, 1994.

    Google Scholar 

  21. S. Saltenis, C.S. Jensen, S. Leutenegger, and M. Lopez. “Indexing the positions of continuously moving objects,” Proceedings ACM SIGMOD Conference, 331–342, 2000.

  22. A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. “Modeling and querying moving objects,” Proceedings 13th IEEE ICDE Conference, 422–432, 1997.

  23. Z. Song and N. Roussopoulos. “K-NN search for moving query point,” Proceedings 7th SSTD Symposium, 79–96, 2001a.

  24. Z. Song and N. Roussopoulos. “Hashing moving objects,” Proceedings 1st Workshop on Mobile Data Management, 161–172, 2001b.

  25. Y. Tao and D. Papadias. “Efficient historical R-trees,” Proceedings 13th SSDBM Conference, 2001a.

  26. Y. Tao and D. Papadias. “MV3R-tree — a spatio-temporal access method for timestamp and interval queries,” Proceedings 27th VLDB Conference, 431–440, 2001b.

  27. Y. Tao, D. Papadias, and Q. Shen. “Continuous nearest neighbor search,” Proceedings 28th VLDB Conference, 287–298, 2002a.

  28. Y. Tao and D. Papadias. “Time-parameterized queries in spatio-temporal databases,” Proceedings ACM SIGMOD Conference, 334–345, 2002b.

  29. Y. Theodoridis, M. Vazirgiannis, and T. Sellis. “Spatio-temporal indexing for large multimedia applications,” Proceedings 3rd IEEE Conference on Multimedia Computing and Systems, 441–448, 1996.

  30. Y. Theodoridis, T. Sellis, A.N. Papadopoulos, and Y. Manolopoulos. “Specifications for efficient indexing in spatio-temporal databases,” Proceedings 10th SSDBM Conference, 123–132, 1998.

  31. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. “Moving objects databases: Issues and solutions,” Proceedings 10th SSDBM Conference, 111–122, 1998.

  32. O. Wolfson, B. Xu, and S. Chamberlain. “Location prediction and queries for tracking moving objects,” Proceedings 16th IEEE ICDE Conference, 687–688, 2000.

  33. X. Xu, J. Han, and W. Lu. “RT-tree: An improved R-tree index structure for spatio-temporal databases,” Proceedings SDH Conference, 1040–1049, 1990.

  34. B. Zheng and D. Lee. “Semantic caching in location-dependent query processing,” Proceedings 7th SSTD Symposium, 97–116, 2001.

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University, Thessaloniki, 54006, Greece

    K. Raptopoulou, A.N. Papadopoulos & Y. Manolopoulos

Authors
  1. K. Raptopoulou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A.N. Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raptopoulou, K., Papadopoulos, A. & Manolopoulos, Y. Fast Nearest-Neighbor Query Processing in Moving-Object Databases. GeoInformatica 7, 113–137 (2003). https://doi.org/10.1023/A:1023403908170

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023403908170

Search

Navigation