On Solving Efficiently the View Selection Problem under Bag-semantics

Afrati, F; Damigos, M; Gergatsoulis, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Damigos, M	en
dc.contributor.author	Gergatsoulis, M	en
dc.date.accessioned	2014-03-01T02:51:25Z
dc.date.available	2014-03-01T02:51:25Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35502
dc.subject	Binary Relation	en
dc.subject	Conjunctive Queries	en
dc.subject	Optimal Solution	en
dc.subject	Satisfiability	en
dc.subject	Search Space	en
dc.title	On Solving Efficiently the View Selection Problem under Bag-semantics	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-03422-0_2	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-03422-0_2	en
heal.publicationDate	2008	en
heal.abstract	In this paper, we investigate the problem of view selection for workloads of conjunctive queries under bag semantics. In particular we aim to limit the search space of candidate viewsets. In that respect we start delineating the boundary between query workloads for which cer- tain restricted search spaces suffice. They suffice in the sense that they do not compromise optimality	en
heal.journalName	Business Intelligence for the Real-Time Enterprises	en
dc.identifier.doi	10.1007/978-3-642-03422-0_2	en