Metraipolis › archive › dc_a00264e6d692
The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats — arXiv:2609.16731
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16731
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T19:29:36.303Z
- SHA-256 of the archived text
d14105e2cb7d0a147aac7181ad246ce11ee61bb37a8f163667ea737485ec0293- Stable URL of this page
https://metraipolis.com/documento/dc_a00264e6d692
How to cite
The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats — arXiv:2609.16731 — arXiv (en), https://arxiv.org/abs/2609.16731 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a00264e6d692 (Metraipolis archive dc_a00264e6d692, sha256 d14105e2cb7d0a147aac7181ad246ce11ee61bb37a8f163667ea737485ec0293)
BibTeX
@misc{dca00264e6d692,
title = {The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats — arXiv:2609.16731},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16731},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a00264e6d692; sha256 d14105e2cb7d0a147aac7181ad246ce11ee61bb37a8f163667ea737485ec0293},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16731. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Random access into compressed data is normally bought with density. We measure the exchange rate. Across four formats and nine axes on a common corpus, the cost of cutting a 254 MB archive into independently addressable 16 KiB units is 1.632% of the archive for an absolute-offset format against 6.57% for seekable zstd, and the gap widens as the unit shrinks: at 4 KiB, 5.33% against 10.06%. Because the cost is small, several properties follow that are usually unavailable: splitting an archive is free and occasionally profitable (-0.28% on tiled input), append needs no format change, seek latency does not depend on position, and one archive is read by both a CPU and a GPU decoder. We give three structural results with proofs and bit-perfect verification - that the repeat-distance chain of an LZ77 parse forms a substitution monoid and is therefore prefix-scannable without touching the bitstream, that self-overlapping matches are periodic rather than chained, and that dependency depth admits an encoder-enforced bound - and we report each measured limit together with the mechanism that sets it. Seventeen rejected directions are listed with their numbers, including one that improved density by 26% and was declined. Every claim carries a level: reproducible by command, measured with a stated reason, or estimated. The measurement tool is released separately (DOI https://doi.org/10.5281/zenodo.22713364 ) with 435 provenanced records. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-16 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.16731 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T18:35:05.424Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).