Publicación:
MAP ALGEBRA ALGORITHMS OVER RASTER DATA STORED IN THE K2-RASTER COMPACT DATA STRUCTURE

Imagen por defecto
Fecha
2023
Título de la revista
ISSN de la revista
Título del volumen
Editor
2022 41ST INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC)
Proyectos de investigación
Unidades organizativas
Número de la revista
Resumen
ABSTRACT?WE REPORT EFFICIENT ALGORITHMS TO COMPUTE THE MAP ALGEBRA OPERATIONS THRESHOLDING, SUM/MULTIPLICATION BY A SCALAR, POINT-WISE SUM, AND ZONAL SUM OVER RASTER DATA STORED IN MAIN MEMORY ON THE COMPACT DATA STRUCTURE K2-RASTER. RASTER DATA CORRESPOND TO NUMERICAL DATA, SUCH AS TEMPERATURE AND ELEVATION MEASURES RELATED TO SPATIAL OBJECTS LIKE CITIES, COUNTRIES, AMONG OTHERS. IN GENERAL, SPATIAL DATA CAN BE VERY LARGE, AND THEREFORE, THEY CAN BE STORED IN MAIN MEMORY IN COMPACT DATA STRUCTURES, WHICH ALLOW EFFICIENT DATA STORAGE AND QUERY THE DATA IN THEIR COMPRESSED FORM. ACCORDING TO THE LITERATURE, THE K2-RASTER IS THE BEST COMPACT DATA STRUCTURE TO HANDLE RASTER DATA, AND IT CORRESPONDS TO A K2 -TREE THAT STORES THE MAXIMUM AND MINIMUM VALUES FOR EACH INTERNAL NODE. WE THEORETICALLY SHOW THAT MAP ALGEBRA OPERATIONS CAN BE COMPUTED EFFICIENTLY USING A K2-RASTER COMPACT DATA STRUCTURE. IN FACT, MOST OF THE MAP ALGEBRA OPERATIONS HAVE A THEORETICAL EXPECTED TIME EQUIVALENT TO THE TIME OF TRAVERSING THE STRUCTURE.
Descripción
Palabras clave
Spatial databases, Raster Data, Map algebra operations, Geographic Information Systems (GIS), data structures, Algorithms
Citación
Colecciones