View selection for designing the global data warehouse

Theodoratos, D; Ligoudistianos, S; Sellis, T

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Ligoudistianos, S	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T01:17:18Z
dc.date.available	2014-03-01T01:17:18Z
dc.date.issued	2001	en
dc.identifier.issn	0169-023X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14448
dc.subject	Data warehousing	en
dc.subject	Materialized views	en
dc.subject	View selection	en
dc.subject	View usability	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	Computer software selection and evaluation	en
dc.subject.other	Distributed database systems	en
dc.subject.other	Query languages	en
dc.subject.other	Materialized views	en
dc.subject.other	Data warehouses	en
dc.title	View selection for designing the global data warehouse	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0169-023X(01)00041-6	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0169-023X(01)00041-6	en
heal.language	English	en
heal.publicationDate	2001	en
heal.abstract	A global data warehouse (DW) integrates data from multiple distributed heterogeneous databases and other information sources. A global DW can be abstractly seen as a set of materialized views. The selection of views for materialization in a DW is an important decision in the design of a DW. Current commercial products do not provide tools for automatic DW design. We provide a general method that, given a set of select-project-join queries to be satisfied by the DW, generates sets of materialized views that satisfy all the input queries. This process is complex since 'common subexpressions' between the queries need to be detected and exploited. Our method is then applied to solve the problem of selecting such a materialized view set that fits in the space allocated to the DW for materialization and minimizes the combined overall query evaluation and view maintenance cost. We design algorithms which are implemented and we report on their experimental evaluation. (C) 2001 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Data and Knowledge Engineering	en
dc.identifier.doi	10.1016/S0169-023X(01)00041-6	en
dc.identifier.isi	ISI:000172056600002	en
dc.identifier.volume	39	en
dc.identifier.issue	3	en
dc.identifier.spage	219	en
dc.identifier.epage	240	en