Advisor

Leonard Shapiro

Date of Award

10-21-1997

Document Type

Thesis

Degree Name

Master of Science (M.S.) in Computer Science

Department

Computer Science

Physical Description

1 online resource, (59p.)

Subjects

Computer algorithms, Relational databases, Data warehousing

DOI

10.15760/etd.7278

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.

Description

If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to pdxscholar@pdx.edu and include clear identification of the work, preferably with URL.

Persistent Identifier

https://archives.pdx.edu/ds/psu/32507

Share

COinS