Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Indexing Spatio-Temporal Data Warehouses
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
Hierarchical dwarfs for the rollup cube
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The Star Schema Benchmark and Augmented Fact Table Indexing
Performance Evaluation and Benchmarking
| Hi-index | 0.00 |
Traditional data warehouses are built in an off-line periodic fashion which makes them less valuable in applications where the most up-to-date data is required. For these applications, data should be incorporated in the warehouse and made available as soon as possible in "Real Time Data Warehouse". In this paper we propose an indexing model named TiC-Tree, in order to simultaneously index and store multidimensional detailed and aggregated data. Our contribution exploits the temporal nature of data and focuses on range and/or group-by queries. We evaluate our proposal with the synthetic data set Star Schema Benchmark and advocate it in comparison with other existing solution.