首页> 外文会议>IEEE international conference on data engineering >Predictive tree: An efficient index for predictive queries on road networks
【24h】

Predictive tree: An efficient index for predictive queries on road networks

机译:预测树:道路网络上的预测查询有效索引

获取原文

摘要

Predictive queries on moving objects offer an important category of location-aware services based on the objects' expected future locations. A wide range of applications utilize this type of services, e.g., traffic management systems, location-based advertising, and ride sharing systems. This paper proposes a novel index structure, named Predictive tree (P-tree), for processing predictive queries against moving objects on road networks. The predictive tree: (1) provides a generic infrastructure for answering the common types of predictive queries including predictive point, range, KNN, and aggregate queries, (2) updates the probabilistic prediction of the object's future locations dynamically and incrementally as the object moves around on the road network, and (3) provides an extensible mechanism to customize the probability assignments of the object's expected future locations, with the help of user defined functions. The proposed index enables the evaluation of predictive queries in the absence of the objects' historical trajectories. Based solely on the connectivity of the road network graph and assuming that the object follows the shortest route to destination, the predictive tree determines the reachable nodes of a moving object within a specified time window T in the future. The predictive tree prunes the space around each moving object in order to reduce computation, and increase system efficiency. Tunable threshold parameters control the behavior of the predictive trees by trading the maximum prediction time and the details of the reported results on one side for the computation and memory overheads on the other side. The predictive tree is integrated in the context of the iRoad system in two different query processing modes, namely, the precomputed query result mode, and the on-demand query result mode. Extensive experimental results based on large scale real and synthetic datasets confirm that the predictive tree achieves better accuracy compared to - he existing related work, and scales up to support a large number of moving objects and heavy predictive query workloads.
机译:预测查询的移动对象提供的基于对象预计未来位置的位置感知服务的一个重要门类。广泛的应用范围使用这种类型的服务,例如,交通管理系统,基于位置的广告,以及拼车系统。本文提出了一种新颖的索引结构,命名树预测(P-树),用于对道路网的移动物体的处理预测性查询。预测树:(1)提供了一个通用的基础设施用于回答常见类型的预测的查询的,包括预测点,范围,KNN,和聚合查询,(2)动态地和递增地更新该对象的未来位置的概率上的预测的对象移动周围的道路网络,以及(3)提供了一个可扩展的机制,以自定义对象的预计未来位置的概率分配,与用户自定义函数的帮助。所提出的指数能够在没有对象的历史轨迹的预测查询的评价。仅基于道路网络图的连通并且假设对象跟随到目的地的最短路线,预测树确定在未来的指定时间窗T内的移动对象的可到达的节点。预测树修剪,以减少计算量,并提高系统效率各地的每个移动物体的空间。可调门限参数由交易的最大预测时间和报告结果的一方对对方的计算和存储开销的细节控制预测树木的行为。预测树集成在iRoad系统在两个不同的查询处理模式,即,预先计算的查询结果模式的上下文中,并按需查询结果的模式。基于大规模真实数据集合成大量实验结果证实,相比预测树达到更好的准确性 - 他现有的相关工作,并扩展到支持大量的移动物体和重型预测查询工作负载。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号