Re: Compress prune/freeze records with Delta Frame of Reference algorithm
Andrey Borodin <x4mmm@yandex-team.ru>
From: Andrey Borodin <x4mmm@yandex-team.ru>
To: Evgeny Voropaev <evgeny.voropaev@tantorlabs.com>
Cc: PostgreSQL Hackers <pgsql-hackers@postgresql.org>
Date: 2026-03-15T17:53:14Z
Lists: pgsql-hackers
> On 7 Mar 2026, at 18:56, Evgeny Voropaev <evgeny.voropaev@tantorlabs.com> wrote: > > Looking forward to discussion! Great idea and nice library for DFoR! Prune/freeze records can be large, and reducing their size would help streaming replication a lot. The algorithm itself (Delta Frame of Reference bit-packing) is sound for sorted integer sequences. Eventually we will have wholesale WAL compression, but proposed here type of compression is more perspective for particular case, because it exploits knowledge about nature of compressed data. The patchset is, obviously, a prototype that worth working on further. Perhaps, first thing to start is to fix CI failures [0]. I do not know if we can budle LGPL lib. Luckily it's only for tests, when all design questions are resolved we can just re-implement tests with something else. As a minor nit: do not use stdlib assert(), use capital Assert() :) Are we 100% sure qsort() won't allocate something anywhere? sort_template.h seems to be allocation-free, but just in case... Best regards, Andrey Borodin. [0] https://github.com/x4m/postgres_g/runs/67140025428
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Fix a set of typos and grammar issues across the tree
- d3bba0415435 19 (unreleased) cited