Incremental design of a data warehouse

Theodoratos, D; Sellis, T

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T01:15:39Z
dc.date.available	2014-03-01T01:15:39Z
dc.date.issued	2000	en
dc.identifier.issn	0925-9902	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13647
dc.subject	data warehousing	en
dc.subject	materialized views	en
dc.subject	view selection	en
dc.subject	view usability	en
dc.subject	view maintenance	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	MULTIPLE-QUERY OPTIMIZATION	en
dc.title	Incremental design of a data warehouse	en
heal.type	journalArticle	en
heal.identifier.primary	10.1023/A:1008773527263	en
heal.identifier.secondary	http://dx.doi.org/10.1023/A:1008773527263	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	A data warehouse (DW) can be seen as a set of materialized views defined over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, without accessing the original information sources. The DWs are dynamic entities that evolve continuously over time. As time passes, new queries need to be answered by them. Some of these queries can be answered using exclusively the materialized views. In general though new views need to be added to the DW. In this paper we investigate the problem of incrementally designing a DW when new queries need to be answered and possibly extra space is allocated for view materialization. Based on an AND/OR dag representation of multiple queries, we model the problem as a state space search problem. We design incremental algorithms for selecting a set of new views to additionally materialize in the DW that: (a) fits in the extra space, (b) allows a complete rewriting of the new queries over the materialized views, and (c) minimizes the combined new query evaluation and new view maintenance cost. Finally, we discuss methods for pruning the search space so that efficiency is improved.	en
heal.publisher	KLUWER ACADEMIC PUBL	en
heal.journalName	JOURNAL OF INTELLIGENT INFORMATION SYSTEMS	en
dc.identifier.doi	10.1023/A:1008773527263	en
dc.identifier.isi	ISI:000087869400002	en
dc.identifier.volume	15	en
dc.identifier.issue	1	en
dc.identifier.spage	7	en
dc.identifier.epage	27	en