Heuristic algorithms for designing a data warehouse with SPJ views

Spyros Ligoudistianos, Timos Sellis, Dimitri Theodoratos, Yannis Vassiliou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

A Data Warehouse (DW) can be abstractly seen as a set of materialized views defined over relations that are stored in distributed heterogeneous databases. The selection of views for materialization in a DW is thus an important decision problem. The objective is the minimization of the combination of the query evaluation and view maintenance costs. In this paper we expand on our previous work by proposing new heuristic algorithms for the DW design problem. These algorithms are described in terms of a state space search problem, and are guaranteed to deliver an optimal solution by expanding only a small fraction of the states produced by the (original) exhaustive algorithm.

Original languageEnglish (US)
Title of host publicationData Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings
EditorsA. Min Tjoa, Mukesh Mohania
PublisherSpringer Verlag
Pages96-105
Number of pages10
ISBN (Print)3540664580, 9783540664581
DOIs
StatePublished - 1999
Externally publishedYes
Event1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999 - Florence, Italy
Duration: Aug 30 1999Sep 1 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1676
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999
CountryItaly
CityFlorence
Period8/30/999/1/99

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Heuristic algorithms for designing a data warehouse with SPJ views'. Together they form a unique fingerprint.

Cite this