4 papers
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…
Optimal Joins using Compact Data Structures
Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma
Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count with several algorithms that are optimal in the worst case, and many of t…
Computing Coverage Kernels Under Restricted Settings
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
We consider the Minimum Coverage Kernel problem: given a set of -dimensional boxes, find a subset of of minimum size covering the same region as . This problem is $\m…
Depth Distribution in High Dimensions
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set of axis aligned boxes, whose computation gene…