Experimental evaluation of data warehouse configuration algorithms

Author

Ligoudistianos, Spyros ; Theodoratos, Dimitri ; Sellis, Timos

Author_Institution

Dept. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece

fYear

1998

fDate

25-28 Aug 1998

Firstpage

218

Lastpage

223

Abstract

A data warehouse (DW) can be seen as a set of materialized views defined over relations that are stored in remote heterogeneous database systems. When a query is posed to the DW, it is evaluated locally, using only the materialized views. The DW configuration problem is the problem of selecting an optimal set of views to materialize that answer a given set of queries. The objective is the minimization of the combination of the query evaluation and view maintenance costs. We report on the experimental evaluation of an exhaustive algorithm and we develop new greedy and heuristic algorithms that expand only a small fraction of the states produced by the exhaustive algorithm. The algorithms are described in terms of a state space search problem. Finally, we report on experimental results and discuss the observed behavior of the algorithms

Keywords

configuration management; distributed databases; query processing; search problems; very large databases; DW configuration problem; data warehouse configuration algorithms; exhaustive algorithm; experimental evaluation; greedy algorithms; heuristic algorithms; materialized views; observed behavior; optimal set; query evaluation; remote heterogeneous database systems; state space search problem; view maintenance costs; Computer science; Cost function; Data warehouses; Distributed databases; Heuristic algorithms; Merging; Multidimensional systems; Query processing; Search problems; State-space methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Database and Expert Systems Applications, 1998. Proceedings. Ninth International Workshop on

Conference_Location

Vienna

Print_ISBN

0-8186-8353-8

Type

conf

DOI

10.1109/DEXA.1998.707406

Filename

707406