Compact and queryable representation of raster datasets
Susana Ladra, José Ramón Paramá, Fernando Silva‐Coira · 2016
Compact data structures combine in a unique data structure a compressed representation of the data and the structures to access such data. The target is to be able to manage data directly in compressed form, and in this way, to keep data always compressed, even in main memory. With this, we obtain two benefits: we can manage larger datasets in main memory and we take advantage of a better usage of the memory hierarchy.