OpenZL: Using Graphs to Compress Smaller and Faster
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917479684505600 |
|---|---|
| author | Collet, Yann Terrell, Nick Handte, W. Felix Rozenblit, Danielle Zhang, Victor Zhang, Kevin Goldschlag, Yaelle Lee, Jennifer Gorokhovsky, Elliot Komornik, Yonatan Riegel, Daniel Angelov, Stan Rotem, Nadav |
| author_facet | Collet, Yann Terrell, Nick Handte, W. Felix Rozenblit, Danielle Zhang, Victor Zhang, Kevin Goldschlag, Yaelle Lee, Jennifer Gorokhovsky, Elliot Komornik, Yonatan Riegel, Daniel Angelov, Stan Rotem, Nadav |
| contents | In the last few decades, research techniques have improved lossless compression ratios by significantly increasing processing time. However, these techniques have not gained popularity in industry because production systems require high throughput and low resource utilization. Instead, real world improvements in compression are increasingly realized by building application-specific compressors which can exploit knowledge about the structure and semantics of the data being compressed. Application-specific compressor systems outperform even the best generic compressors, but these techniques have severe drawbacks -- they are inherently limited in applicability, are hard to develop, and are difficult to maintain and deploy. In this work, we show that these challenges can be overcome with a new compression strategy. We propose the "graph model" of compression, a new theoretical framework for representing compression as a directed acyclic graph of modular codecs. OpenZL implements this framework and compresses data into a self-describing wire format, any configuration of which can be decompressed by a universal decoder. OpenZL's design enables rapid development of application-specific compressors with minimal code. Experimental results demonstrate that OpenZL achieves superior compression ratios and speeds compared to state-of-the-art general-purpose compressors on a variety of real-world datasets. Compared to ratio-focused deep-learning compressors, OpenZL is competitive on ratio while being many orders of magnitude faster. Internal deployments at Meta have also shown consistent improvements in size and/or speed, with development timelines reduced from months to days. OpenZL thus represents a significant advance in practical, scalable, and maintainable data compression for modern data-intensive applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_09928 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | OpenZL: Using Graphs to Compress Smaller and Faster Collet, Yann Terrell, Nick Handte, W. Felix Rozenblit, Danielle Zhang, Victor Zhang, Kevin Goldschlag, Yaelle Lee, Jennifer Gorokhovsky, Elliot Komornik, Yonatan Riegel, Daniel Angelov, Stan Rotem, Nadav Information Retrieval Databases In the last few decades, research techniques have improved lossless compression ratios by significantly increasing processing time. However, these techniques have not gained popularity in industry because production systems require high throughput and low resource utilization. Instead, real world improvements in compression are increasingly realized by building application-specific compressors which can exploit knowledge about the structure and semantics of the data being compressed. Application-specific compressor systems outperform even the best generic compressors, but these techniques have severe drawbacks -- they are inherently limited in applicability, are hard to develop, and are difficult to maintain and deploy. In this work, we show that these challenges can be overcome with a new compression strategy. We propose the "graph model" of compression, a new theoretical framework for representing compression as a directed acyclic graph of modular codecs. OpenZL implements this framework and compresses data into a self-describing wire format, any configuration of which can be decompressed by a universal decoder. OpenZL's design enables rapid development of application-specific compressors with minimal code. Experimental results demonstrate that OpenZL achieves superior compression ratios and speeds compared to state-of-the-art general-purpose compressors on a variety of real-world datasets. Compared to ratio-focused deep-learning compressors, OpenZL is competitive on ratio while being many orders of magnitude faster. Internal deployments at Meta have also shown consistent improvements in size and/or speed, with development timelines reduced from months to days. OpenZL thus represents a significant advance in practical, scalable, and maintainable data compression for modern data-intensive applications. |
| title | OpenZL: Using Graphs to Compress Smaller and Faster |
| topic | Information Retrieval Databases |
| url | https://arxiv.org/abs/2605.09928 |