Iroad

A framework for scalable predictive query processing on road networks

Abdeltawab M. Hendawim, Jie Bao, Mohamed Mokbel

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This demo presents the iRoad framework for evaluating predictive queries on moving objects for road networks. The main promise of the iRoad system is to support a variety of common predictive queries including predictive point query, predictive range query, predictive KNN query, and predictive aggregate query. The iRoad framework is equipped with a novel data structure, named reachability tree, employed to determine the reachable nodes for a moving object within a specified future time T. In fact, the reachability tree prunes the space around each object in order to significantly reduce the computation time. So, iRoad is able to scale up to handle real road networks with millions of nodes, and it can process heavy workloads on large numbers of moving objects. During the demo, audience will be able to interact with iRoad through a well designed Graphical User Interface to issue different types of predictive queries on a real road network, to obtain the predictive heatmap of the area of interest, to follow the creation and the dynamic update of the reachability tree around a specific moving object, and finally to examine the system efficiency and scalability.

Original languageEnglish
Pages (from-to)1262-1265
Number of pages4
JournalProceedings of the VLDB Endowment
Volume6
Issue number12
Publication statusPublished - 1 Aug 2013
Externally publishedYes

Fingerprint

Query processing
Graphical user interfaces
Data structures
Scalability

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Iroad : A framework for scalable predictive query processing on road networks. / Hendawim, Abdeltawab M.; Bao, Jie; Mokbel, Mohamed.

In: Proceedings of the VLDB Endowment, Vol. 6, No. 12, 01.08.2013, p. 1262-1265.

Research output: Contribution to journalArticle

@article{718cba2011674c90a878d118e5b63bac,
title = "Iroad: A framework for scalable predictive query processing on road networks",
abstract = "This demo presents the iRoad framework for evaluating predictive queries on moving objects for road networks. The main promise of the iRoad system is to support a variety of common predictive queries including predictive point query, predictive range query, predictive KNN query, and predictive aggregate query. The iRoad framework is equipped with a novel data structure, named reachability tree, employed to determine the reachable nodes for a moving object within a specified future time T. In fact, the reachability tree prunes the space around each object in order to significantly reduce the computation time. So, iRoad is able to scale up to handle real road networks with millions of nodes, and it can process heavy workloads on large numbers of moving objects. During the demo, audience will be able to interact with iRoad through a well designed Graphical User Interface to issue different types of predictive queries on a real road network, to obtain the predictive heatmap of the area of interest, to follow the creation and the dynamic update of the reachability tree around a specific moving object, and finally to examine the system efficiency and scalability.",
author = "Hendawim, {Abdeltawab M.} and Jie Bao and Mohamed Mokbel",
year = "2013",
month = "8",
day = "1",
language = "English",
volume = "6",
pages = "1262--1265",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "12",

}

TY - JOUR

T1 - Iroad

T2 - A framework for scalable predictive query processing on road networks

AU - Hendawim, Abdeltawab M.

AU - Bao, Jie

AU - Mokbel, Mohamed

PY - 2013/8/1

Y1 - 2013/8/1

N2 - This demo presents the iRoad framework for evaluating predictive queries on moving objects for road networks. The main promise of the iRoad system is to support a variety of common predictive queries including predictive point query, predictive range query, predictive KNN query, and predictive aggregate query. The iRoad framework is equipped with a novel data structure, named reachability tree, employed to determine the reachable nodes for a moving object within a specified future time T. In fact, the reachability tree prunes the space around each object in order to significantly reduce the computation time. So, iRoad is able to scale up to handle real road networks with millions of nodes, and it can process heavy workloads on large numbers of moving objects. During the demo, audience will be able to interact with iRoad through a well designed Graphical User Interface to issue different types of predictive queries on a real road network, to obtain the predictive heatmap of the area of interest, to follow the creation and the dynamic update of the reachability tree around a specific moving object, and finally to examine the system efficiency and scalability.

AB - This demo presents the iRoad framework for evaluating predictive queries on moving objects for road networks. The main promise of the iRoad system is to support a variety of common predictive queries including predictive point query, predictive range query, predictive KNN query, and predictive aggregate query. The iRoad framework is equipped with a novel data structure, named reachability tree, employed to determine the reachable nodes for a moving object within a specified future time T. In fact, the reachability tree prunes the space around each object in order to significantly reduce the computation time. So, iRoad is able to scale up to handle real road networks with millions of nodes, and it can process heavy workloads on large numbers of moving objects. During the demo, audience will be able to interact with iRoad through a well designed Graphical User Interface to issue different types of predictive queries on a real road network, to obtain the predictive heatmap of the area of interest, to follow the creation and the dynamic update of the reachability tree around a specific moving object, and finally to examine the system efficiency and scalability.

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

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

M3 - Article

VL - 6

SP - 1262

EP - 1265

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 12

ER -