Laboratorio de Bases de Datos (LBD): Recent submissions
Now showing items 11-15 of 76
-
Stronger compact representations of object trajectories
(Taylor & Francis, 2024-02-13)[Absctract]: GraCT and ContaCT were the first compressed data structures to represent object trajectories, demonstrating that it was possible to use orders of magnitude less space than classical indexes while staying ... -
Optimizing RPQs over a compact graph representation
(Springer, 2023-09-07)[Absctract]: We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (e.g., RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query over a ring: a compact ... -
Faster compressed quadtrees
(Elsevier B.V., 2023-02)[Abstract]: Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using O(1) bits per node can break this bound ... -
Two-Dimensional Block Trees
(Oxford University Press, 2024-01)[Absctract]: The Block Tree is a data structure for representing repetitive sequences in compressed space, which reaches space comparable with that of Lempel–Ziv compression while retaining fast direct access to any position ... -
Navigating planar topologies in near-optimal space and time
(Elsevier B.V., 2023-02)[Abstract]: We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that ...
