Year: 2000
Type: report
Abstract: A data warehouse is a stand-alone repository of integrated information available for decision support OLAP querying and analysis. Aggregate views can be materialized (stored in disk) to improve query performance in a data warehouse. Several static and dynamic algorithms for selecting materialized aggregate views (MA V) in a data warehouse are proposed in this thesis. The algorithms are then compared by running a simulation system, which can be configured to compare several algorithms on different type of data warehouses. Simulation results for static algorithms are presented to show that several proposed algorithms perform close to an existing good algorithm (HRU Greedy) and run much faster. Simulation results also show that dynamic algorithms depend on locality and need improvement.
DOI: 10.15760/etd.7278
Author: Yubo Fan
Institution: Portland State University
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3012397820
