A general framework for the view selection problem for data warehouse design and evolution
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Physical Database Design for Data Warehouses
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
View materialization vs. indexing: balancing space constraints in data warehouse design
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Towards stream data parallel processing in spatial aggregating index
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
| Hi-index | 0.00 |
In this paper we present a solution called Materialized Aggregate List designed for the storing and processing of long aggregate lists. An aggregate list contains aggregates, calculated from the data stored in the database. In our approach, once created, the aggregates are materialized for further use. The list structure contains a table divided into pages. We present three different multi-thread page-filling algorithms used when the list is browsed. The Materialized Aggregate List can be applied as a component of a node on every aggregation level in indexing structures, such as, an aR-tree. We present test results estimating an efficiency of the proposed solution.