• 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 ...
    • Compressed and queryable self-indexes for RDF archives 

      Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Fernández, Javier D.; Martínez-Prieto, Miguel A. (Springer Nature, 2023-08)
      [Abstract]: RDF compression and querying are consolidated topics in the Web of Data, with a plethora of solutions to efficiently store and query static datasets. However, as RDF data changes along time, it becomes necessary ...
    • 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 ...
    • 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 ...
    • 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 ...