摘要
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.
| 原文 | English |
|---|---|
| 主出版物標題 | Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings |
| 頁面 | 65-76 |
| 頁數 | 12 |
| DOIs | |
| 出版狀態 | Published - 2011 |
| 事件 | 13th Asia-Pacific Conference on Web Technology, APWeb 2011 - Beijing, China 持續時間: 2011 4月 18 → 2011 4月 20 |
出版系列
| 名字 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| 卷 | 6612 LNCS |
| ISSN(列印) | 0302-9743 |
| ISSN(電子) | 1611-3349 |
Other
| Other | 13th Asia-Pacific Conference on Web Technology, APWeb 2011 |
|---|---|
| 國家/地區 | China |
| 城市 | Beijing |
| 期間 | 11-04-18 → 11-04-20 |
UN SDG
此研究成果有助於以下永續發展目標
-
SDG 11 永續發展的城市與社群
All Science Journal Classification (ASJC) codes
- 理論電腦科學
- 一般電腦科學
指紋
深入研究「CkNN query processing over moving objects with uncertain speeds in road networks」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver