Advertisement

The VLDB Journal

, Volume 19, Issue 3, pp 307–332 | Cite as

Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries

  • Sarana Nutanong
  • Rui Zhang
  • Egemen TaninEmail author
  • Lars Kulik
Regular Paper

Abstract

The moving k nearest neighbor (MkNN) query continuously finds the k nearest neighbors of a moving query point. MkNN queries can be efficiently processed through the use of safe regions. In general, a safe region is a region within which the query point can move without changing the query answer. This paper presents an incremental safe-region-based technique for answering MkNN queries, called the V*-Diagram, as well as analysis and evaluation of its associated algorithm, V*-kNN. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the knowledge of the query location and the boundary of the search space in addition to the data objects. As a result, V*-kNN has much smaller I/O and computation costs than existing methods. We further provide cost models to estimate the number of data accesses for V*-kNN and a competitive technique, RIS-kNN. The V*-Diagram and V*-kNN are also applicable to the domain of spatial networks and we present algorithms to construct a spatial-network V*-Diagram. Our experimental results show that V*-kNN significantly outperforms the competitive technique. The results also verify the accuracy of the cost models.

Keywords

Spatial databases Nearest neighbor search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Böhm C.: A cost model for query processing in high dimensional data spaces. ACM Trans. Database Syst. 25(2), 129–178 (2000)CrossRefGoogle Scholar
  4. 4.
    Chávez E., Navarro G., Baeza-Yates R.A., Marroquín J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)CrossRefGoogle Scholar
  5. 5.
    Cho, H.J., Chung, C.W.: An efficient and scalable approach to CNN queries in a road network. In: VLDB, pp. 865–876 (2005)Google Scholar
  6. 6.
    Dijkstra E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)Google Scholar
  8. 8.
    Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco (2006)Google Scholar
  9. 9.
    Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: Symposium on Large Spatial Databases, pp. 83–95 (1995)Google Scholar
  10. 10.
    Hjaltason G.R., Samet H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265–318 (1999)CrossRefGoogle Scholar
  11. 11.
    Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, pp. 479–490 (2005)Google Scholar
  12. 12.
    Huang, X., Jensen, C.S., Lu, H., Saltenis, S.: S-GRID: A versatile approach to efficient query processing in spatial networks. In: SSTD, pp. 93–111 (2007)Google Scholar
  13. 13.
    Huang, X., Jensen, C.S., Saltenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: SSTD, pp. 73–90 (2005)Google Scholar
  14. 14.
    Iwerks G.S., Samet H., Smith K.P.: Maintenance of k-nn and spatial join queries on continuously moving points. ACM Trans. Database Syst. 31(2), 485–536 (2006)CrossRefGoogle Scholar
  15. 15.
    Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pp. 840–851 (2004)Google Scholar
  16. 16.
    Kolahdouzan M.R., Shahabi C.: Alternative solutions for continuous k nearest neighbor queries in spatial network databases. GeoInformatica 9(4), 321–341 (2005)CrossRefGoogle Scholar
  17. 17.
    Kulik, L., Tanin, E.: Incremental rank updates for moving query points. In: GIScience, pp. 251–268 (2006)Google Scholar
  18. 18.
    Mouratidis K., Papadias D., Bakiras S., Tao Y.: A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans. Knowl. Data Eng. 17(11), 1451–1464 (2005)CrossRefGoogle Scholar
  19. 19.
    Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The V*-Diagram: A query dependent approach to moving kNN queries. In: VLDB, pp. 1095–1106 (2008)Google Scholar
  20. 20.
    Okabe A., Boots B., Sugihara K.: Spatial tessellations: concepts and applications of Voronoi diagrams. John Wiley & Sons, Inc., New York (1992)zbMATHGoogle Scholar
  21. 21.
    Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802–813 (2003)Google Scholar
  22. 22.
    Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)Google Scholar
  23. 23.
    Samet H.: Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Francisco (2006)zbMATHGoogle Scholar
  24. 24.
    Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43–55 (2008)Google Scholar
  25. 25.
    Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: SSTD, pp. 79–96 (2001)Google Scholar
  26. 26.
    Splitzer F.: Principles of Random Walk. Springer, Berlin (2001)Google Scholar
  27. 27.
    Tao, Y., Papadias, D.: Time-parameterized queries in spatio- temporal databases. In: SIGMOD, pp. 334–345 (2002)Google Scholar
  28. 28.
    Tao Y., Papadias D.: Spatial queries in dynamic environments. ACM Trans. Database Syst. 28(2), 101–139 (2003)CrossRefGoogle Scholar
  29. 29.
    Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287–298 (2002)Google Scholar
  30. 30.
    Tao Y., Zhang J., Papadias D., Mamoulis N.: An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces. IEEE Trans. Knowl. Data Eng. 16(10), 1169–1184 (2004)CrossRefGoogle Scholar
  31. 31.
    U.S. Census Bureau: Economic census (retail trade United States) (2002)Google Scholar
  32. 32.
    Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)Google Scholar
  33. 33.
    Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: SIGMOD, pp. 443–454 (2003)Google Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • Sarana Nutanong
    • 1
    • 2
  • Rui Zhang
    • 1
  • Egemen Tanin
    • 1
    • 2
    Email author
  • Lars Kulik
    • 1
    • 2
  1. 1.Department of Computer Science and Software EngineeringUniversity of MelbourneMelbourneAustralia
  2. 2.NICTA VictoriaMelbourneAustralia

Personalised recommendations