Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing Spatio-Temporal Data Warehouses
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Spatio-Temporal Aggregation Using Sketches
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams
Distributed and Parallel Databases
Approximate Aggregations in Trajectory Data Warehouses
ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Nearest neighbor search on moving object trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Adaptive Management of Multigranular Spatio-Temporal Object Attributes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
What Is Spatio-Temporal Data Warehousing?
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Social pixels: genesis and evaluation
Proceedings of the international conference on Multimedia
Materialized views for count aggregates of spatial data
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
On the Management and Analysis of Our LifeSteps
ACM SIGKDD Explorations Newsletter
| Hi-index | 0.00 |
In this paper we investigate some issues related to the design of a simple 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 observations, 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 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.