3 papers
cs.DB2026
Uplifting the Superpowers of Worst-Case-Optimal Join Algorithms
Adrián Gómez-Brandón, Adrián Gómez-Brandón, Aidan Hogan +1
Worst-case-optimal (wco) join algorithms have demonstrated their power -- in both theory and practice -- to efficiently solve complex Basic Graph Patterns (BGPs). Modern graph quer…
cs.DB2026
Worst-Case Optimal BGPs on Temporal Graphs
Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro +1
We study how to evaluate basic graph patterns (BGPs) in a worst-case-optimal (wco) manner over {\em temporal} labeled graphs, where edges have an interval of temporal validity. We…
cs.DB2024
New Compressed Indices for Multijoins on Graph Databases
Diego Arroyuelo, Fabrizio Barisione, Antonio Fariña +2
A recent surprising result in the implementation of worst-case-optimal (wco) multijoins in graph databases (specifically, basic graph patterns) is that they can be supported on gra…