Designing data warehouses

Theodoratos, D; Sellis, T

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T01:14:30Z
dc.date.available	2014-03-01T01:14:30Z
dc.date.issued	1999	en
dc.identifier.issn	0169-023X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13112
dc.subject	data warehousing	en
dc.subject	materialized views	en
dc.subject	view maintenance	en
dc.subject	data warehouse design	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	Algorithms	en
dc.subject.other	Data mining	en
dc.subject.other	Distributed database systems	en
dc.subject.other	Heuristic programming	en
dc.subject.other	Optimization	en
dc.subject.other	Data warehouse design	en
dc.subject.other	Data warehousing	en
dc.subject.other	Materialized view	en
dc.subject.other	View maintenance	en
dc.subject.other	Query languages	en
dc.title	Designing data warehouses	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0169-023X(99)00029-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0169-023X(99)00029-4	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	A Data Warehouse (DW) is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without accessing the original information sources. In this paper we deal with the issue of designing a DW, in the context of the relational model, by selecting a set of views to materialize in the DW. First, we briefly present a theoretical framework for the DW design problem, which concerns the selection of a set of views that (a) fit in the space allocated to the DW, (b) answer all the queries of interest, and (c) minimize the total query evaluation and view maintenance cost. We then formalize the DW design problem as a state space search problem by taking into account multiquery optimization over the maintenance queries (i.e., queries that compute changes to the materialized views) and the use of auxiliary views for reducing the view maintenance cost. Finally, incremental algorithms and heuristics for pruning the search space are presented. (C) 1999 Published by Elsevier Science B.V. All rights reserved.	en
heal.publisher	Elsevier Science Publishers B.V., Amsterdam, Netherlands	en
heal.journalName	Data and Knowledge Engineering	en
dc.identifier.doi	10.1016/S0169-023X(99)00029-4	en
dc.identifier.isi	ISI:000082965500004	en
dc.identifier.volume	31	en
dc.identifier.issue	3	en
dc.identifier.spage	279	en
dc.identifier.epage	301	en