Worst-Case Optimal BGPs on Temporal Graphs
Unknown authors
· 0 citations
· 54 references
Similar papers
Jul 2026
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.
Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro et al.
· Proceedings of the VLDB Endo... · 0 citations
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
Conference
Jul 2026
Maximum Satisfiability of Simple Temporal Problems
The results suggest that MaxSTP is often computationally harder than optimizing qualitative CSPs - it is verified that many such problems are FPT when parameterized by n or tw, and it is demonstrated that FPT algorithms for MaxSTP are indeed possible but with other parameters such as k + vc.
J. Fichte, Johanna Groven, Peter Jonsson et al.
· Proceedings of the Thirty-Fi... · 0 citations
Aug 2026
Cedar: A Columnar LSM-Engine for Temporal Property Graphs
Interactions among real-world entities can be modeled using temporal graphs, which evolve dynamically over time. Ensuring efficient storage and queries in graph databases is challenging. In this paper, we design and demonstrate Cedar, an LSM-tree-based columnar engine for temporal graphs. Firstly, Cedar unifies vertice...
Yang Wang, Xue-Lian Lin, Jing-He Song et al.
· Proceedings of the VLDB Endo... · 0 citations
Preprint
Aug 2026
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 proper...
Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro
· 0 citations
Book
Open access
Aug 2026
Efficient Simple Temporal Cycle Enumeration on Large Graphs with Lightweight Preprocessing
This work introduces a novel edge-centric framework that treats temporal edges as the core units of exploration and eliminates redundant temporal checks, and extends this framework to dynamic settings by introducing an efficient incremental update algorithm that selectively identifies affected paths only.
Qi Liang, Dian Ouyang, Kang Chen et al.
· Proceedings of the 32nd ACM... · 0 citations