9 citations · 12 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…