DBMS Weekly — 2026-10-26 (week of Oct 26–Nov 1)
A family of checkpoint races found by one reporter dominated the lists: ROLLBACK PREPARED never set DELAY_CHKPT_START, so a rolled-back prepared transaction can come back after a crash and then be committed, and the same WAL-before-file pattern turns up in multixact creation, CLOG truncation and hash-index bucket allocation. A standby rewound with pg_rewind can keep hint bits from its old timeline and disagree with the primary about which rows exist. Fifteen fixes landed in released branches, among them the real fix for the parameterized-Append wrong results from two issues ago, the incremental-backup merge-order data loss, and a TOAST index that went stale across REINDEX CONCURRENTLY. Andres Freund restated his wish to delete hash indexes while Greg Burd posted patches that make them insert as fast as btree and shrink URL btrees by two thirds; the CommitFest's last week before closing took in 64 entries, the most since tracking began. On the blogs, Radim Marek measured what dropping a 4 TB table really costs (the standby freezes replay for the unlink, and the first SELECT after a mass delete wrote 151 GB of WAL on 18), Nikolay Samokhvalov found a 1,400× gap between "restored" and "usable", OrioleDB entered public beta with a public benchmark, Timescale replaced DeltaDelta with six per-block encodings, MariaDB fixed a 3× in-memory regression that dated back to 10.5, ClickHouse shipped a DPsub join orderer with a conflict detector for outer joins, and Jepsen found 96 issues in a database that claimed TLA+ proofs.
PostgreSQL
- Getting rid of a 4 TB table in PostgreSQL — what DROP, DELETE and the aftermath actually cost, measured on 18.6 with checksums on, three rigs (laptop, Hetzner primary + streaming replica, GCE n2-standard-32 with 16 local NVMe), prompted by a GitLab question at PGConf.EU. (Radim Marek · boringsql.com)
- DROP TABLE of a 9 GB table is 81,737 bytes of WAL; the costs are the lock queue (an AccessExclusiveLock waiter blocks every later SELECT, and dropping an FK child locks the parent too), the Standby/LOCK record that makes the startup process cancel readers after
max_standby_streaming_delay, and the unlink — on the standby the startup process does it, so replay stalled for 11 of the 15.9 s a 192 GB drop took - cold unlink on ext4 is ~17 ms per 1 GB segment (1 TB: 18.5 s); the same 1 TB table on XFS dropped in 80 ms, because segments written by 28 parallel appenders had 1,760–4,785 extents on ext4 vs 2–14 on XFS;
vmtouch -efirst brings a 100 GB drop to 0.77 s - batched DELETE of 90% of 540 M rows: 36 min, 229 GB of WAL, the replica 38 s behind; then the first SELECT wrote 151 GB of WAL in 41 minutes — with checksums (18's default) hint-bit and prune writes log full pages (959,025
FPI_FOR_HINT); checksums off cut the laptop's post-delete count(*) from 7,850 MB to 173 MB of WAL,wal_compression = zstdto 1,458 MB; copying the 10% keepers into a new table wrote 882 MB
- DROP TABLE of a 9 GB table is 81,737 bytes of WAL; the costs are the lock queue (an AccessExclusiveLock waiter blocks every later SELECT, and dropping an FK child locks the parent too), the Standby/LOCK record that makes the startup process cancel readers after
- Dump/restore done. Now what? — a 250 M-row join on 18.6 took 32.6 s right after
pg_restore(no statistics: Hash Join over Seq Scan), 6.1 s after ANALYZE (Index Only Scan with 24,983 heap fetches, since the visibility map is empty) and 23 ms after VACUUM ANALYZE.pg_dump --statistics(18+) importsrelallvisiblefor all 4,098,361 pages while the new VM is empty. On 19rc1 the first SELECT itself set 4,098,360 VM bits through on-access pruning: 110 s instead of 32.6, every heap block dirtied, ~31 GiB of WAL shipped to every standby — after which ANALYZE alone sufficed. A plain VACUUM after restore on 19rc1 froze every page; on 18.6 it froze none. (Nikolay Samokhvalov · postgres.ai) - OrioleDB public beta and DBArena — the table access method (undo log instead of dead tuples, 64-bit XIDs for its tables, index-organized tables, no buffer mapping, copy-on-write checkpoints with row-level WAL) is now a public beta on OrioleDB beta19 over Postgres 17.11, explicitly not for production. The numbers come from DBArena, a Supabase-funded public benchmark of hosted Postgres (Supabase heap, Supabase + OrioleDB, RDS, Cloud SQL; seven tiers from 2 vCPU/2 GiB to 32 vCPU/128 GiB; TPC-C-derived; 30-min warm-up, 60-min runs, median of three fresh environments; 62 results from 750+ runs with a
result.jsonper run and open tooling). With data at 4× RAM, OrioleDB had the best tpm/$ at every size and ~1.8× heap's throughput at 8XL (113,850 tpm); in memory the gap is +13% at Large and heap wins at Small. Limits: no PITR, no CLUSTER/VACUUM FULL, non-btree indexes through an "experimental bridge", SERIALIZABLE takes a table lock by default. (Aditya Maruvada, Daniel Mitterdorfer, Alexander Korotkov, Artur Zakirov · supabase.com)[vendor blog — substantive][unverified: vendor-sponsored benchmark] - Adaptive Integer Compression in TimescaleDB — DeltaDelta + Simple8bRLE assumed one smooth sensor stream; on three interleaved streams it spends 7.49 bytes per value (94% of raw). AIC picks one of six encodings per block of ≤256 values (FOR, PFOR, strided-delta, DICT, RLE, DELTA_RLE) with a SIMD analyser and a tiered FastLanes bit-packer (8–256-bit virtual registers, since batches are ≤1,000 values): 1.88 bytes per value on the same example, integer columns ~50% smaller, decompression 5–7× faster. A detail worth stealing: the smallest AIC blob is under 24 bytes (
MAXALIGN(TOAST_POINTER_SIZE)), so it stays in the heap row where DeltaDelta's 40-byte minimum was TOASTed — a filtered count went 52.5 → 11.9 ms, 56% of it the TOAST fetch that no longer happens. Off by default in 2.31.0 (timescaledb.enable_aic_compression). (David Beck · tigerdata.com)[vendor blog — substantive] - Designing a planned switchover for minimum disruption — how Neki moves a Postgres primary without a clean shutdown: routers buffer primary-bound queries, the primary gets
default_transaction_read_only, its LSN is sampled, a candidate that has flushed past it is picked, the other replicas are disconnected and their final receive LSNs recorded, and the candidate replays to the maximum. Synchronous replication isANY 1 (…), so once the others are gone nothing can be acknowledged without the candidate; after promotion at least one replica must rejoin the sync set or the switchover rolls back by reloading the old primary read-write. (Shlomi Noach · planetscale.com)[vendor blog — substantive] - Splitting the read-only transaction: replica reads inside an open transaction — Polar Proxy keeps the transaction open on the primary but sends eligible SELECTs to a replica: READ COMMITTED only, top-level, no locking clause, no SET before the first write, and only when the backend reports no unflushed WAL of its own. A patched libpq appends a marker byte to ReadyForQuery —
xsplittable plus the transaction's XID list,wWAL pending — at zero extra round trips (compare CF #7415 from the 10-12 issue); the replica getsSET polar_xact_split_xids, a strict consistency mode and a wait-for-LSN before the query, and stays pinned for the transaction. No performance numbers. (Vadim Iatsenko · awide.tech)[vendor blog — substantive]- Zero-copy I/O for the shared storage daemon: the whole main shared-memory segment is backed by one
memfdmapped MAP_SHARED before fork and registered with pfsd once, so WAL buffers, shared buffers and SLRU pages are written in place instead of copied into the daemon's pool; misaligned pointers fall back to the copy
- Zero-copy I/O for the shared storage daemon: the whole main shared-memory segment is backed by one
- 1M durable workflows/sec on sharded Postgres — 50 RDS db.m7i.4xlarge shards behind PgDog, 2,400 worker processes, no-op workflows; the finding is that past 8–16 shards throughput was metastable: a slow shard (a big VACUUM) drew more pollers,
FOR UPDATE SKIP LOCKEDdequeues scanned past more locked rows, queries took seconds and millions of rows sat locked, never recovering. A few per-shard advisory "dequeue locks" fixed it — a process that can't get one moves to the next shard. (Peter Kraft · dbos.dev)[vendor blog — substantive][unverified: self-reported throughput] - Programming at Light Speed: building the Gravity query engine — the JIT behind last week's ClickBench story: Postgres plan → pipeline graph → Lisp IR → assembly (TPDE), compiling in under 1 ms and running within 10–20% of hand-written Rust used as the "speed of light" target. Three planner algorithms built on granule min/max metadata (ZoneWalk for ORDER BY LIMIT, ZoneTopK for GROUP BY LIMIT, TwoPass for GROUP BY ORDER BY count LIMIT) and three of 100+ IR optimisations: inlining 238 built-ins (AVG 392 → 120 instructions/row), LIKE evaluated once per dictionary entry into a cached bitmap (
pgrust.dict_filter_cache=offdisables it), run-collapse in registers (100 M-row GROUP BY → 22 M hash probes). Claims up to 3× ClickHouse and >1,000× PG17 on c6a.4xlarge; a fuzzer varies types and shapes per optimisation to avoid overfitting the corpus. Thomas Neumann's reply is in Wider DBMS below. (Michael Malis · malisper.me)[unverified: self-reported multipliers; code largely LLM-written] - How a read replica almost took down its primary database — production at ~2,500 req/s and ~10 TB: a backfill outran a BI replica and the WAL retained for its slot grew from ~5 GB to 31.7 TB, auto-growth took the disk to ~43 TB against a 60 TB limit, and shrinking it afterwards needed downtime (
max_slot_wal_keep_sizenow, applied at checkpoints); a new table's FK to the busiest table queued behind an anti-wraparound autovacuum that would not yield, writes queued behind the DDL and rollback pods could not connect — sub-secondlock_timeoutwith bounded retries since ("lock_timeout bounds waiting, not how long an acquired lock is held"). (photoroom.com) - SQL vs PL/pgSQL in PostgreSQL: plan caching — on 16.15, a one-line
LANGUAGE sqlfunction aroundregexp_matches(set-returning, so not inlined) called 10 M times from a PL/pgSQL loop viaSELECT … INTOcost 46–48 s of CPU; the identical body as PL/pgSQL 24.4 s;pg_stat_statementswithtrack_planningshowed 10,000,000 plans vs 6, because before 18 SQL functions were re-planned on every call from a non-assignment statement. Rewriting withregexp_matchmade it inlinable: 11.9 s. 18's plan cache for SQL-language functions closes the gap. (Dinesh Kumar · cortexridge.com) - PostGIS 3.7.0 — major release, PostgreSQL 14–19, GEOS 3.10+ (3.15 for everything). (Regina Obe · postgis.net)
- breaking: PG 12/13 dropped;
address_standardizerandpostgis_tiger_geocodermoved to their own repositories; topology functions read tolerance 0 literally (−1 = topology precision);ST_MemCollectremoved; ST_GeoHash round-trips through ST_GeomFromGeoHash - engine side: geometry/geography btree support functions marked leakproof;
ST_OrderingEqualsjoins can now use hash and merge joins; modules built with-fno-semantic-interposition(ST_Collect ~4% faster on PG18);ST_DWithincachesGEOSPreparedDistance; GiST tuned for repeated topology edge subdivision - new:
ST_IsSimpleDetail,ST_CoverageEdges,ST_MinimumSpanningTreewindow function, NURBS curves, curved rings inST_MakePolygon,GDT_Float16rasters, shp2pgsql UNLOGGED and--if-not-exists
- breaking: PG 12/13 dropped;
- Introducing pg_pinecone — an Apache-2.0 extension that indexes existing pgvector columns with IVF + RaBitQ (~1 bit per dimension) instead of a graph. 1 M × 768-d vectors on r6id.4xlarge: index 136 MB vs 2.0 GB (HNSW halfvec) / 4.1 GB (HNSW vector); p50 at 0.99 recall 2.3 vs 4.7 / 6.7 ms. The second half sells the hosted engine. (Harshita Daddala, Anthony Mahanna · pinecone.io)
[vendor blog][unverified: self-reported; filtered-search comparison not checked against pgvector's iterative scans] - AI functions reach the SQL standard — a first-hand report from the 13 October ISO/IEC JTC1 SC32 WG3 meeting: an
AI_GENERATEfunction (prompt → registered model) was accepted into SQL/Foundation, and a discussion paper with Peter Eisentraut proposes how to specify model-inference functions — model references, error conditions, determinism, and an error rather than a ranking when vectors from two embedding models meet. (Bilge Ince · enterprisedb.com) - Releases on pgsql-announce — six with real changes; three product launches were dropped. (pgsql-announce)
- PostgreSQL Anonymizer 3.3 fixes 12 CVEs: masked roles could read real data through SQL-standard-body functions,
pg_stats,security_invokerviews, subqueries and cached plans; the salt was readable inpg_db_role_setting; dynamic masking skipped inherited tables; data-modifying CTEs bypassed read-only. New restrictions: no subqueries in masking rules, function inlining off for transparent dynamic masking, masked roles cannot execute SQL-standard-body functions (citext and earthdistance included); rotateanon.salt - pgAdmin 4 v9.19 — 136 fixes including 15 CVEs: OS command injection via
TO PROGRAMsmuggled past the\copyguard (the CVE-2026-17566 fix was incomplete), LDAP/Kerberos logging a user into another account with the same username, path escapes exposing other users' credentials, TOCTOU races in the file manager;SERVER_PASSEXEC_COMMANDSallowlist replaces free-text password commands - E-Maj 5.0.1 — fixes a privilege escalation to superuser present in every earlier version; PG 14–19
- pg_ivm 1.17 —
restore_immv()gets areplaceoption andpg_ivm_dump_metadataa--pg-upgradeoption (restoring IMMVs after pg_upgrade failed on leftover entries); fixesrestore_immv()leavingispopulated=falseso a later refresh added duplicate IVM triggers and maintained the view incorrectly; unique keys now derived from the original view definition; fixes a crash during index creation with LATERAL subqueries - HypoPG 1.4.4 — hypothetical indexes now invalidated on invalidation messages for dependent relations, functions, AMs, opclasses and types;
INCLUDEcolumns counted; a failed EXPLAIN no longer affects later queries; PG 19 fixes - pg_hdr_histogram 1.0.0 — new: an HDR histogram as a first-class type over HdrHistogram_c, exact-ish p50/p99/p99.9 at ~0.1% relative precision across six orders of magnitude, lossless merge across windows and hosts; parallel-safe
hdr_add/hdr_mergeaggregates, trusted[unverified: precision claim is the library's]
- PostgreSQL Anonymizer 3.3 fixes 12 CVEs: masked roles could read real data through SQL-standard-body functions,
PostgreSQL mailing lists
- [hackers] Racing in ROLLBACK PREPARED and checkpoint —
RecordTransactionAbortPrepared()never setDELAY_CHKPT_START(the commit path does). If a checkpoint's redo pointer lands between the abort record and the removal of the 2PC state file, and the host crashes before that removal is durable, recovery finds the file and the transaction is prepared again; COMMIT PREPARED then succeeds, so the WAL carries both a ROLLBACK and a COMMIT for one xid — a standby that replayed the abort trips an assertion in clog.c or silently marks it committed. Michael Paquier (Nov 2): at least as old as 2PC itself (2005), agrees with the fix, back-patch to 14. The same WAL-before-file pattern in three more places, from the same reporter: (Shihao Zhong; Michael Paquier · pgsql-hackers)[patch posted]- multixact creation: the CREATE_ID record is inserted before the SLRU pages are filled; a checkpoint in between and a crash leave a multixact with no members — "the old row version becomes visible again next to the new one" on a non-assert build. 15+; 14 needs the old
delayChkptflag[open] - CLOG truncation and hash bucket allocation:
vac_truncate_clog()truncates before advancingoldestXid, so after a crashpg_xact_status()on a removed XID errors instead of returning NULL and the next VACUUM does not repair it;_hash_alloc_buckets()logs the new splitpoint before extending the file, so a base backup taken in between yields a hash index that works until it needs an overflow page, then fails every insert with "access to noncontiguous page" until REINDEX. He says he audited the remaining WAL-then-file paths and found them safe[open] - related: 2pc gxact lsn race —
prepare_start_lsn/prepare_end_lsnare modified inCheckPointTwoPhase()without adequate locking; reproduced with injection points, one path is an assertion failure. (Maxim Orlov)[patch posted]
- multixact creation: the CREATE_ID record is inserted before the SLRU pages are filled; a checkpoint in between and a crash leave a multixact with no members — "the old row version becomes visible again next to the new one" on a non-assert build. 15+; 14 needs the old
- [bugs] pg_rewind and hint bits leads to visibility corruption — a standby sets hint bits without dirtying the page, but replay can dirty the same page and the hints reach disk;
pg_rewindcopies only blocks touched by the diverging WAL, so a rewound standby keeps hint bits from its old timeline. TAP repro with three nodes: a prepared transaction rolled back on the old primary and replayed on S2 (which writesHEAP_XMIN_INVALID), S1 promoted and committing it; after rewinding S2 from S1,count(*) WHERE id = 999999is 1 on S1 and 0 on S2. Reproduced on every supported branch; no developer reply by Sunday. (Tom Pang; Sebastian Webber · pgsql-bugs)[open] - [hackers] [PG19] NOT NULL constraint is trusted by snapshots older than it — add a NOT NULL
NOT VALID, have a REPEATABLE READ session count the NULLs, fill them in another session andVALIDATE: the first session now counts 0,SELECT id, a, bshows column b's values in column a, andSELECT *fails with "invalid memory alloc", because the planner (e2debb64380), the tuple-deform fast path (c456e391138) and JIT deforming trust the constraint as soon as it is committed. Proposed fix: store the newest NOT NULL's xmin in the relcache and use it only when the active snapshot sees it, indcheckxmin-style. The report says JIT has trustedattnotnullsince 11, which would make 18 and older wrong too with JIT on. (Shihao Zhong · pgsql-hackers)[patch posted][unverified: the pre-19 JIT claim has no committer confirmation yet] - [committers] Wrong results fixed in released branches this week — (Richard Guo, John Naylor, David Rowley, Andrew Dunstan · pgsql-committers)
[committed]- Don't replace clone clauses with constant TRUE (16+):
reconsider_outer_join_clauses()replacedOUTERVAR = INNERVARwith TRUE after derivingINNERVAR = CONST, but a clone made for outer-join identity 3 can be applied above the join after OUTERVAR was null-extended — inner rows joined to null-extended rows. Same root as #19765, a chain of LEFT JOINs wrong since v16, reported by Viktor Leis; thenorm_selec = 2.0redundancy marker thatb448f1c8dremoved is back - Look through wrapper paths when collecting enforced clause serials (5 branches): the real fix for the parameterized-Append bug from the 10-05 and 10-19 issues — Material, Memoize, Projection, Sort and Agg inherit their subpath's
ParamPathInfo, socreate_nestloop_path()dropped a join clause as "already enforced" - Fix nestloop parameter assignment for PHVs evaluated above outer joins (18+): the antijoin wrong results;
ph_eval_atcan include outer-join relids that required-outer sets never do. 16 and 17 can fail the same way and are deliberately left alone — adding join-order restrictions "could change plans that work today" - Check all four box corners in SP-GiST quad tree <@ search (14+): one corner tested twice and one never (
xreset instead ofy), so a box edge within EPSILON of the centroid could skip a quadrant — index scan 0 rows, seqscan 1. First of three fuzzing finds Naylor promised - 19: sorted GROUPING SETS (#19783 from last week — the eight-at-a-time deform refreshed
tts_isnulland lost the forced NULLs), eager aggregation running a volatile join clause once per group, ENFORCED on a parent CHECK over a NOT VALID child (constraint exclusion could skip the child's violating rows), and the hash_mem cap onBuildTupleHashTablebuckets reinstated (#19759: a plain EXPLAIN of a recursive query could ask for 2^32 buckets) - 18+: NOT NULL NO INHERIT constraints disallowed on partitioned tables —
CREATE TABLE (LIKE …) PARTITION BYcopied one, so partitions could hold NULLs; the commit message carries the detection query - just after the window: a hashed SubPlan referenced twice reused a stale hash table (13–19; an EXISTS duplicated by OR-qual extraction;
OFFSET 0was the workaround) and Memoize returning different results than without (bug #17213's successor: only the nestloop Params that replace outer Vars go intokeyparamids) were pushed on Monday morning, back to 14. Within an hour Fujii Masao reported, via Codex, a query that now errors with Memoize on. The Memoize nondeterministic-collation bug turned out to date from 14 and moved from the PG19 open items to "older bugs"
- Don't replace clone clauses with constant TRUE (16+):
- [hackers] Two bugs in reconsider_full_join_clause() — a randomized join generator Tomas Vondra built to test join-order patches found two long-standing planner assertions:
reconsider_full_join_clause()assumes leftvar comes from the left input (acoalesce(r4.t4_id, r2.id) = 21501over a FULL JOIN says otherwise), and a gap in a798660ebe3's defence against bogus parameterizations — it checks onlysjinfo->ojrelid, but identity-3 pushdowns add more OJ relids (16+). Both he and Tender Wang note the back-branch ABI problem and propose a minimalbms_overlapcheck intry_*_path(). (Tomas Vondra; Tender Wang · pgsql-hackers)[patch posted] - [bugs] BUG #19800: self-join elimination drops an ORDER BY key under GROUPING SETS — SJE (new in 18) rewrites the removed relation's Vars onto the kept one, so
ORDER BY s1.a, s2.abecomes two members of one EC and the second is dropped as redundant — but grouping sets emit NULLs per set, so the members are not equal and the output order changes with SJE on vs off (18.6, master). Tender Wang agrees it is a correctness bug. Four more planner internal errors from the same fuzzing push: (chunling qin, Alperen Keles, Gowtham Reddy; Tender Wang, Haibo Yan, Tom Lane, David Rowley · pgsql-bugs)[open]- #19799 SJE + nested LATERAL → "failed to build any 3-way joins"; a narrow patch exists and Haibo Yan found a case it misses
[patch posted]; #19798 ROLLUP over a LATERAL subquery referencing the nullable side → "failed to build any 4-way joins" (has_join_restriction()is false for a joinrel)[open] - #19804
count(DISTINCT a.x+1)over a parallel join:find_computable_ec_member()makesb.ylook computable from the Gather tlist and adds a resjunk column the subplan does not return. Tom Lane revisits9f954177's reasoning and suggests the caller specify the available input[patch posted] - #19803
add_paths_to_append_rel()read a child's partial pathlist without checkingconsider_parallel— fixed back to 14[committed]; #19802 MERGE into a partitioned table with a scalar subquery in SET → "SubPlan found with no parent plan", one-line fix[patch posted] - dependencies assertion with two clauses on one statistics expression — Rowley committed the fix without the submitted comment, "the typical sort of AI-talking-about-the-code-that-was-removed type comment"
[committed]
- #19799 SJE + nested LATERAL → "failed to build any 3-way joins"; a narrow patch exists and Haibo Yan found a case it misses
- [hackers] WAL record CRC calculated incorrectly because of underlying buffer modification — hash indexes register pin-only bucket pages with
REGBUF_NO_CHANGE; underwal_consistency_checkingan FPI is taken of a page another backend may be modifying, and standbys fail with "incorrect resource manager data checksum". The workaround not taking FPIs for such buffers is committed to 17+. The debate is the news: Andres Freund — "pretty much unacceptable for a niche index like hash to violate the rules… we should have just ripped them out… Ceterum censeo index access/hash esse delendum"; Jeff Davis: the bar for recommending hash is now very high; Paquier set a three-step plan (workaround, fix hash, then deleteREGBUF_NO_CHANGEand restore the assertion). Greg Burd took step two — a rework that logs the bucket block in the record's main data and takes a cleanup lock in redo (precedent: nbtree pin scans before9f83468b353) — and separately posted two more hash-index patches: (Greg Burd; Michael Paquier, Andres Freund, Jeff Davis, Amit Kapila · pgsql-hackers)[committed]+[patch posted]- Hash index inserts serialise on the metapage tuple counter: every
_hash_doinsert()takes an exclusive lock on the metapage to bumphashm_ntuples. v2 takes a conditional lock and batches the count only once contended (worst-case undercount 1.4%, VACUUM recomputes it): single-row INSERT on c7i.24xlarge at 16/32/64/128/256 clients, master 388k/140k/81k/61k/50k TPS → 528k/638k/685k/675k/686k, parity with btree (514k/648k…). v1 had a hole David Geier found: per-backend pending counts died with the backend, so afterpgbench -Cntuples said 487 of 200,000 and splits never happened[patch posted] - the nbtree prefix-compression patch is this week's CommitFest standout below
- Hash index inserts serialise on the metapage tuple counter: every
- [hackers] Backups: the incremental-backup fixes landed — (Fujii Masao, Michael Paquier, David Steele, Peter Eisentraut; Shihao Zhong, Manu, Heikki Linnakangas, Noah Misch · pgsql-hackers/-committers)
[committed]- Nov 1, 17+: #19774's merge-order data loss (WAL summaries merged in
readdir()order) and summaries that ran past a timeline switch; Zhong notes one case still open (a recovery target not at a checkpoint redo point) with Manu's second patch; #19776 (truncation_block_lengthignored for a middle backup) has a new entry in PG20-4 - Avoid torn copy of the control file in base backups (15+; 14 left out as "going EOL soon"): pg_control is read under
ControlFileLockand the in-memory copy sent. Two SPARC buildfarm members then crashed in BASE_BACKUP (alignment) and got apalloc0workaround on Oct 29. Heikki asked why the hint to removebackup_labelstill exists — because snapshot backups still write it into PGDATA - replaced files no longer sent truncated or zero-padded (15+;
fstat()after open for non-relation files), 2PC state files written via temp file + rename (14+; a crash or base backup mid-write left "incorrect size of file"), and pg_combinebackup rejects out-of-range block numbers (17+; a 0xFFFFFFFF block number indexed zero-length arrays, reported through Trend ZDI) - #19760 CLUSTER/REPACK row loss, 14+: the hint-bit fix is in; Robert Haas: "pretty questionable that we rely on hint bits being set for correctness… action-at-a-distance". Manu's second-spot patch was withdrawn after Paquier called it "piling workarounds on top of workarounds", and he then showed a case no hint bit can fix —
VACUUM FULL pg_classloses a long-committed table's row when the subtransaction that updated it aborts mid-rewrite — proposing to stop passing dead tuples to rewriteheap.c altogether[open]
- Nov 1, 17+: #19774's merge-order data loss (WAL summaries merged in
- [committers] Fix stale pg_index flags in the relcache for TOAST indexes —
RelationReloadIndexInfo()skipped re-reading mutable pg_index fields for "system" relations, which includes a user table's TOAST index; a backend with the TOAST index open during REINDEX CONCURRENTLY keptindisready=falsefor the new index and wrote no chunks into it — "missing chunk number 0 for toast value N" once the old index is dropped (chunks still present; rebuilding the TOAST index repairs it). 14+. Also from the week: nbtree multi-level page deletion re-read stale sibling links after relocking, producing corrupted half-dead leaf pages on standbys (7 branches); two crashes on a concurrently dropped schema (14+). (Michael Paquier, Bharath Rupireddy; Peter Geoghegan; Heikki Linnakangas · pgsql-committers)[committed] - [hackers] Standby stuck after walreceiver restart just before a WAL segment boundary — if the walreceiver restarts while the last received record ends 8, 16 or 24 bytes before a segment end,
RequestXLogStreaming()rounds the restart position to a segment start and resumes at the next segment, so the tail is never fetched: "invalid record length at 0/04FFFFF8: expected at least 24, got 0" forever, and sinceb614de4876the walreceiver waits instead of failing, so it hangs silently. All branches; patch plus TAP test. (David Shorten · pgsql-hackers)[patch posted] - [hackers] Corruption: missing tts_tid in ExecForceStoreHeapTuple — KNN GiST reorder-queue scans lose the
ctid; withFOR UPDATEthe invalid TID reachesheap_lock_tuple(), whereInvalidBlockNumber == P_NEWmakesReadBuffer()extend the relation on disk before erroring, leaving an orphaned uninitialised block ("invalid page in block N" on later scans). 14+; Nathan Bossart staged the fix for commit. Two more pre-minor-release pings from Andrey Borodin:verify_heapam()does not detect theHEAP_XMIN_INVALID-on-committed-xmin corruption left by the snapshot-export bug ("observed in production"), and SERIALIZABLE committing write skew after SSI summarization — once ~1,400 short serializable transactions exhaust the SERIALIZABLEXACT array and a committed transaction's SIREAD locks fold intoOldCommittedSxact,CheckTargetForConflictsIn()ignores them; dates to 9.1, now Ready for Committer. (Virender Singla, Nathan Bossart; Andrey Borodin, Jacob Brazeal, Aleksander Alekseev · pgsql-hackers)[patch posted] - [bugs] BUG #19411: libpq 16.x leaks memory when connections are repeatedly created and destroyed — blamed on psycopg2 in February, back in October with the real condition: GSSAPI authentication (not encryption).
pg_GSS_continue()acquired credentials on every round trip and overwrote the previous handle; ~17.8 kB leaked per connection with MIT krb5. Tom Lane also found it acquiring credentials regardless ofgssdelegationand settingGSS_C_DELEG_FLAGwithout any; his fix takes retained memory from 17,844 to 94 bytes per connection, 16+. (Matt Carter; Tom Lane, Jacob Champion · pgsql-bugs)[committed] - [bugs] BUG #19795: pgoutput walsender crashes on a START_REPLICATION option without a value —
pg_recvlogical -o proto_version(no value) dereferenced NULL in the walsender and the postmaster restarted every session; any role with REPLICATION suffices. Fixed Nov 1 down to 14 (Paquier: "I regret missing that during … 290bb8afe6b4"). A sibling report: START_REPLICATION silently truncated an overlong LSN component (123456789/0parsed as23456789/00000000), with the same%X/%08Xpattern inreadTimeLineHistory()andread_backup_label(); master only. (Brar Piening, Zhijie Hou, Hayato Kuroda; Michael Paquier, Fujii Masao · pgsql-bugs)[committed] - [bugs] BUG #19796: io_uring rings overlap with specific liburing versions — last week's PANIC explained: Postgres lays out one ring per backend in a single shared buffer at the size
io_uring_queue_init_mem()reports, and before liburing 2.7 that size omits the 64-byteio_ringsheader, so rings overlap. Andres Freund: error out on buggy liburings or pad; v2 pads 64 bytes for < 2.7. The WaitIO deadlock (#19792) hit two independent 18.6 clusters after four months on io_uring and is not reproduced yet. (Alexander Lakhin, Andrey Rachitskiy; Andres Freund · pgsql-bugs)[patch posted] - [bugs] postgres_fdw returns wrong rows for age(timestamptz, timestamptz) filters —
age()is IMMUTABLE but converts to local time first (UTC: "1 mon 1 day"; New York: "29 days"), so the FDW ships it and the remote evaluates it in GMT. Tom Lane: marking it STABLE is right, "if we try not to then we will invent kluges"; master-only patch, with a release-note warning for indexes and partition keys on it. Fujii Masao lists 13 more IMMUTABLE functions whose result depends on TimeZone through abbreviations like LMT —timezone(text, …),date_truncwith a zone,date_add,generate_serieswith a zone, thejsonb_path_*functions withtzand the@?/@@operators — "I'm concerned about the impact". Continues last week's STABLE-marking commit. (Gaurav Singh; Tom Lane, Laurenz Albe, Fujii Masao · pgsql-bugs)[patch posted] - [bugs] pg_trgm: GiST index scan misses rows at the default word_similarity_threshold — the defaults are float4 literals stored in doubles (
0.6f→ 0.6000000238); leaves compute similarity in float4 (3/5 passes) but the inner-page branch ofgtrgm_consistentdivides in float8 (0.59999999999999998 fails), so a subtree with rows exactly at the threshold is pruned. Only at the default; GIN unaffected; 17.9 and master. (Eric Laquer; Kirill Reshke · pgsql-bugs)[open] - [bugs] BUG #19817: CREATE UNIQUE INDEX on a partitioned table silently attaches an invalid child index —
DefineIndex()reuses an "equivalent" partition index without checkingindisvalid/indisready, so an index left invalid by a failed CREATE INDEX CONCURRENTLY is attached, the parent is created invalid, the command reports success, and the UNIQUE constraint enforces nothing. Long-standing; Dilip Kumar's patch skips invalid partition indexes asAttachPartitionEnsureIndexes()already does. (chunling qin; Dilip Kumar · pgsql-bugs)[patch posted] - [bugs] BUG #19812: wrong results and integrity issues with virtual generated columns — three self-contained cases on 18.6: INSERT accepts a value violating a bare virtual column's typmod (
varchar(3)over 'abcdef' is stored and every later read errors); AFTER ROW triggers and transition tables see NULL for a virtual column, and a transition-table WHERE on it raises XX000;DROP EXPRESSIONon one parent of a multiply-inheriting child makes the child's column non-generated. No reply yet. (chunling qin · pgsql-bugs)[open][unverified] - [hackers] O(N³) planning time in choose_plan_name() since 8c49a484e8e — 19's unique-subplan-name commit: a 4,000-arm UNION plans in 17.6 s on 19 vs 15 ms on 18, and 2× slower from 100–200 arms. The v1 fix truncated dynahash keys at 74 bytes, so an 80-byte alias made a non-assert build loop forever ignoring cancel; v2 with per-base-name counters: 21 ms. Tom Lane found v2 "complicated and not clearly correct"; v5 is simplified. (Manu; Ayoub Kazar, Andres Freund, Tom Lane · pgsql-hackers)
[patch posted] - [hackers] Let's drop support for named POSIX semaphores — they were only ever for macOS, SysV has been preferred there since 2002, and meson cannot even select them. The thread turned into the semaphore roadmap: Andres — "we really aren't using semaphores in a way that benefits from them being semaphores", pointing at Thomas Munro's
pg_futexbranch using macOS 14.4'sos_sync_wait_on_address(); Greg Burd lists cross-process futexes on Linux, the BSDs and macOS and sketches a spinlock + proclist fallback for Windows, Solaris and AIX; Peter Eisentraut worries about sandboxing work that wants to drop SysV IPC. (Tom Lane; Heikki Linnakangas, Andres Freund, Greg Burd, Peter Eisentraut · pgsql-hackers)[patch posted] - [hackers] improving handling of FPIs during recovery prefetching — after last week's outage post, Vondra reads it as two issues: prefetch does not skip blocks that follow a full-page image, inflating IOPS, and after a walreceiver exit the standby applies everything received before streaming resumes, so syncrep stalls. Jeremy Schneider's local repro (
systemd-run MemoryMax=256M, scale-40 pgbench) shows the amplification even withfull_page_writes=off: afadvise(WILLNEED)per 8 kB block defeats Linux readahead. Thomas Munro and Zhong: the proper fix is moving the prefetcher onto read_stream/AIO, which needs multiple streams since WAL mixes relations. The skip-FPI patch is reviewed; the stale-record prefetcher bug from last week has three LGTMs and no commit yet. (Tomas Vondra; Jeremy Schneider, Shihao Zhong, Thomas Munro · pgsql-hackers)[patch posted] - [hackers] pg_stat_statements: WITH HOLD cursors stored as un-normalised top-level entries — a cursor query starts at nesting level 1 inside DECLARE but a WITH HOLD cursor finishes at COMMIT at level 0, so the literal text landed as a top-level entry (and a SET ROLE in between attributed it to the wrong user). Rather than a pgss-specific field, Paquier added a generic per-extension state facility on
QueryDesc(e5d5d1ad1e3a, like ExplainState's), master only. Tom Lane, on a list of jumbling gaps (XML names, ROLLUP/CUBE, VARIADIC): "there is not one of these things that deserves the label of bug". Also:pg_stat_waldouble-counts WAL from parallel workers since 14 — the worker's ownpgWalUsageplus the leader'sInstrAccumParallelQuerycopy both reach stats. (Sami Imseih, Michael Paquier, Tom Lane; Lukas Fittl, Bertrand Drouvot · pgsql-bugs/-hackers)[committed]/[patch posted] - [hackers] Parallel vacuum: workers together with leader could overrun cost budget — v3 caps the sleep at
Min(vacuum_cost_delay × 4 × nworkers, 1000); against a 100k units/s budget master spent 152k/243k at PARALLEL 2/8, v2 90k/97k. Back-patch extent still open. (Bharath Rupireddy; Masahiko Sawada, Surya Poondla · pgsql-hackers)[patch posted] - [hackers] PG19 release management — RC2 is due 12 November. (Bruce Momjian, Masahiko Sawada, Jeff Davis, Heikki Linnakangas; Shihao Zhong · pgsql-hackers)
- First draft of PG 19 release notes: several fixes came from Zhong's "local multi-agent LLM system" that tested commits between 18.6 and 19 and flagged 20–30 potential issues (
io_workersreplaced by four GUCs, not three;pg_stat_progress_repackadded). Bruce: "I would like to have this happen for every major release"; Zhong is "considering building an agent system for the community… Linux already has Sashiko" - pg_upgrade --check passes, then the upgrade fails: Sawada first narrowed it to 19-specific checks, then doubted even that is worth it (18's bytea↔int casts had the same gap and no reports); Zhong wants only the
standard_conforming_stringscheck, because45762084545promised transparency[open] - indexes from 18 that miss rows after pg_upgrade: Jeff Davis committed release notes for tsearch and pg_trgm and closed the open item, declining a pg_upgrade check that "will bloat pg_upgrade with fairly complex queries that will only get exercised during one cycle… false sense of security"
[resolved: docs] - pg_upgrade doesn't copy ICU rules on template0: since 16
set_locale_and_encoding()copies template0's locale fields but missesdaticurules; Heikki asks why template0 carries any of these at all[patch posted] - NOT IN → anti-join with a user-defined implicit cast returning NULL (last week's report) is confirmed as a 19 regression from
383eb21ebff; suggested fix keeps the anti-join for built-in casts only[patch posted]
- First draft of PG 19 release notes: several fixes came from Zhong's "local multi-agent LLM system" that tested commits between 18.6 and 19 and flagged 20–30 potential issues (
- [hackers] PoC: true in-place major version upgrades (follow-up) — Robert Haas: "pg_upgrade is a pretty half-baked version of upgrade-in-place… But I suspect this proposal is not the way… If you can make this work with every catalog change we've had in the last 7 years, then maybe"; Nathan Bossart has "witnessed or heard about many attempts… not convinced it's viable" and floats dump/restore while the old cluster keeps running. Naylor concedes he fleshed out the wrong part. (John Naylor; Robert Haas, Nathan Bossart · pgsql-hackers)
[open] - Shorter — (pgsql-hackers/-bugs)
- ZSTD TOAST compression with an extensible method encoding: v12 fixes an lz4-only build and a dictionary "evolution" that swallowed cancels; Hannu Krosing: "0001–0003 look quite close to committable"
[patch posted] - Incorrect selectivity for NOT on nullable boolean columns:
NOT bestimated as 1 − sel(b) ignoring NULLs (8,000 estimated vs 1,000 actual at 70% NULLs)[RfC]; hash a ScalarArrayOpExpr whose array is a Param —= ANY($1)in a generic plan stays O(rows × N) since 14, "the slowdown tends to appear only after a statement has run a few times"[patch posted] - JSON_TABLE with sublinks in PASSING (#19786, 17+) fixed; auditing for siblings, Amit Langote found multi-row INSERT broken by a sublink in a target subscript —
transformSubLink()modifies the raw node in place and the indirection is transformed once per VALUES row[committed]/[patch posted] - btree_gist 'infinity' into a GiST index on date: Tom Lane — the distance between two same-sign infinities must be zero, or every infinity splits onto its own page;
gbt_float8_distthrows an overflow where it should return the infinite distance[patch posted] - policy answers: oidvector dedup on 18.6 — Tom: "we are not changing this in released branches… no good reason for user tables to contain oidvector columns"
[rejected]; stats-import probes — Paquier:pg_restore_attribute_stats()is a stats-injection feature; unless it crashes or trips an assertion, "if the planner goes crazy, there is nothing to do here"[rejected] - 19rc1's SNI test fails on OpenSSL 1.1.1 (configure's documented minimum): no alert mapping for
missing_extensionbefore 1.1.1o; Paquier would rather upgrade the buildfarm host — "everybody should be out of 1.1.1 these days"[open] - a BEFORE DELETE trigger that resets the plan cache mid-cascade: Langote replaced the hash table with a stack array and asked Vondra for a last look
[patch posted]
- ZSTD TOAST compression with an extensible method encoding: v12 fixes an lz4-only build and a dictionary "evolution" that swallowed cancels; Hannu Krosing: "0001–0003 look quite close to committable"
CommitFest (open: PG20-4, #63 · in progress: PG20-3, #62)
- Balance (Oct 26–Nov 1): 64 new · 20 closed (15 committed / 5 withdrawn) → net +44. (vs +10 last week; both complete counts: new entries from sequential patch IDs #7511–#7574, closures from the history of every patch in #61, #62 and #63.) The last week before PG20-3 closed to new entries produced the biggest intake since tracking began (previous high: 46 on 10-12). 13 entries moved to Ready for Committer, two of them filed this week. PG20-3 queue at scan: 415 needs review · 48 waiting on author · 116 ready for committer (579 active, up from 535); it went In Progress on 1 November, when PG20-4 opened with 2 entries. One filer produced 9 of the 64 entries (BUG-numbered fixes), Greg Burd 4 substantial internals patches. Seven of the 15 commits closed entries filed the same week.
- New this week: nbtree: opt-in leaf key prefix compression (Greg Burd) — a per-index storage parameter
prefix_compression: when a leaf page is written whole (build, split, dedup pass) and its items share leading bytes in the first key column, the page is rebuilt in aBTP_PREFIXformat with one PREFIX item and the shared bytes replaced by a one-byte length. No BTREE_VERSION bump — pages convert only when next rewritten, so old and new formats coexist and standbys and pg_upgrade need nothing; redo rebuilds the coded page from the logged plain items instead of forcing an FPI, with a fallback for a page whose decoded payload would exceed a block (now testable with an injection point, which immediately caught a palloc inside a critical section). c7i.4xlarge, URL index with a 37-byte shared prefix: 22,177 → 7,506 pages (−66%) on random inserts, 19,036 → 5,429 (−71%) ascending, WAL per transaction 292 → 226 B, TPS within noise; on 2 M near-duplicate keys only −8–10%, since deduplication already does the work. Read side on 3 M distinct URL keys: point lookups unchanged, index-onlyCOUNT(*)+6% and a 100k-key range scan +7% — decoding shows on traversal, not seeks, matching the SIGMOD front-coding paper Yao Feng cited (thread). Also new: Quickselect instead of a heap for ORDER BY … LIMIT N (#7565, Burd; keep ≤2N tuples and quickselect when full — 5 M int8 rows, LIMIT 1 M: 1,852 → 807 ms; John Naylor wants no GUC: "we should just switch"; supersedes withdrawn #7084; author says LLM-assisted), Hash index inserts serialise on the metapage tuple counter (#7531) and the WAL CRC rework (#7532), SERIALIZABLE can commit write skew after SSI summarization (#7551, Ready for Committer), UPDATE/DELETE FOR PORTION OF re-filed for 20 after the 19 revert (#7571, Paul Jungwirth), Let's drop support for named POSIX semaphores (#7513), Report buffer access strategies in EXPLAIN (#7530, Bertrand Drouvot), Add amnotifydelete, an index AM callback for deleted tuples (#7544), Fall back to serializing when parallel apply runs out of DSM segments (#7548), Standby stuck after walreceiver restart just before a WAL segment boundary (#7572), Fix pg_combinebackup with truncated intermediate incremental backups (#7573, the first PG20-4 entry). Last week's standouts have not moved: shrink sizeof(RelationData) (#7483) and Specialize ExecIndexOnlyScan() (#7468) are untouched, Batch TIDBitmap insertions (#7422) is still Ready for Committer; Fix rescan costing of single-batch hash joins (#7502) gained two reviewers. - Closed: committed: Avoid truncated or zero-padded copies of replaced files in backups (#7509), Incremental backup can use a summary past a timeline switch (#7515), Fix stale relcache fields for TOAST indexes during REINDEX CONCURRENTLY (#7543), START_REPLICATION silently truncates an overlong LSN component (#7495), pg_stat_statements: nested tracking for implicitly closed cursors (#6342, carried since PG19-4), Reduce logging during prepared transaction recovery (#7434), AT TIME ZONE and similar as a function in FROM do not read back (#7491), SQL/JSON DEFAULT ON ERROR/ON EMPTY should rethrow unconditionally (#7355), Return INT_MAX or INT_MIN from strtoint() on overflow (#7539), Fix error handling in pg_flush_data() and FilePrefetch() (#7555), and 5 PL/pgSQL, doc and cleanup entries. Withdrawn: Speed up COPY TO text/CSV parsing using SIMD (#6588, carried since PG20-1), a large LIMIT makes some sorts slower (#7084), Report pruning statistics in pg_stat_all_tables (#7298), XMLNAMESPACES COLLATE does not read back (#7492), one duplicate entry.
Community pulse
- Postgres 19 is late because so many more bugs are being found — Robert Haas's essay from the 10-19 issue, reposted on his own blog, drove the week's one big HN thread. The useful part is a comment by someone who spent a summer doing AI-assisted bug hunting on Postgres and reported "a dozen or two out of hundreds of candidates", listing the threads: write skew and duplicate primary keys under SERIALIZABLE, the SSI-summarization write skew now Ready for Committer (above), temporal FK validation of pre-existing rows, a lost lock during TOASTing allowing an FK violation, partition pruning wrongly excluding a RANGE default partition, and timestamp vs timestamptz ordering under DST, which he calls unfixable — and that the maintainers were "unflaggingly polite" throughout. The rest of the thread argues whether discovery or verification is now the bottleneck, with several readers misreading the post as "AI-written code delayed 19". (Hacker News · 297 pts, 196 comments)
- Egres: are Postgres's MVCC problems still real in 18? — the launch post (Wider DBMS below) drew the old argument with new numbers. The top reply says people complain about VACUUM, wraparound and process-per-connection because others do; the author cites Sentry, Adyen, Uber, OpenAI and the CMU MVCC paper and names two things still structural in 18 — an update to an unindexed column still writes a new tuple and touches every non-HOT index, and a replica must still choose between cancelling a long query and letting the primary bloat. Counter-reports: Adyen at ~50 TB and OpenAI on Postgres, a shop at 200 M transactions a day that ran its own vacuum planner beside autovacuum and never had a problem, wraparound a non-issue at ~100 M transactions a day with occasional repacks. (r/PostgreSQL · 19 pts, 15 comments)
- WAL file grew to 4 GB because our metrics scraper held a read transaction open for the whole scrape — a Prometheus exporter kept a SQLite read transaction open 2–3 s while streaming its response, so auto-checkpoints never completed and the WAL never truncated. Replies:
journal_size_limitcaps the file only after a checkpoint resets it and cannot fire while a reader holds a snapshot, so alert on WAL size and logwal_checkpoint's busy-frames return;synchronous=NORMALin WAL mode can lose a committed transaction on power loss. (r/sqlite · 10 pts, 6 comments)
Wider DBMS & distributed data
- Jepsen: ParticleDB 1.1.4 — Orkes' Rust store behind Conductor (Postgres and Redis wire protocols, "Full ACID, 159K TPS", "formally proven with TLA+" — no spec was ever produced). 96 issues, all but three on a healthy single node without faults: prepared statements broke pgjdbc,
SELECT 5 WHERE FALSEreturned a row,WHERE b = 5matched primary key 5, NOT NULL and UNIQUE did nothing, dropped tables re-emerged mangled, aborted transactions committed; every transaction mode showed every anomaly Elle can detect. By the last release candidate tested all but ten appeared resolved, yet the defaultoccmode still lost committed writes in normal operation andserializableallowed stale reads. Most were found by a newcompareworkload (generative SQL run against both ParticleDB and PostgreSQL), which Jepsen is extracting as a library. The discussion section is blunt about LLM-built databases: builds "simply materialized, sans changelogs", docs with fabricated class names, a default username and an email address for the report's author. On Lobsters (147 pts, 42 comments — the biggest database thread the site has had) Kingsbury added that Orkes had claimed to run Jepsen's existing Postgres suite; when he ran it "it started screaming about every possible kind of safety violation", that he found 10–20 serious bugs a week across several builds a week where an engagement normally yields a handful, and that fixes arrived by pasting the report into Codex — several reported fixed were not. Also on HN (347 pts, 194 comments). (Kyle Kingsbury · jepsen.io) - The new cost-based join optimizer with reordering support for non-inner joins — DPsub (bitmask subset enumeration, exhaustive to 10 tables, 12 with a setting, greedy above) replaces the greedy orderer as default in 26.10. The new part is a conflict detector after Moerkotte, Fender and Eich's "On the Correct and Complete Enumeration of the Core Search Space" (SIGMOD 2013): commutativity and associativity matrices over join types with null-rejection conditions as static tables, so LEFT, RIGHT, FULL, SEMI and ANTI joins enter the reorder graph instead of acting as barriers — the valid space at 7 tables grows 11.5×. Validation: every join tree for 3–5 tables across two operator sets, 2.8 M core plans, 0 invalid, 0 missing; 1,200 fuzzed queries, 0 mismatches. A
big ⋈ mid ⋉ tinyexample drops its largest intermediate from 503.8 M to 1.0 M rows; TPC-H Q2 −55%, Q5 −44%, TPC-DS Q73 −45%. (Fisnik Kastrati · clickhouse.com)[vendor blog — substantive] - The Benchmarking Crisis — Thomas Neumann on Goodhart's law and ClickBench, "heavily accelerated by today's use of AI code generation": pgrust aggregates string GROUP BYs on the hash alone, caches predicates repeated across queries, and for Q17 (LIMIT without ORDER BY on data clustered by userid) never reads most of the data. His requirements for a benchmark that means something: ad-hoc like TPC-H (no prior knowledge, no intermediate-result caching), an update stream, systems older than the benchmark — plus hidden test sets or rotating generated workloads. The comments carry the exchange: pgrust's author replies that all three optimisations are things ClickHouse does, with a salted 128-bit hash; Neumann: "a violation of the user contract… strings are potentially attacker controlled", and admits his own students pushed for group-by-hash and he refused. Andreas Kipf points at Redbench, which replays Redshift and Snowflake traces with realistic repetition. Lobsters: 11 pts, 9 comments. (Thomas Neumann · databasearchitects.blogspot.com)
- Egres: a Postgres-compatible database for heavy, multi-tenant workloads — a new engine in Zig by the Dgraph and Badger author, Apache 2.0, sharing nothing with Postgres but libpg_query: fiber-based execution with CPU ticks, memory and IOPS metered per query and tenant, an "LSM forest" store with block compression and MVCC, local disk or S3 with an NVMe cache, Raft with read-your-writes on any replica. Single node in this release, equality-only queries, no joins. Against PG 18 on 600 M rows / 580 GiB (Ryzen 5950X, 64 GiB cap each): disk 693 → 376 GiB, bytes written 3.0 → 2.3 TiB (no full-page writes), a two-index query p95 490 → 3.9 ms via bitmap-index intersection where Postgres had only single-column indexes; loading 13% slower, and Postgres faster when data fits in RAM and 33% faster at p95 on scattered rows (16 KiB vs 8 KiB blocks). (Manish R Jain · manishrjain.com)
[unverified: single-author benchmark; methodology page published] - Cassandra's Compaction Wars — episode 7 of the LSM series. STCS (default since 2011) needs 50% free disk for a top-tier merge and, when space runs out, drops the largest input — the oldest data; LCS "falls apart spectacularly once you get behind" (a code comment). Cassandra 5.0's Unified Compaction Strategy (CEP-26) makes tiered and leveled one algorithm with a different wait (T4 = STCS, L10 = LCS, Dayan's Dostoevsky continuum), picks the bucket with the highest overlap when behind, and uses density-based levels with fixed power-of-two shard boundaries so each merge needs room only for its own slice. The tombstone section: Discord 2017, 16 columns with 4 set per message → 12 tombstones each, a channel with one message left took 20 s to load; warn at 1,000, abort at 100,000 per query. (Renato Cron · blog.renatocron.com)
- Not so fast: equality deletes, compaction, and Iceberg V4 — the V4 draft (as of 22 October) forbids writing new equality deletes. The property that goes with them: a value-keyed delete survives compaction, because Spark's default gives rewritten files the starting snapshot's sequence number, so a delete committed during the rewrite still applies; a position delete or deletion vector for a file being rewritten cannot be mapped onto the output, the V3 validation rejects the commit, and the rewrite is redone. The cost side is real too — the Java reader loads applicable equality-delete keys into memory sets, so backlogs OOM compaction; their LakeOps batches delete files by sequence number within a memory budget. Checked against Iceberg 1.12.0. (Lakshmikant Shrinivas · starburst.io)
[vendor blog — substantive] - Valkey's next chapter: durability and beyond — the 10+ roadmap with issue numbers: synchronous replication (#3037 — the primary applies in memory, marks keys uncommitted and holds dependent responses until acks; replicas hide uncommitted writes), Cluster V2 on Raft (#3856 — full-mesh gossip costs ~5% CPU at ~1,000 idle nodes), data tiering (#3326), active-active (#512, last-writer-wins first). (Harkrishn Patro, Viktor Söderqvist, Crystal Pham · valkey.io)
- Meet GroeneAI, our autonomous contributor to ClickHouse — an agent that picks its own work from CI, fuzzer and user reports, reproduces, fixes, tests, opens PRs and answers reviews; more than 3,000 merged PRs since March, second by authored commits over the three months to 19 October. The worked example is a real cache bug: the query condition cache recorded "no matching rows" ranges computed after on-the-fly mutations and RLS were applied, so a later read without them skipped live rows. Context for the week's debates about machine-written patches. Separately, ClickHouse fixed an unauthenticated remote code execution (CVE-2026-116366) in 26.3.62.3, 26.8.36.3, 26.9.27.3 and 26.10.3.7; no details published. (James Cunningham, Artem Brustovetskii, Alex Soffronow Pagonidis · clickhouse.com)
[vendor blog][unverified: self-reported counts] - How Zig's libc rewrite made SQLite 12,000× slower — a Rust service cross-compiled with
cargo-zigbuild: Zig's pure-Zigstrspn/strcspn/strpbrkcallstrlenon the whole remaining string first, so SQLite's JSON tokeniser goes quadratic — a 1.2 MB JSON value tokenised ~12,000× slower, on Linux only. Your tokeniser's complexity depends on your libc. (Dennis Forbes · dennisforbes.ca)
Commercial engines (SQL Server, Oracle, MySQL, …)
- How MariaDB 11.8 became about 3× faster on some in-memory workloads, fixing a regression dating back to 10.5 — Mark Callaghan's MDEV-37992: 100-value IN-list PK lookups at 40 threads, 10.4.34 73,106 QPS vs 10.5.29 29,832 and 11.8.3 26,044. In 10.4
buf_page_peek_if_too_old()skipped LRU promotion entirely while eviction had never started; 10.5's page cleaner began tickingfreed_page_clockduring the load, so every old-page touch tookbuf_pool.mutexinbuf_page_make_young()— "pages made young" went from ~25k to 1.3–1.8 billion and context switches per query from 2.8 to 29.6 (10.8.8 was fast by accident: an undo-page leak kept the pool full). The fix takes no mutex at access time —touch()records the first access and sets a sticky PROMOTE bit; sweeps that already hold the mutex (page cleaner, eviction, flush batches) move flagged blocks, releasing it every 512 blocks;freed_page_clockis gone and the block descriptor is 8 bytes smaller. 2×Xeon Gold 6230R,/dev/shm: 10.4.34 52,410 QPS, 11.8 before 20,326, 11.8 with fix 57,052; hit ratio unchanged out of memory. The author compares it to Postgres's clock-sweepusage_count— "the same direction". In 11.8 and 12.3. (Alessandro Vetere, Marko Mäkelä · mariadb.org) - Oleg Smirnov on parallel query execution — MariaDB's in-development parallel query, unshipped and undated: the InnoDB clustered index root is read and one chunk per root entry (100–200) goes into a task queue; workers re-split a chunk one B-tree level down when imbalance appears, each joins, filters and aggregates into its own temp table, partial aggregates merge at the end. Finding: parallelising a plain in-memory scan buys almost nothing; the gains are in joins, filters and above all aggregation — a 100 M-row aggregation 20 s → ~10 s at 2 workers, a bit under 2× per doubling to 8; TPC-H Q3 and Q6 5–7×, Q1/Q2 shapes unsupported, no ORDER BY or window functions yet. (Simona Aleksandrova, Oleg Smirnov · mariadb.org)
- What MariaDB's plugin API can carry: the HyperLogLog case — a complete analytic feature as one
INSTALL SONAME: an HLL column type (pluggable data types, 2019), two aggregates through the new pluggable aggregate functions (Item_sum_plugin, MDEV-40672, official in 13.3, DISTINCT and FILTER per plugin) and six scalar functions. Exact to 256 distinct values, then 16,384 registers at ~0.81% standard error; byte-level merge is commutative, associative and idempotent. CompareCREATE AGGREGATEplus postgresql-hll. (Roman Nozdrin · mariadb.org) - Benchmarking vector search in six database engines — 990,000 × 1,536-d embeddings, HNSW M=16, k=10, Xeon Gold 6230: time to queryable — Percona Search for MongoDB 1.9 min, Valkey 4.3 min, pgvector 40.9 min (26.9 COPY + 14.0 parallel build), MariaDB 11.8 3.6 h, MariaDB 12.3 5.4 h, AliSQL 6.7 h (graph updated on every INSERT, 41–76 rows/s); index 3.9 GiB for the InnoDB engines (16-bit quantised copies) vs pgvector 7.6, Valkey 11.3, Percona Search 15.1. Single-client QPS at recall ≥ 0.99: MariaDB 12.3 277, Valkey 264, pgvector 210, AliSQL 126, MariaDB 11.8 46. At 32 clients pgvector 221 → 4,798 QPS (p99 10.8 ms); the MySQL-family concurrency numbers are withheld because the Python connector serialised the harness. Harness and raw runs published. (Evgeniy Patlan · percona.com)
[vendor blog — substantive] - innodump: extract data from InnoDB, MyISAM and MyRocks files without a running server — a new open-source offline reader (0.8.1), the MySQL sibling of last week's pg_walex. (Przemysław Malkowski · percona.com)
- reads a data directory, a single
.ibd, general or system tablespaces, MyISAM and MyRocks files; decodes the schema from SDI (8.0.33 example); emits SQL or MySQL-Shell TSV --skip-corruptedskips pages whose head and tail LSNs disagree and carries on; the author built it by directing an agent against the engines' source, and says plainly it is not a backup method
- reads a data directory, a single
- Why do only the legacy CE and compatibility level 170 estimate this unique filtered-index query correctly? — SQL Server 2025: the value lies past the histogram's end, so the modern cardinality estimator falls to the ascending-key calculator, and a bug in how it handles filtered statistics gives the bad estimate; the fix ships as a hotfix, on by default at compatibility level 170 (trace flag 2363 shows the calculator path). (Erik Darling · DBA Stack Exchange)
- MariaDB's bug tracker had a wrong-results week — of 153 MDEV bugs filed, eleven from one reporter are optimizer and partitioning wrong results: MDEV-41986 (an IN → equality rewrite with a COLLATE'd literal misses 'A' on a
utf8mb4_bincolumn), MDEV-41876 (hash join:'a' ≠ 'a 'on a PAD SPACE_bincollation), MDEV-41961 and 41879 (an index on DATE/DATETIME changesYEAR()/DATE()results), MDEV-41991 (partitioning by KEY on FLOAT:c = 0misses −0); and from a fuzzer account MDEV-41895:encrypt-binlog/encrypt-tmp-filessilently write plaintext when the key-management plugin returnsENCRYPTION_KEY_NOT_ENCRYPTED. (jira.mariadb.org)[unverified: tracker titles, not independently reproduced]
Migration experience
- The New York Times cut Oracle migration time from 18 to 5 months — the subscription revenue engine, Oracle (~200 licensed CPUs) → Aurora PostgreSQL: SCT found ~110,000 conversion items across three schemas and more than 8,000 application files (~6 M lines of Java, Groovy, Python, Go and shell with embedded Oracle SQL). DDL through DMS Schema Conversion; embedded SQL converted by an LLM agent with the target schema as context in a convert → run on Aurora → feed errors back loop; validation by mirroring live traffic into shadow queries behind feature flags while Oracle stayed the system of record. The reusable part is the rollback: DMS CDC ran a reverse-replication path keeping a production Oracle clone current after cutover, pre-loaded with SQL baselines. Go-live at 18,500 requests/s. (Eli Doe, Rohit Arora, Shashank Nigam, Manoj Duvva · aws.amazon.com/blogs/database)
[vendor blog][unverified: customer-reported figures; partner tooling featured] - Moving Prisma's control plane to Prisma Postgres without downtime — 83 tables, 74 GB, six services, RDS → their own serverless Postgres with writes never paused. Logical replication of 82 tables published by name (the migrations table left out because CI had already applied all 204 migrations), initial copy two tables at a time; a pinger kept the serverless target awake, since replication alone does not count as a connection; 74 GB became 79 GB because RDS used lz4 and the target pglz. Cutover was one merged PR flipping the binding for all six services, last RDS write seven minutes later,
apply_error_countwatched for key collisions — same-row double updates would have gone unreported, "we needed the window to be short". Rollback: a logical slot created on the new side three minutes before the merge, then RDS subscribed back withcopy_data = false, origin = nonefor a week; a slot created days earlier would have held ~1 GB/h of WAL. (Kristof Siket, Ankur Datta · prisma.io)[vendor blog]
Research & cutting edge
- Synchronized Rebuilds: the hidden cost of concurrent inserts in learned indexes — 4,000+ runs across 13 learned indexes: gapped-array designs rebuild nodes in synchronized bursts predictable from three constants in the source, each copying a node ~1,000× larger than a B-tree page and blocking every operation that reaches it; three of five concurrent learned indexes lost keys or stopped making progress, which the standard benchmark that rates one "almost ready for use" never notices. A rebuild-time-only buffer and background rebuilds cut inserts over 100 µs by two orders of magnitude at one thread on 400 M real keys. (Namuganga, Bindschaedler) [paper]
- When the application layer is disposable: putting integrity constraints back in the database — SQL-92 ASSERTIONs never got real support, and LLM agents now issue DML straight at the database, bypassing the layer where invariants lived. "Constraint indexes" represent multi-relation constraints as transactional access paths, implemented as a PostgreSQL extension: inheritance hierarchies, folded relationships, cardinality bounds and FDs at low overhead relative to no enforcement and up to 2.41× faster than trigger-based baselines; LLM writers frequently violate unenforced constraints and behave erratically when handed a list of them. (Kalumin, Deshpande) [paper]
- Nemo: efficient caching with index pushdown for disaggregated OLTP databases — push the whole B+tree to storage and cache hot records at compute, which needs a record cache that serves range queries, a fix for the negative-search penalty (confirming absence remotely) and phantom protection without knowing the storage layout. A tree-structured record buffer, cached negative results and a layout-agnostic phantom scheme: up to 11.42× over a page-cached B+tree on point queries, 4.76× on negative searches, 1.55× over PCL for phantom protection. ACM DOI assigned. (Hu, Zhou, Guo, Hao, Yu) [paper]
- Tile-based decompression in compiled GPU engines — PVLDB 20: decompression as a first-class physical operator in a compiled engine (Proteus), with cooperative tile decompression fused into tuple-at-a-time execution inside one generated kernel, never materialising in HBM — competitive with HeavyDB and Sirius at up to 4× smaller resident footprint and 6× less memory bandwidth. (Boffa, Gupta, Nicholson, Ailamaki) [paper]
- MetaDB: putting file-system structure back into distributed databases — NSDI '27: Baidu replaced the general-purpose distributed database under its storage fleet's metadata with one that knows directory-tree locality, differentiated consistency and clustered deletions — tree-induced sharding, off-critical-path semantic processing, in-memory MVCC with locality-aware compaction: 2.2–4.1× the throughput on half the machines, five years in production, exabyte scale in one cluster. (Ren, Cao, Chen, … Hou) [paper]
- DistOptimize: automatic optimization of distributed protocols — consensus protocols get verified once and then modified for throughput without proof; this ports the known optimisations to production frameworks, verifies each rewrite rule in Rocq, and applies them by calibration plus ILP search — up to 4× throughput on protocols used at AWS at ≤0.3 ms added latency. Last week's EquiTrace idea, for protocols. (McElroy, Laddad, Katahanas, Samuel, Lomeli, Crooks, Hellerstein, Lesani) [paper]
- Tessera: fast join-aggregates over skewed sparse relations — a skew-aware operator that computes a sparse matrix product directly over engine rows, emits only non-zero cells, prunes values that cannot meet the query threshold, and offloads the dense block of the most frequent pairs to an AMX-class matrix unit. (Kim) [paper]
[unverified: single-author preprint, no venue; the "1,802× over DuckDB" is against a default plan on a pathological shape] - CoWalk: cooperative walks for batched queries on disk-resident graphs — batches of related vector queries re-fetch 31–67% of each other's pages, yet a shared page cache helps only 1.1–1.2× because time goes to distance computation; running the batch as cooperating walks reads each page once and ranks its vectors for every query: 2.8–6.9× fewer I/Os, 1.6–1.9× faster on one thread at recall 0.95. (Liang, Chen, Yu, Xiao) [paper]
International (non-English sources)
- postgresql-leapfrog: an ordered B-tree index-intersection node for PG 18 — a
set_rel_pathlist_hookextension adds a CustomScan that reads several ordinary B-trees synchronously in ORDER BY order (leapfrog-join style, adaptive skip-ahead viaindex_rescanafter 64 misses), matches by heap TID, fetches heap rows only for survivors and stops at LIMIT; cost model adapted from MySQL's ROR-intersect with real min/max probes per index at plan time. 1 M orders, "last 100 deleted orders of customer 100": 1.9 ms / 166 buffers vs 4.3–8.1 ms / 1,957 buffers for stock plans. The write-side argument: 14 generic indexes instead of 33 specialised ones — index size −46%, WAL for 100k INSERTs 481 → 159 MB (−67%), filter-column UPDATE WAL −75%. Honest limits: the planner chooses the node unaided in 2 of 192 queries atrandom_page_cost=4; integer sort keys and equalities only. The author says up front the code was written by an LLM under his direction and asks for C review; results were cross-checked against stock plans withEXCEPT ALLboth ways, and review already found a use-after-free. (ialeroev · Habr) [ru] (orig: Меньше индексов, дешевле запись: как я научил PostgreSQL пересекать B-tree индексы с сохранением порядка)[unverified: single laptop, in memory] - TABLESAMPLE SYSTEM + LIMIT never sees the end of the heap — SYSTEM walks block numbers in ascending order, so
TABLESAMPLE SYSTEM (p) LIMIT Nwith a safety factor c stops around 1/c of the file and the newest rows at the tail are systematically skipped (stalereltuplesafter growth makes it worse). PG 17.9, 1 M rows with a column filled only in the last 10%, 200 runs:SYSTEM (2.4) LIMIT 20000estimated 0.37% (true 10%) and saw zero such rows in 174 of 200 runs;ORDER BY random()before LIMIT 9.95%;tsm_system_rows10.71% but with one run at 0% and one at 100%. After doubling the table without ANALYZE the LIMIT variant never reached the new half. The same trap in SQL Server'sTOP (N) … TABLESAMPLE. (shroud_tdm · Habr) [ru] (orig: TABLESAMPLE SYSTEM и LIMIT: выборка, которая не видит конец таблицы) - Logical-replication fan-out vs Debezium → Kafka or RabbitMQ, costed in CPU-ms per message — answering "a slot can't be shared, every reader decodes the whole WAL": total CPU seconds of every process (database, broker, CDC, web, test) over 100k messages from 200 senders, PG 18 pgoutput v4 binary. At 1/2/4/8 consumers direct logical replication cost 1.19 / 1.21 / 1.48 / 1.88 ms CPU per message, Debezium → Kafka 2.35 / 1.99 / 2.03 / 2.16, Debezium → RabbitMQ quorum 2.20 / 2.10 / 2.25 / 2.21. Caveats stated: one Windows desktop under Docker/WSL, single run per cell with ~10% drift, cost not latency, crossover beyond 8 readers not measured. (gandjustas · Habr) [ru] (orig: Очередь на Postgres: масштабирование, inbox и сравнение с Kafka и RabbitMq)
[unverified: single-run desktop numbers] - Postgres Pro's new free book "PostgreSQL 18: Query Optimization" — and Chinese editions within days — nine chapters based on the QPT course, demo database "Airlines", free PDF in Russian and English. The translation story is the data point: the translator of PostgreSQL 14 Internals had a Chinese draft online in about a day, and Ruohang Feng reports translating 30 Postgres books in one day with a glossary pipeline — by his own count ten real books plus Dalibo's 14 course modules and Postgres Pro's 8 course books. (Postgres Pro · Habr; xiongcc · modb.pro; Ruohang Feng · blog.vonng.com) [ru] [zh] (orig: PostgreSQL 18. Оптимизация запросов — новая книга)
- Parallel autovacuum on PG 19 RC1, measured: −45% wall clock, dead-item memory ×2.4 — 8 cores, two 400k-row tables with 800k dead tuples each (7 and 11 indexes), medians of three: manual
VACUUM (PARALLEL 4)578 → 374 ms and 509 → 355 ms, leader CPU 0.26 → 0.11 s; autovacuum withautovacuum_max_parallel_workers=40.78 → 0.43 s, "4 planned / 4 launched", dead-item storage 0.83 → 2.00 MB — the new log line sayslimit 256.00 MB each, per participant, so the peak multiplies by workers+1. Withfull_page_writeson the gain stays ~32% while everything is ~2× slower, so the gain tracks index-phase CPU, not I/O. Knob findings: the per-tableautovacuum_parallel_workerscan only cap down;max_parallel_maintenance_workers=0does not stop it,max_parallel_workers=0does; needs ≥2 indexes abovemin_parallel_index_scan_size. Explains why a dev.to beta4 test saw only −4%: that run was I/O-bound. (河马coding · modb.pro) [zh] (orig: 我把 autovacuum 开到 4 个并行:墙钟省 45%,内存账翻 2.4 倍)[unverified: the list of October fixes is the author's reading of git log] - Three confirmed OceanBase 4.x kernel bugs from production tickets, each with a minimal repro — (1) one 6,683-character report query returned 25 rows in one session and 52 in another on static data — same SQL_ID, two plan hashes on two nodes; the only difference in the optimizer trace was whether the GROUPBY_PULLUP rewrite was accepted (cheaper, wrong) — official root cause: aggregate pull-up plus view merge destroy LEFT JOIN semantics when the ON clause filters the right-hand subtree; all 4.x, workaround
/*+ NO_MERGE */, 7-row repro. (2) DROP of an empty table taking 20–40 s: TRUNCATE never cleans the table's rows in__all_virtual_table_history, and all DDL queues on one thread — four days lost chasing the network. (3) An observer SIGSEGV from UNION ALL + ORDER BY expression + LIMIT in one subquery, where the author found LIMIT is a necessary fourth condition the vendor omitted. (五月 · OceanBase community) [zh] (orig: 三个 OceanBase 4.x内核缺陷的案例) - A planner coredump in openGauss 5.0.1, bisected to a 7-line upstream fix — with an AI doing the gdb work —
SIGSEGVinlist_nth(NULL, 0)fromflatten_join_alias_vars_mutator: the sublink pull-up turns two correlatedMAX()subqueries insideCOALESCEinto LEFT JOINs with a zero-column placeholder JOIN RTE, and the OR-clause rewrite then references it. Minimal repro on one empty table needs a derived table, a top-level OR and a COALESCE of two correlated aggregates;rewrite_rule='disable_pullup_expr_sublink'avoids it; upstream fixdfb53df30(2024) deletes seven lines. Twelve reproductions and the commit hunt were done with a coding agent and a local model, and the author separates what the AI proved from what it left unproven. (DarkAthena · modb.pro) [zh] (orig: 【openGauss】排查一起panweidb2.0子链接提升的coredump案例)[unverified: commit metadata as reported] - TiDB Lightning imported 1.53 billion rows in 4 h 12 m — and OOM-killed two TiKV nodes on the way — 64 MySQL monthly tables into TiDB by physical import at 102k rows/s (logical replay measured at 21k/s). The first run with
region-concurrency=24killed two 64 GB TiKV nodes atanon-rss 64.4 GBand the region-rebalancing storm kept business p99 at 3.4 s (from 80 ms) the next day; an afternoon on NVMe and tcpdump before readingdmesg. Rules adopted: concurrency sized to the TiKV cluster (nodes × 2 + 2 → 8), block cache down from 45% of RAM, and amemory-usage-limitof 40 GB so TiKV back-pressures instead of dying; the second run was 88 minutes slower with zero incidents. (cationlin · tidb.net) [zh] (orig: 15 亿行数据 4 小时灌完,代价是 TiKV 被 OOM 杀了两次) - Why switching Aurora MySQL to RDS Proxy took production down — the proxy was sized from
SHOW PROCESSLISTatMaxConnectionsPercent=21%of 16,000 andConnectionBorrowTimeout=7 s, equal to the application's socket timeout; a week in staging showed nothing. Minutes after the production cutover: writer CPU at 100%,ConnectionAttempts264k (normally under 10k),AbortedClients258k. Demand was ~7,600 connections against ~3,360 the proxy could open, the equal timeouts made the app abandon borrow waits and reconnect, and MySQL's connect handshake is CPU-heavy — a feedback loop reproduced with Locust against a snapshot and gone at 62%/31%. Rolled out again per ECS task behind a feature flag, GETs first, 1 → 10 → 25 → 50 → 75 → 100%; a follow-up found the pool'sCOM_RESET_CONNECTIONon every return making the connector redoSET NAMESandSET autocommit. (nakaaa · Safie on Zenn) [ja] (orig: なぜRDS Proxy導入でデータベース障害がおきたのか?) - runc vs gVisor vs Kata vs a home-made Cloud Hypervisor runtime, measured with pgbench on PostgreSQL 18.6 — one database per microVM is the author's product, so they measured the tax: Xeon E3-1270 v6, scale 100, 16 clients, 3 CPUs for Postgres, medians of three, scripts published. tpcb TPS / p99: runc 4,992 / 44.4 ms; gVisor 1,995 / 37.1; Kata 4,127 / 19.9 (one vCPU larger) or 2,825 / 35.5 at equal size; their cchv 3,966 / 8.8 ms. Select-only 32,674 / 12,454 / 28,050 / 18,790 / 27,282. Idle memory 60 / 146 / 336 / 356 MiB; Kata gains ~11% on writes with virtio-blk instead of virtio-fs. Biases disclosed. (radarworks · Qiita) [ja] (orig: runc・gVisor・Kata+Cloud Hypervisor・cchv+Cloud Hypervisorを、同じPostgreSQLとnginxで比べた)
- Where Aurora DSQL's catalog lies to a PG 16 client — recorded against a real cluster while adding DSQL support to a schema tool: only
CREATE INDEX ASYNC(returns a job id), noADD COLUMN … DEFAULTin one statement, UNIQUE only via an async unique index, CHECK and FK asNOT VALIDplusALTER TABLE ASYNC … VALIDATE, one DDL per transaction; the catalog reports every PRIMARY KEY asPRIMARY KEY (id) INCLUDE (<all other columns>)with access methodbtree_index, so a naive diff emits an unapplicable DROP/ADD on every plan. Built a wire-protocol record/replay stub (232 queries) and an 840-line proxy over PG 16 to emulate it. (winebarrel · Zenn) [ja]
Upcoming events
- PostgreSQL Conference Japan 2026 — Tokyo, 27 November — one day, two interpreted English keynotes and 14 talks in three tracks; program posted. Internals picks:
- Per-Backend Statistics: See What Every Connection Is Actually Doing (Bertrand Drouvot, keynote) — what the cumulative-statistics machinery now exposes per process, from the author of the per-backend I/O and WAL statistics work.
- Controlling execution plans in PostgreSQL 19 with pg_plan_advice / pg_stash_advice (丸岡 茜, 田中 梨沙, Ashisuto) — a field walkthrough of the plan-advice route 19 took instead of hints.
- 22 TB and 190,000 tables, 17 → 18 with about two hours of downtime (大島 祐未, 日本経営) — a major-upgrade method report at catalog-heavy scale, where pg_upgrade's schema cost dominates.
New sources added this week
- databasearchitects.blogspot.com — the TUM/CWI group blog (Neumann, Leis, Boncz, Birler); low volume, primary-source optimizer and benchmark thinking. (Thomas Neumann et al.)
- rhaas.blogspot.com — Robert Haas's own blog, where the vendor-hosted essays are republished; lets the digest cite the author's site. (Robert Haas)
- photoroom.com/inside-photoroom — first-hand Postgres production incidents with numbers.
- manishrjain.com — the Dgraph/Badger author's new engine work, with a methodology page. (Manish R Jain)
- postgis.net/news — release radar with full change lists.
- zenn.dev/safie_inc [ja] and qiita.com/radarworks [ja] — measured ops post-mortems and runtime benchmarks with scripts.
94 items · yield — mailing lists: 1,149 messages in window (674 hackers / 165 bugs / 1 performance / 47 general, plus 252 pgsql-committers and 10 pgsql-announce) → 93 shortlisted → 58 published (plus 6 releases from pgsql-announce) · blogs: ~97 posts in window → 41 shortlisted → 31 published · community: ~235 threads viewed → 21 shortlisted → 3 published (3 more folded into article items) · research: 35 cs.DB announcements in window (none on Thursday) → 14 shortlisted → 8 published · international: ru 13→10→4, zh ~285→22→5, ja ~111→9→3, fr 0→0→0, de 3→0→0 (polyglot search unavailable this run; native feeds, site APIs and the browser used instead).