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
An index structure that, for a temporal graph with N edges, requires O(N) space and can evaluate extended BGPs in wco time and yields wco guarantees for related query types, including snapshot evaluation, version queries, and other temporal variants.
Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro et al.· Proceedings of the VLDB Endo...· 0 citations
This paper shows how to uplift wco join algorithms so as to incorporate such filtering natively, improving efficiency and demonstrates the superiority of this approach by extending the Ring -- a compact index that provides wco resolution of BGPs within almost no extra space on top of the graph -- so as to handle proper...