Ladra, Susana; Paramá, José R.; Silva-Coira, Fernando(The Computer Journal, 2017)
Compact data structures are storage structures that combine a compressed represen-
tation of the data and the access mechanisms for retrieving individual data without the
need of decompressing from the beginning. The ...
We present a new compressed representation of free trajec
tories of moving objects. It combines a partial-sums-based structure that
retrieves in constant time the position of the object at any instant, with a
hierarchical ...
Rodríguez Brisaboa, Nieves; De Bernardo, Guillermo; Gutiérrez, Gilberto; Ladra, Susana; Penabad, Miguel R.; A. Troncoso, Brunny(2015 Data Compression Conference, 2015)
k2-trees have been proved successful to represent in a very compact way different
kinds of binary relations, such as web graphs, RDFs or raster data. In order to be a
fully functional succinct representation for these ...
Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories
of versioned documents, among other applications. These collections may reach huge sizes, but are formed
mostly ...