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