Show simple item record

dc.contributor.authorΓεργατσούλης, Μανώληςel_GR
dc.contributor.authorΑφράτη, Φώτοel_GR
dc.contributor.authorDamigos, M.en
dc.contributor.authorGergatsoulis, Manolisen
dc.contributor.authorAfrati, Fotoen
dc.descriptionΠεριέχει το πλήρες κείμενοel_GR
dc.description.abstractIn 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 certain restricted search spaces suffice. They suffice in the sense that they do not compromise optimality in that they contain at least one of the optimal solutions. We start with the general case, where we give a tight condition that candidate views can satisfy and still the search space (thus limited) does contain at least one optimal solution. Preliminary experiments show that this reduces the size of the search space significantly. Then we study special cases. We show that for chain query workloads, taking only chain views may miss all optimum solutions, whereas, if we further limit the queries to be path queries (i.e., chain queries over a single binary relation), then path views suffice. This last result shows that in the case of path queries, taking query subexpressions suffice.en
dc.sourceLecture Notes in Business Information Processing Volume 27 LNBIP, 2009, Pages 12-28en
dc.titleOn solving efficiently the view selection problem under bag-semanticsen
dc.subject.uncontrolledtermΔιαχείριση υπηρεσιών, λειτουργιών και τεχνικών πληροφόρησηςel_GR
dc.subject.uncontrolledtermInformation treatment for information servicesen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record