Map algebra on raster datasets represented by compact data structures
Use este enlace para citar
http://hdl.handle.net/2183/33371
A non ser que se indique outra cousa, a licenza do ítem descríbese como Atribución 4.0 Internacional (CC BY 4.0)
Coleccións
- GI-LBD - Artigos [34]
Metadatos
Mostrar o rexistro completo do ítemTítulo
Map algebra on raster datasets represented by compact data structuresData
2023-06Cita bibliográfica
F. Silva-Coira, J.R. Paramá & S. Ladra, "Map algebra on raster datasets represented by compact data structures", Software - Practice and Experience, 53(6), pp. 1362-1390, 2023. doi:10.1002/spe.3191
Resumo
[Abstract]: The increase in the size of data repositories has forced the design of new computing paradigms to be able to process large volumes of data in a reasonable amount of time. One of them is in-memory computing, which advocates storing all the data in main memory to avoid the disk I/O bottleneck. Compression is one of the key technologies for this approach. For raster data, a compact data structure, called (Formula presented.) -raster, have been recently been proposed. It compresses raster maps while still supporting fast retrieval of a given datum or a portion of the data directly from the compressed data. (Formula presented.) -raster's original work introduced several queries in which it was superior to competitors. However, to be used as the basis of an in-memory system for raster data, it is mandatory to demonstrate its efficiency when performing more complex operations such as the map algebra operators. In this work, we present the algorithms to run a set of these operators directly on (Formula presented.) -raster without a decompression procedure.
Palabras chave
Compression
Map algebra
Raster maps
Map algebra
Raster maps
Descrición
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG
Versión do editor
Dereitos
Atribución 4.0 Internacional (CC BY 4.0)