postgres=# select * from sessions where video_id = 'YL31cf9Q1VM';
Compression improvements
Explore compression paths and possible improvements.
session summary
The session began by designing an overflow hash table for pg_stat_statements and pg_stat_kcache so new query IDs would not block behind a busy main table; races and merge semantics made it unsuitable for an immediate patch. Discussion then shifted to compression throughout Postgres. Per-column dictionaries were judged invasive, while reusing compression context during B-tree WAL logging looked tractable. They examined pglz and LZ4 stream constraints and concluded that B-tree builds should first batch pages like GiST; no code was written.
timecodes
- Revisiting pg_stat_kcache lock contention
- An overflow hash table for delayed query IDs
- Duplicate entries and merge races
- From statistics contention to compression
- Column dictionaries and system-wide dictionaries
- Reusing context for B-tree full-page images
- Why appending to compressed streams is difficult
- B-tree WAL batching becomes the prerequisite