Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

Duong Hoang, Brian Summa, Pavol Klacansky, Will Usher, Harsh Bhatia, Peter Lindstrom, Peer-Timo Bremer, Valerio Pascucci

View presentation:2020-10-29T19:15:00ZGMT-0600Change your timezone on the schedule page
2020-10-29T19:15:00Z
Exemplar figure
We propose an efficient and flexible data layout for scalar field data
Fast forward

Direct link to video on YouTube: https://youtu.be/4V6r8RUlrX4

Keywords

Scalar Field Data, Large-Scale Data Techniques, Multi-Resolution and Level of Detail Techniques, Data Compression

Abstract

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cutes correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp, IDX, and JPEG2000. Finally, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible, orders of magnitude faster, and requires significant fewer resources.