Size and treewidth bounds for conjunctive queries.
This paper provides new worst-case bounds for the size and treewith of the result Q(D) of a conjunctive query Q to a database D. We derive bounds for the result size jQ(D)j in terms of structural properties of Q, both in the absence and in the presence of keys and functional dependencies. These boun...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal article |
| Language: | English |
| Published: |
ACM
2009
|