Effective Caching of Shortest Travel-Time Paths for Web Mapping Mashup Systems
Effective Caching of Shortest Travel-Time Paths for Web Mapping Mashup Systems
复制标题
DOI：
10.1007/978-3-319-68783-4_29
复制
发表时间：
2017-10
期刊：
影响因子：
--
通讯作者：
Detian Zhang;An Liu;Gangyong Jia;Fei Chen;Qing Li;Jian Li
中科院分区：
文献类型：
--
作者：
Detian Zhang;An Liu;Gangyong Jia;Fei Chen;Qing Li;Jian Li
对于基于位置的服务（LBS），具有最短旅行时间的路径比具有最短网络距离的路径更有意义，因为它考虑了实时交通状况。然而，并不是每个LBS提供商都有足够的资源来自行计算最短旅行时间路径。对于LBS提供商来说，一种具有成本效益的方法是从Web地图服务（例如，谷歌地图）通过外部请求。由于处理此类外部请求的高成本和使用限制，本文为LBS提供者设计了一种有效的最短旅行时间路径缓存，以减少Web地图服务的外部请求数量和用户的查询响应时间。在真实的Web地图服务和数据集上的实验结果证实了所提技术的有效性。
For location-based services (LBS), the path with the shortest travel time is much more meaningful than the one with the shortest network distance, as it considers the live traffic situation. However, not every LBS provider has enough resources to compute the shortest travel-time paths by themselves. A cost-effective way for LBS providers is retrieving the shortest travel-time paths from Web mapping services (e.g., Google Maps) through external requests. Due to the high cost of processing such external requests and the usage limits, we design an effective cache of shortest travel-time paths for LBS providers in this paper, to reduce the number of external requests to Web mapping services and the query response time to users. Experimental results on real Web mapping service and datasets confirm the effectiveness of the proposed techniques.