Buscar
Mostrando ítems 1-5 de 5
Improved Compressed String Dictionaries
(ACM, 2019-11-03)
[Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ...
Tool for SPARQL Querying over Compact RDF Representations
(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 ...
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 ...
A New Method to Index and Store Spatio-Temporal Data
(2016-11-16)
[Abstract] We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, ...
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 ...