...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Systems >On using broadcast index for efficient execution of shortest path continuous queries
【24h】

On using broadcast index for efficient execution of shortest path continuous queries

机译：关于使用广播索引有效执行最短路径连续查询

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Various efficient indexing techniques have been proposed for formulating broadcast index to minimize the tune-in cost at mobile clients to support shortest path search in a road network. However, none of them is designed for shortest path continuous queries (SPCQ). Due to frequent updates of traffic data, an SPCQ has to be invoked periodically while the client is following the suggested shortest path to its destination. This could result in heavy path searching cost at the client. To reduce the tune-in and path searching costs at the clients, in this paper, we propose the progressive approach (PA) in which we apply the next region (NR) approach together with a hierarchical network approach to formulate the local networks at the clients for shortest path navigation. Since the shortest path may change due to changing traffic, to minimize the path searching cost, we aim for an approximate path including shortcuts of shortcut networks (SN) from each invocation of an SPCQ to navigate the client to its destination step-by-step. In formulating the client local network, higher level shortcut networks are chosen if the regions are farther away from the current region of the client. An important property of the approximation mechanism adopted in PA is that traffic updates may be pruned if they will not significantly affect the shortest path information to be distributed to the clients. This can reduce the index re-generation cost at the traffic server. Extensive performance evaluation experiments have been conducted to investigate how PA reduces the tune-in cost from data broadcast and path searching cost at the clients with just small delays in the arrival times to their destinations.
机译：已经提出了各种有效的索引技术来制定广播索引，以最小化移动客户端的调整成本，以支持道路网络中的最短路径搜索。但是，它们都不是为最短路径连续查询（SPCQ）设计的。由于交通数据的频繁更新，当客户端遵循建议的到达其目的地的最短路径时，必须定期调用SPCQ。这可能会导致在客户端增加沉重的路径搜索成本。为了减少客户端的调入和路径搜索成本，在本文中，我们提出了一种渐进式方法（PA），在该方法中，我们将下一个区域（NR）方法与分层网络方法一起应用于在站点上建立本地网络。最短路径导航的客户端。由于最短路径可能会因流量变化而发生变化，因此，为了最大程度地减少路径搜索成本，我们的目标是提供一个近似路径，其中包括每次调用SPCQ时都会引导快捷方式网络（SN）的快捷方式，以逐步将客户端导航到其目的地。在制定客户端本地网络时，如果区域距离客户端的当前区域较远，则选择更高级别的快捷网络。 PA中采用的近似机制的一个重要属性是，如果流量更新不会显着影响要分发给客户端的最短路径信息，则可以对其进行修剪。这样可以减少流量服务器上的索引重新生成成本。已经进行了广泛的性能评估实验，以研究PA如何在到达客户目的地的时间仅有很小的延迟的情况下，减少数据广播和路径搜索成本的调整成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号