Buscar
Mostrando ítems 1-4 de 4
Efficient Representation of Multidimensional Data over Hierarchical Domains
(Springer, 2016-09-21)
[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ...
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 ...
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 ...
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 ...