Call for Papers
About the Journal
Editorial Board
Publication Ethics
Instructions for Authors
Current Issue
Back Issues
Search for Articles

JCSE, vol. 1, no. 2, pp.211-232, December, 2007


Trajectory Data Warehouses: Design and Implementation Issues

Salvatore Orlando, Renzo Orsini, Alessandra Ra˙aeta, Alessandro Roncato Claudio Silvestri
Dipartimento di Informatica - Universita Ca’ Foscari Venezia, Italy|Dipartimento di Informatica e Comunicazione - Universita di Milano, Italy

Abstract: In this paper we investigate some issues and solutions related to the design of a Data Warehouse(DW), storing several aggregate measures about trajectories of moving objects. First we discuss the loading phase of our DW which has to deal with overwhelming streams of trajectory obser-vations, possibly produced at different rates, and arriving in an unpredictable and unbounded way. Then, we focus on the measure presence, the most complex measure stored in our DW. Such a measure returns the number of distinct trajectories that lie in a spatial region during a given temporal interval. We devise a novel way to compute an approximate, but very accurate, presence aggregate function, which algebraically combines a bounded amount of measures stored in the base cells of the data cube. We conducted many experiments to show the effectiveness of our method to compute such an aggregate function. In addition, the feasibility of our innovative trajectory DW was validated with an implementation based on Oracle. We investigated the most challenging issues in realizing our trajectory DW using standard DW technologies: namely, the preprocessing and loading phase, and the aggregation functions to support OLAP operations.

Keyword: No keyword

Full Paper:   124 Downloads, 5552 View

ⓒ Copyright 2010 KIISE – All Rights Reserved.    
Korean Institute of Information Scientists and Engineers (KIISE)   #401 Meorijae Bldg., 984-1 Bangbae 3-dong, Seo-cho-gu, Seoul 137-849, Korea
Phone: +82-2-588-9240    Fax: +82-2-521-1352    Homepage:    Email: