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

Deng, Ke, Zhou, Xiaofang, Shen, Heng Tao, Liu, Qing, Xu, Kai ORCID logoORCID: https://orcid.org/0000-0003-2242-5440 and Lin, Xuemin (2008) A multi-resolution surface distance model for k-NN query processing. VLDB Journal, 17 (5) . pp. 1101-1119. ISSN 1066-8888 [Article] (doi:10.1007/s00778-007-0053-2)


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.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 11183
Useful Links:
Depositing User: Teddy ~
Date Deposited: 05 Jul 2013 09:35
Last Modified: 13 Oct 2016 14:27
URI: https://eprints.mdx.ac.uk/id/eprint/11183

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.