The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks
Author:	Nandi, Mou
View Online:	njit-etd2011-079 (xi, 64 pages ~ 0.9 MB pdf)
Department:	Department of Computer Science
Degree:	Master of Science
Program:	Computer Science
Document Type:	Thesis
Advisory Committee:	Oria, Vincent (Committee chair) Borcea, Cristian (Committee member) Theodoratos, Dimitri (Committee member)
Date:	2011-05
Keywords:	Historical trajectory data Moving objects
Availability:	Unrestricted
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.