Advertisement

The VLDB Journal

, Volume 17, Issue 5, pp 1101–1119 | Cite as

A multi-resolution surface distance model for k-NN query processing

  • Ke DengEmail author
  • Xiaofang Zhou
  • Heng Tao Shen
  • Qing Liu
  • Kai Xu
  • Xuemin Lin
Regular Paper

Abstract

A spatial k-NN query returns k nearest points in a point dataset to a given query point. To measure the distance between two points, most of the literature focuses on the Euclidean distance or the network distance. For many applications, such as wildlife movement, it is necessary to consider the surface distance, which is computed from the shortest path along a terrain surface. In this paper, we investigate the problem of efficient surface k-NN (sk-NN) query processing. This is an important yet highly challenging problem because the underlying environment data can be very large and the computational cost of finding the shortest path on a surface can be very high. To minimize the amount of surface data to be used and the cost of surface distance computation, a multi-resolution surface distance model is proposed in this paper to take advantage of monotonic distance changes when the distances are computed at different resolution levels. Based on this innovative model, sk-NN queries can be processed efficiently by accessing and processing surface data at a just-enough resolution level within a just-enough search region. Our extensive performance evaluations using real world datasets confirm the efficiency of our proposed model.

Keywords

Query Processing Query Point Resolution Level Steiner Point Search Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, J., Han, Y.: Shortest paths on a polyhedron. In: 6th ACM Symp. Comput. Geometry, pp. 360–369 (1990)Google Scholar
  2. 2.
    Deng, K., Zhou, X.: Expansion-based algorithms for finding single pair shortest path on surface. In: Proc. of W2GIS, pp. 254–271 (2004)Google Scholar
  3. 3.
    Deng, K., Zhou, X., Shen, H.T., Xu, K., Lin, X.: Surface k-NN query processing. In: ICDE (2006)Google Scholar
  4. 4.
    Dijkstra E.W. (1959). A note on two problems in connection with graphs. Numer. Math. 1: 269–271 zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Garland, M.: Multiresolution modeling: survey and future opportunities. In: Eurographics, pp. 111–131 (1999)Google Scholar
  6. 6.
    Garland, M., Heckbert, P.S.: Surface simplification using quadric error metrics. In: 24th Int’l Conf. on Comput. Graphics and Interactive Tech. pp. 209–216 (1997)Google Scholar
  7. 7.
    Hjaltason G.R. and Samet H. (1999). Distance browsing in spatial databases. TODS 24(2): 265–318 CrossRefGoogle Scholar
  8. 8.
    Hoppe, H.: Progressive meshes. In: SIGGRAPH (1996)Google Scholar
  9. 9.
    Jagadish, H., Ooi, B., Tan, K.L., Yu,C., Zhang, R.: iDistance: an adaptive B+-tree based indexing method for nearest neighbour search. TODS (2005)Google Scholar
  10. 10.
    Jiang, B.: I/O efficiency of shortest path algorithms: an analysis. ICDE (1992)Google Scholar
  11. 11.
    Kanai, T., Suzuki, H.: Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications. Geom. Model. Process. 241–250 (2000)Google Scholar
  12. 12.
    Kaneva, B., O’Rourke, J.: An implementation of Chen & Han’s shortest paths algorithm. In: Proc. of 12th Canadian Conf. on Comput. Geom. pp. 139–146 (2000)Google Scholar
  13. 13.
    Kapoor, S.: Efficient computation of geodesic shortest paths. In: 31st Annual ACM Symp. on Theory of Computation, pp. 770–779 (1999)Google Scholar
  14. 14.
    Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. VLDB (2004)Google Scholar
  15. 15.
    Li Z. and Openshaw S. (1992). Algorithms for automated line generalization based on a natural principle of objective generalization. J. GIS 6(5): 373–389 Google Scholar
  16. 16.
    Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, Sack, J.-R., Urrutia, J. (eds) pp. 633–701 (2000)Google Scholar
  17. 17.
    Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. VLDB (2003)Google Scholar
  18. 18.
    Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. SIGMOD (1995)Google Scholar
  19. 19.
    Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. SIGMOD (1998)Google Scholar
  20. 20.
    Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: ACM GIS, pp. 94–100 (2002)Google Scholar
  21. 21.
    Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveler information system (atis). ICDE (1993)Google Scholar
  22. 22.
    Shekhar S. and Liu D. (1997). A connectivity-cluster access method for networks and network computations. TKDE 19(1): 102–119 Google Scholar
  23. 23.
    Tompkins, P., Stentz, T., Whittaker, W.: Mission planning for the sun-synchronous navigation field experiment. In: IEEE Int’l Conf. on Robotics and Automation, pp. 3493–3500 (2002)Google Scholar
  24. 24.
    Varadarajan, K.R., Agarwal, P.: Approximating shortest paths on an nonconvex polyhedron. In: Proc. 38th Annu. IEEE Symp. Found. Comput. Sci. pp. 182–191 (1997)Google Scholar
  25. 25.
    Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB (1998)Google Scholar
  26. 26.
    Xu, K., Zhou, X., Lin, X.: Direct mesh: a multiresolution approach to terrain visualisation. ICDE (2004)Google Scholar
  27. 27.
    Yiu M.L., Mamoulis N. and Papadias D. (2005). Aggregate nearest neighbor queries in road networks. TKDE 17(6): 820–833 Google Scholar

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  • Ke Deng
    • 1
    Email author
  • Xiaofang Zhou
    • 1
  • Heng Tao Shen
    • 1
  • Qing Liu
    • 1
  • Kai Xu
    • 2
  • Xuemin Lin
    • 3
  1. 1.School of Information Technology and Electrical EngineeringThe University of QueenslandBrisbaneAustralia
  2. 2.National ICT AustraliaAustralian Technology ParkEveleighAustralia
  3. 3.School of Computer Science and EngineeringUniversity of New South Wales, NICTASydneyAustralia

Personalised recommendations