https://hackerpaper.kaipfister.de/p/2508.02280/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:27:26 GMThttps://news.ycombinator.com/item?id=44952603urn:hackerpapers:submission:2508.02280:44952603Tue, 19 Aug 2025 15:20:26 GMT<p>Show HN: OnPair – String compression with fast random access (Rust, C++)</p><p>I’ve been working on a compression algorithm for fast random access to individual strings in large collections. The problem came up when working with large in-memory database columns (emails, URLs, product titles, etc.), where low-latency point queries are essential. With short strings, LZ77-based compressors don’t perform well. Block compression helps, but block size forces a trade-off between ratio and access speed. Some existing options: - BPE: good ratios, but slow and memory-heavy - FSST (discussed here: https://news.ycombinator.com/item?id=41489047): very fast, but weaker compression…</p><p>6 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2508.02280/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DB