Listar GI-LBD - Artigos por título

Mostrando ítems 40-49 de 49

    • Scalable processing and autocovariance computation of big functional data 

      Brisaboa, Nieves R.; Cao, Ricardo; Paramá, José R.; Silva-Coira, Fernando (John Wiley & Sons, 2018)
      [Abstract]: This paper presents 2 main contributions. The first is a compact representation of huge sets of functional data or trajectories of continuous-time stochastic processes, which allows keeping the data always ...

    • Space-Efficient Representations of Raster Time Series 

      Silva-Coira, Fernando; Paramá, José R.; Bernardo, Guillermo de; Seco, Diego (Elsevier, 2021)
      [Abstract] Raster time series, a.k.a. temporal rasters, are collections of rasters covering the same region at consecutive timestamps. These data have been used in many different applications ranging from weather forecast ...

    • Space/time-efficient RDF stores based on circular suffix sorting 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Navarro, Gonzalo (Springer Nature, 2023-03)
      [Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed ...

    • Stronger compact representations of object trajectories 

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

    • Succinct Encoding of Binary Strings Representing Triangulations 

      Fuentes Sepúlveda, José; Seco, Diego; Viaña, Raquel (Springer, 2021-11)
      [Abstract]: We consider the problem of designing a succinct data structure for representing the connectivity of planar triangulations. The main result is a new succinct encoding achieving the information-theory optimal ...

    • Take one for the team: on the time efficiency of application-level buffer-aided relaying in edge cloud communication 

      Li, Zheng; Millar-Bilbao, Francisco; Rojas-Durán, Gonzalo; Ladra, Susana (Springer, 2021-03-12)
      [Abstract] Background Adding buffers to networks is part of the fundamental advance in data communication. Since edge cloud computing is based on the heterogeneous collaboration network model in a federated environment, ...

    • The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space 

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

    • TRGST: An enhanced generalized suffix tree for topological relations between paths 

      Quijada Fuentes, Carlos; Rodríguez, M. Andrea; Seco, Diego (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 ...

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

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