9 citations · 12 across the 7 of their papers we have counts for
9 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…
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…
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…
Trie-Compressed Intersectable Sets
Diego Arroyuelo, Juan Pablo Castillo
We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set of elem…
Time- and Space-Efficient Regular Path Queries on Graphs
Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro +1
We introduce a time- and space-efficient technique to solve regularpath queries over labeled graphs. We combine a bit-parallel simula-tion of the Glushkov automaton of the regular…
MillenniumDB: A Persistent, Open-Source, Graph Database
Domagoj Vrgoc, Carlos Rojas, Renzo Angles +7
In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we ca…
Faster Dynamic Compressed d-ary Relations
Diego Arroyuelo, Guillermo de Bernardo, Travis Gagie +1
The -tree is a successful compact representation of binary relations that exhibit sparseness and/or clustering properties. It can be extended to dimensions, where it is ca…
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
A. Arroyuelo, F. Claude, S. Maneth +5
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate…