Rewriting OLAP queries using materialized views and dimension hierarchies in data warehouses
Chang-Sup Park, Myoung Ho Kim, Yoon-Joon Lee
Abstract
Chang-Sup Park, Myoung Ho Kim, Yoon-Joon Lee
Abstract
OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process expensive OLAP queries efficiently, we propose a new method for rewriting a given OLAP query using the various kinds of materialized aggregate views which already exist in data warehouses. We first define the normal forms of OLAP queries and materialized views based on the lattice of dimension hierarchies and the semantic information in data warehouses. Conditions for the usability of a materialized view in rewriting a given query are specified by relationships between the components of their normal forms. We present a rewriting algorithm for OLAP queries that effectively utilizes existing materialized views. The proposed algorithm can make use of materialized views having different selection granularities, selection regions and aggregation granularities together, to generate an efficient rewritten query.
OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process expensive OLAP queries efficiently, we propose a new method for rewriting a given OLAP query using the various kinds of materialized aggregate views which already exist in data warehouses. We first define the normal forms of OLAP queries and materialized views based on the lattice of dimension hierarchies and the semantic information in data warehouses. Conditions for the usability of a materialized view in rewriting a given query are specified by relationships between the components of their normal forms. We present a rewriting algorithm for OLAP queries that effectively utilizes existing materialized views. The proposed algorithm can make use of materialized views having different selection granularities, selection regions and aggregation granularities together, to generate an efficient rewritten query.
Key concepts: Online analytical processing, Materialized view, Computer science, Data warehouse, Rewriting, Dimension (graph theory), Information retrieval, Database