The Community for Technology Leaders
2015 IEEE 31st International Conference on Data Engineering (ICDE) (2015)
Seoul, South Korea
April 13, 2015 to April 17, 2015
ISBN: 978-1-4799-7964-6
pp: 1215-1226
Abdeltawab M. Hendawi , Institute of Technology, University of Washington, Tacoma, USA
Jie Bao , Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA
Mohamed F. Mokbel , Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA
Mohamed Ali , Microsoft Corporation, USA
ABSTRACT
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 the existing related work, and scales up to support a large number of moving objects and heavy predictive query workloads.
INDEX TERMS
Roads, Indexes, Trajectory, Predictive models, Prediction algorithms, Query processing, Artificial neural networks
CITATION
Abdeltawab M. Hendawi, Jie Bao, Mohamed F. Mokbel, Mohamed Ali, "Predictive tree: An efficient index for predictive queries on road networks", 2015 IEEE 31st International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 1215-1226, 2015, doi:10.1109/ICDE.2015.7113369
176 ms
(Ver 3.3 (11022016))