Surface k-NN Query Processing

A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient k-NN query processing is to fetch and check the distances of a minimum number of points from the database. For many applications, such as vehicle movement along road networks or rover and animal movement along terrain surfaces, the distance is only meaningful when it is along a valid movement path. For this type of k-NN queries, the focus of efficient query processing is to minimize the cost of computing distances using the environment data (such as the road network data and the terrain data), which can be several orders of magnitude larger than that of the point data. Efficient processing of k-NN queries based on the Euclidian distance or the road network distance has been investigated extensively in the past. In this paper, we investigate the problem of surface k-NN query processing, where the distance ...

• Type: Conference
• Year: 2006
• Where: ICDE
• Authors: Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003, Xuemin Lin
• Keywords: Database, Efficient Query Processing, ICDE 2006, Multiresolution Terrain Models, Road Network Distance