Gonzalo Navarro

Speeding up Qdags with Generalized Hypertree Decompositions

Worst-Case Optimal BGPs on Temporal Graphs

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.

Uplifting the Superpowers of Worst-Case-Optimal Join Algorithms

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 property graphs using new techniques while retaining compactness.