Listar OpenAIRE por autor "Navarro, Gonzalo"

Mostrando ítems 1-12 de 12

    • A succinct data structure for self-indexing ternary relations 

      Álvarez García, Sandra; Bernardo, Guillermo de; Brisaboa, Nieves R.; Navarro, Gonzalo (Elsevier BV, 2016-10-27)
      [Abstract] The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary ...

    • Aggregated 2D range queries on clustered points 

      Bernardo, Guillermo de; Konow, Bernardo; Navarro, Gonzalo; Brisaboa, Nieves R.; Seco, Diego (Elsevier Ltd, 2016-09)
      [Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. ...

    • Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes 

      Fariña, Antonio; Gagie, Travis; Manzini, Giovanni; Navarro, Gonzalo; Ordóñez, Alberto (Springer, 2016-09-21)
      [Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...

    • Efficient Representation of Multidimensional Data over Hierarchical Domains 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; López López, Narciso; Navarro, Gonzalo; Penabad, Miguel R.; Silva-Coira, Fernando (Springer, 2016-09-21)
      [Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ...

    • Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication 

      Francisco, Alexandre P.; Gagie, Travis; Ladra, Susana; Navarro, Gonzalo (IEEE Computer Society, 2018-03)
      [Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...

    • 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 ...

    • GraCT: A Grammar Based Compressed Representation of Trajectories 

      Brisaboa, Nieves R.; Gómez-Brandón, Adrián; Navarro, Gonzalo; Paramá, José R. (Springer, 2016-09-21)
      [Abstract] We present a compressed data structure to store free trajectories of moving objects (ships over the sea, for example) allowing spatio-temporal queries. Our method, GraCT, uses a k2k2 -tree to store the absolute ...

    • GraCT: A Grammar-based Compressed Index for Trajectory Data 

      Brisaboa, Nieves R.; Gómez-Brandón, Adrián; Navarro, Gonzalo; Paramá, José R. (Elsevier Ltd, 2019)
      [Abstract]: We introduce a compressed data structure for the storage of free trajectories of moving objects that efficiently supports various spatio-temporal queries. Our structure, dubbed GraCT, stores the absolute positions ...

    • Grammar compressed sequences with rank/select support 

      Ordóñez, Alberto; Navarro, Gonzalo; Brisaboa, Nieves R. (Elsevier BV, 2016-10-14)
      [Abstract] Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need ...

    • Improved Compressed String Dictionaries 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Navarro, Gonzalo (ACM, 2019-11-03)
      [Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ...

    • 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 ...

    • Universal indexes for highly repetitive document collections 

      Claude, Francisco; Fariña, Antonio; Martínez Prieto, Miguel A.; Navarro, Gonzalo (Elsevier Ltd, 2016-11)
      [Abstract] Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are ...