## Weighted hypertree decompositions and optimal query plans (2004)

### Cached

### Download Links

- [www.ics.uci.edu]
- [www.ics.uci.edu]
- [www.ics.uci.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. of PODS’04 |

Citations: | 8 - 2 self |

### BibTeX

@INPROCEEDINGS{Scarcello04weightedhypertree,

author = {Francesco Scarcello},

title = {Weighted hypertree decompositions and optimal query plans},

booktitle = {In Proc. of PODS’04},

year = {2004},

pages = {210--221}

}

### OpenURL

### Abstract

Hypertree width [22, 25] is a measure of the degree of cyclicity of hypergraphs. A number of relevant problems from different areas, e.g., the evaluation of conjunctive queries in database theory or the constraint satisfaction in AI, are tractable when their underlying hypergraphs have bounded hypertree width. However, in practical contexts like the evaluation of database queries, we have more information besides the structure of queries. For instance, we know the number of tuples in relations, the selectivity of attributes and so on. In fact, all commercial query-optimizers are based on quantitative methods and do not care about structural properties. In this paper, we define the notion of weighted hypertree decomposition, in order to combine structural decomposition methods with quantitative approaches. Weighted hypertree decompositions are equipped with cost functions, that can be used for modelling many