Laboratorio de Bases de Datos (LBD): Envíos recentes
Mostrando ítems 31-35 de 76
-
Towards a Compact Representation of Temporal Rasters
(Springer Nature, 2018-09)[Abstract]: Big research efforts have been devoted to efficiently manage spatio-temporal data. However, most works focused on vectorial data, and much less, on raster data. This work presents a new representation for raster ... -
Managing Compressed Structured Text
(Springer Nature, 2018-12-07)[Definition]: Compressing structured text is the problem of creating a reduced-space representation from which the original data can be re-created exactly. Compared to plain text compression, the goal is to take advantage ... -
Revisiting Compact RDF Stores Based on k2-Trees
(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 ... -
Compressed and queryable self-indexes for RDF archives
(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 ... -
Space/time-efficient RDF stores based on circular suffix sorting
(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 ...