Name
Abstract | ||
|---|---|---|
This paper focuses on processing continuous k nearest neighbor queries over objects moving at uncertain speeds (CUkNN) in road networks. We present a novel model to estimate the distances between objects and a query, both of which move at variable speeds in the road network. Based on the proposed distance model, we present a CUkNN query monitoring method to continuously find the objects that could potentially be the k-nearest neighbors (kNN) of the query. We propose an efficient method to calculate the probability of each object being a kNN of a query. The key thing about the method is that the probability of an object being a kNN of query q is shown to be equivalent to the probability of a special line segment being one of the k-nearest lines from q, which greatly simplifies the probability calculation. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20291-9_9 | APWeb |
Keywords | DocType | Volume |
uncertain speed,query q,road network,proposed distance model,novel model,k-nearest line,cuknn query monitoring method,efficient method,cknn query processing,k-nearest neighbor,probability calculation,neighbor query,k nearest neighbor | Conference | 6612 |
ISSN | Citations | PageRank |
0302-9743 | 9 | 0.46 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Guohui | 1 | 447 | 76.53 |
| Yanhong Li | 2 | 60 | 10.94 |
| Lihchyun Shu | 3 | 130 | 17.32 |
| Ping Fan | 4 | 29 | 2.52 |