3 citations · 3 across the 3 of their papers we have counts for
4 papers
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…