Listar GI-LBD - Artigos por título

Mostrando ítems 45-49 de 49

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