Predictive tree

An efficient index for predictive queries on road networks

Abdeltawab M. Hendawi, Jie Bao, Mohamed Mokbel, Mohamed Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2015 IEEE 31st International Conference on Data Engineering, ICDE 2015
PublisherIEEE Computer Society
Pages1215-1226
Number of pages12
Volume2015-May
ISBN (Electronic)9781479979639
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event2015 31st IEEE International Conference on Data Engineering, ICDE 2015 - Seoul, Korea, Republic of
Duration: 13 Apr 201517 Apr 2015

Other

Other2015 31st IEEE International Conference on Data Engineering, ICDE 2015
CountryKorea, Republic of
CitySeoul
Period13/4/1517/4/15

Fingerprint

Query processing
Marketing
Trajectories
Data storage equipment
Processing

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Hendawi, A. M., Bao, J., Mokbel, M., & Ali, M. (2015). Predictive tree: An efficient index for predictive queries on road networks. In 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015 (Vol. 2015-May, pp. 1215-1226). [7113369] IEEE Computer Society. https://doi.org/10.1109/ICDE.2015.7113369

Predictive tree : An efficient index for predictive queries on road networks. / Hendawi, Abdeltawab M.; Bao, Jie; Mokbel, Mohamed; Ali, Mohamed.

2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. Vol. 2015-May IEEE Computer Society, 2015. p. 1215-1226 7113369.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hendawi, AM, Bao, J, Mokbel, M & Ali, M 2015, Predictive tree: An efficient index for predictive queries on road networks. in 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. vol. 2015-May, 7113369, IEEE Computer Society, pp. 1215-1226, 2015 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, Korea, Republic of, 13/4/15. https://doi.org/10.1109/ICDE.2015.7113369
Hendawi AM, Bao J, Mokbel M, Ali M. Predictive tree: An efficient index for predictive queries on road networks. In 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. Vol. 2015-May. IEEE Computer Society. 2015. p. 1215-1226. 7113369 https://doi.org/10.1109/ICDE.2015.7113369
Hendawi, Abdeltawab M. ; Bao, Jie ; Mokbel, Mohamed ; Ali, Mohamed. / Predictive tree : An efficient index for predictive queries on road networks. 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. Vol. 2015-May IEEE Computer Society, 2015. pp. 1215-1226
@inproceedings{e34eec75def042a79e29ae817dcfa3a1,
title = "Predictive tree: An efficient index for predictive queries on road networks",
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.",
author = "Hendawi, {Abdeltawab M.} and Jie Bao and Mohamed Mokbel and Mohamed Ali",
year = "2015",
month = "1",
day = "1",
doi = "10.1109/ICDE.2015.7113369",
language = "English",
volume = "2015-May",
pages = "1215--1226",
booktitle = "2015 IEEE 31st International Conference on Data Engineering, ICDE 2015",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Predictive tree

T2 - An efficient index for predictive queries on road networks

AU - Hendawi, Abdeltawab M.

AU - Bao, Jie

AU - Mokbel, Mohamed

AU - Ali, Mohamed

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84940863858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940863858&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2015.7113369

DO - 10.1109/ICDE.2015.7113369

M3 - Conference contribution

VL - 2015-May

SP - 1215

EP - 1226

BT - 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015

PB - IEEE Computer Society

ER -