Treffer: Efficient computation of map algebra over raster data stored in the k2-acc compact data structure.

We present efficient algorithms to compute simple and complex map algebra operations over raster data stored in main memory, using the k²-acc compact data structure. Raster data correspond to numerical data that represent attributes of spatial objects, such as temperature or elevation measures. Compact data structures allow efficient data storage in main memory and query them in their compressed form. A k²-acc is a set of k²-trees, one for every distinct numeric value in the raster matrix. We demonstrate that map algebra operations can be computed efficiently using this compact data structure. In fact, some map algebra operations perform over five orders of magnitude faster compared with algorithms working over uncompressed datasets. [ABSTRACT FROM AUTHOR]

Copyright of GeoInformatica is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)