| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Chen, Arbee L. P.; Lee, Chia-Chen; Wu, Yi-Hung | en_US |
| dc.date (日期) | 2007-07 | en_US |
| dc.date.accessioned | 16-十二月-2008 16:46:59 (UTC+8) | - |
| dc.date.available | 16-十二月-2008 16:46:59 (UTC+8) | - |
| dc.date.issued (上傳時間) | 16-十二月-2008 16:46:59 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/15008 | - |
| dc.description.abstract (摘要) | The one-shot shortest path query has been studied for decades. However, in the applications on road networks, users are actually interested in the path with the minimum travel time (the fastest path), which varies as time goes. This motivates us to study the continuous evaluation of fastest path queries in order to capture the dynamics of road networks. Repeatedly evaluating a large number of fastest path queries at every moment is infeasible due to its computationally expensive cost. We propose a novel approach that employs the concept of the affecting area and the tolerance parameter to avoid the reevaluation while the travel time of the current answer is close enough to that of the fastest path. Furthermore, a grid-based index is designed to achieve the efficient processing of multiple queries. Experiments on real datasets show significant reduction on the total amount of reevaluation and therefore the cost for reevaluating a query. | en-US |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Advances in Spatial and Temporal Databases, Lecture Notes in Computer Science Series 4605, pp.20-37 | en_US |
| dc.subject (關鍵詞) | Fastest Path; Road Network; Continuous Query Processing | en-US |
| dc.title (題名) | Continuous Evaluation of Fastest Path Queries on Road Networks | en_US |
| dc.type (資料類型) | article | en |
