Javiel Rojas-Ledesma
YOU?
Author Swipe
View article: The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space Open
We present an indexing scheme for triple-based graphs that supports join queries in worst-case optimal (wco) time within compact space. This scheme, called a ring , regards each triple as a cyclic string of length 3. Each rotation of the t…
View article: Size Bounds and Algorithms for Conjunctive Regular Path Queries
Size Bounds and Algorithms for Conjunctive Regular Path Queries Open
Conjunctive regular path queries (CRPQs) are one of the core classes of queries over graph databases. They are join intensive, inheriting their structure from the relational setting, but they also allow arbitrary length paths to connect po…
View article: Datasets of Time- and Space-Efficient Regular Path Queries
Datasets of Time- and Space-Efficient Regular Path Queries Open
Datasets that were used in the experiments of our work Time- and Space-Efficient Regular Path Queries.
View article: Datasets of Time- and Space-Efficient Regular Path Queries
Datasets of Time- and Space-Efficient Regular Path Queries Open
Datasets that were used in the experiments of our work Time- and Space-Efficient Regular Path Queries.
View article: Time- and Space-Efficient Regular Path Queries on Graphs
Time- and Space-Efficient Regular Path Queries on Graphs Open
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 expression with thering index introduced by Arroyuelo et al…
View article: Predecessor Search
Predecessor Search Open
The predecessor problem is a key component of the fundamental sorting-and-searching core of algorithmic problems. While binary search is the optimal solution in the comparison model, more realistic machine models on integer sets open the d…
View article: Computing coverage kernels under restricted settings
Computing coverage kernels under restricted settings Open
View article: Optimal Joins using Compact Data Structures
Optimal Joins using Compact Data Structures Open
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 them have been implemented and validated in practice. Howeve…
View article: Computing Coverage Kernels Under Restricted Settings
Computing Coverage Kernels Under Restricted Settings Open
We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, the problem bec…
View article: Depth Distribution in High Dimensions
Depth Distribution in High Dimensions Open
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set $\mathcal{B}$ of axis aligned boxes, whose computation generalizes that of the Klee's Measure and of the Maximum Depth…
View article: Depth Distribution in High Dimensions
Depth Distribution in High Dimensions Open
View article: Matching colored points with rectangles
Matching colored points with rectangles Open
View article: Adaptive Computation of the Klee's Measure in High Dimensions
Adaptive Computation of the Klee's Measure in High Dimensions Open
The KLEE'S MESURE of $n$ axis-parallel boxes in $\mathbb{R}^d$ is the volume of their union. It can be computed in time within $O(n^{d/2})$ in the worst case. We describe three techniques to boost its computation: one based on some type of…