Frequent Query Matching in Dynamic Data Warehousing
Charles H. Goonetilleke, J. Wenny Rahayu, Md. Saiful Islam

TL;DR
This paper proposes a novel approach for matching and maintaining materialized views in dynamic data warehouses to better support changing query patterns and improve retrieval efficiency.
Contribution
It introduces new query and domain matching techniques along with a maintenance strategy for materialized view collections in DDWs.
Findings
Enhanced query matching accuracy
Improved scalability of MV collection
Faster response times in dynamic environments
Abstract
With the need for flexible and on-demand decision support, Dynamic Data Warehouses (DDW) provide benefits over traditional data warehouses due to their dynamic characteristics in structuring and access mechanism. A DDW is a data framework that accommodates data source changes easily to allow seamless querying to users. Materialized Views (MV) are proven to be an effective methodology to enhance the process of retrieving data from a DDW as results are pre-computed and stored in it. However, due to the static nature of materialized views, the level of dynamicity that can be provided at the MV access layer is restricted. As a result, the collection of materialized views is not compatible with ever-changing reporting requirements. It is important that the MV collection is consistent with current and upcoming queries. The solution to the above problem must consider the following aspects: (a)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Data Quality and Management
