ListarGI-LBD - Congresos, conferencias, etc. por tema "Compact data structures"

Mostrando ítems 1-3 de 3

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

    • Revisiting Compact RDF Stores Based on k2-Trees 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio (IEEE Xplore, 2020-03)
      [Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary ...

    • Tool for SPARQL Querying over Compact RDF Representations 

      Ramos-Vidal, Delfina; Bernardo, Guillermo de (MDPI, 2021)
      [Abstract] We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve ...