4 papers
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…
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…
Engineering Rank/Select Data Structures for Large-Alphabet Strings
Diego Arroyuelo, Gabriel Carmona, Héctor Larrañaga +3
Large-alphabet strings are common in scenarios such as information retrieval and natural-language processing. The efficient storage and processing of such strings usually introduce…
Evaluating Regular Path Queries on Compressed Adjacency Matrices
Diego Arroyuelo, Adrián Gómez-Brandón, Gonzalo Navarro
Regular Path Queries (RPQs), which are essentially regular expressions to be matched against the labels of paths in labeled graphs, are at the core of graph database query language…