Mostrando ítems 6-10 de 49

    • Optimizing RPQs over a compact graph representation 

      Arroyuelo, Diego; Gómez-Brandón, Adrián; Hogan, Aidan; Navarro, Gonzalo; Rojas-Ledesma, Javiel (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 

      Bernardo, Guillermo de; Gagie, Travis; Ladra, Susana; Navarro, Gonzalo; Seco, Diego (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 

      Brisaboa, Nieves R.; Gagie, Travis; Gómez-Brandón, Adrián; Navarro, Gonzalo (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 

      Fuentes Sepúlveda, José; Navarro, Gonzalo; Seco, Diego (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 ...
    • Compact representations of spatial hierarchical structures with support for topological queries 

      Fuentes Sepúlveda, José; Gatica, Diego; Navarro, Gonzalo; Rodríguez, M. Andrea; Seco, Diego (Elsevier Inc., 2023-06)
      [Abstract]: Among different spatial data models, the topological model for spatial regions explicitly represents common boundaries. This model pursues the efficiency of topology-related queries and the elimination of data ...