Speeding up Qdags with Generalized Hypertree Decompositions
This paper combines Qdags with a Generalized Hypertree Decomposition of the query, into subqueries with fewer variables, and implements algorithms that find the optimal GHD according to the AGM bounds of the subqueries and the specificities of the Qdag cost model.
Diego Arroyuelo, Gabriel Carmona, Gonzalo Navarro et al.
· 0 citations