Document Type
Thesis
Date of Award
Spring 5-31-2011
Degree Name
Master of Science in Computer Science - (M.S.)
Department
Computer Science
First Advisor
Vincent Oria
Second Advisor
Cristian Borcea
Third Advisor
Dimitri Theodoratos
Abstract
While indexing historical trajectories is a hot topic in the field of moving objects (MO) databases for many years, only a few of them consider that the objects movements are constrained. DYNAMIC-PARINET (D-PATINET) is designed for capturing of trajectory data flow in multiple discrete small time interval efficiently and to predict a MO’s movement or the underlying network state at a future time.
The cornerstone of D-PARINET is PARINET, an efficient index for historical trajectory data. The structure of PARINET is based on a combination of graph partitioning and a set of composite B+-tree local indexes tuned for a given query load and a given data distribution in the network space. D-PARINET studies continuous update of trajectory data and use interpolation to predict future MO movement in the network. PARINET and D-PARINET can easily be integrated into any RDBMS, which is an essential asset particularly for industrial or commercial applications. The experimental evaluation under an off-the-shelf DBMS using simulated traffic data shows that DPARINET is robust and significantly outperforms the R-tree based access methods.
Recommended Citation
Nandi, Mou, "Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks" (2011). Theses. 92.
https://digitalcommons.njit.edu/theses/92
