GI-LBD - Artigos
Envíos recentes
-
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 ... -
TRGST: An enhanced generalized suffix tree for topological relations between paths
(Elsevier Ltd, 2024-11)[Abstract]: This paper introduces the TRGST data structure, which is designed to handle queries related to topological relations between paths represented as sequences of stops in a network. As an example, these paths could ... -
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
(Association for Computing Machinery (ACM), 2024-03-23)[Absctract]: 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 ... -
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 ... -
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 ...
