eDAR Algorithm for Continuous KNN Queries Based on Pine

eDAR Algorithm for Continuous KNN Queries Based on Pine

Maytham Safar (Kuwait University, Kuwait) and Dariush Ebrahimi (Kuwait University, Kuwait)
Copyright: © 2009 |Pages: 21
DOI: 10.4018/978-1-60566-618-1.ch009
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The continuous K nearest neighbor (CKNN) query is an important type of query that finds continuously the KNN to a query point on a given path. We focus on moving queries issued on stationary objects in Spatial Network Database (SNDB) The result of this type of query is a set of intervals (defined by split points) and their corresponding KNNs. This means that the KNN of an object traveling on one interval of the path remains the same all through that interval, until it reaches a split point where its KNNs change. Existing methods for CKNN are based on Euclidean distances. In this paper we propose a new algorithm for answering CKNN in SNDB where the important measure for the shortest path is network distances rather than Euclidean distances. We propose DAR and eDAR algorithms to address CKNN queries based on the progressive incremental network expansion (PINE) technique. Our experiments show that the eDAR approach has better response time, and requires fewer shortest distance computations and KNN queries than approaches that are based on VN3 using IE.

Complete Chapter List

Search this Book:
Reset