Re: Adding skip scan (including MDAM style range skip scan) to nbtree
Peter Geoghegan <pg@bowt.ie>
Commits
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
nbtree: Always set skipScan flag on rescan.
- 454c046094ab 19 (unreleased) landed
- bee763aea13f 18.0 landed
-
meson: Build numeric.c with -ftree-vectorize.
- 9016fa7e3bcd 19 (unreleased) cited
-
Fix "variable not found in subplan target lists" in semijoin de-duplication.
- b8a1bdc458e3 19 (unreleased) cited
-
Revert "nbtree: Remove useless row compare arg."
- dd2ce3792754 18.0 landed
-
nbtree: Remove useless row compare arg.
- 54c6ea8c81db 18.0 cited
-
Prevent premature nbtree array advancement.
- 5f4d98d4f371 18.0 landed
-
nbtree: tighten up array recheck rules.
- 7e25c9363a82 18.0 landed
-
Avoid treating nonrequired nbtree keys as required.
- 0f08df406822 18.0 landed
-
Adjust overstrong nbtree skip array assertion.
- 9d924dbb3710 18.0 landed
-
Make NULL tuple values always advance skip arrays.
- b75fedcab791 18.0 cited
-
Avoid extra index searches through preprocessing.
- b3f1a13f22f9 18.0 landed
-
Improve nbtree skip scan primitive scan scheduling.
- 21a152b37f36 18.0 landed
-
Further optimize nbtree search scan key comparisons.
- 8a510275dd6b 18.0 landed
-
Add nbtree skip scan optimization.
- 92fe23d93aa3 18.0 landed
-
Improve nbtree array primitive scan scheduling.
- 9a2e2a285a14 18.0 landed
-
nbtree: Make BTMaxItemSize into object-like macro.
- 426ea611171d 18.0 landed
-
Show index search count in EXPLAIN ANALYZE, take 2.
- 0fbceae841cb 18.0 landed
-
Make parallel nbtree index scans use an LWLock.
- 67fc4c9fd7fa 18.0 landed
-
Show index search count in EXPLAIN ANALYZE.
- 5ead85fbc811 18.0 landed
-
Avoid nbtree parallel scan currPos confusion.
- b5ee4e52026b 18.0 cited
-
nbtree: Remove useless 'strat' local variable.
- b6558e4f837e 18.0 landed
-
Normalize nbtree truncated high key array behavior.
- 79fa7b3b1a44 18.0 landed
-
Refactor handling of nbtree array redundancies.
- b524974106ac 18.0 landed
-
Fix nbtree pgstats accounting with parallel scans.
- c00c54a9ac1e 18.0 landed
- fb4f5e58af97 17.0 landed
-
Avoid parallel nbtree index scan hangs with SAOPs.
- d8adfc18bebf 18.0 landed
- a24bffc021d9 17.0 landed
-
Show Parallel Bitmap Heap Scan worker stats in EXPLAIN ANALYZE
- 5a1e6df3b84c 18.0 cited
-
Enhance nbtree ScalarArrayOp execution.
- 5bf748b86bc6 17.0 cited
-
Skip checking of scan keys required for directional scan in B-tree
- e0b1ee17dc3a 17.0 cited
-
Instead of using a numberOfRequiredKeys count to distinguish required
- 7ccaf13a06b8 8.2.0 cited
Attachments
- v30-0004-DEBUG-Add-skip-scan-disable-GUCs.patch (application/octet-stream) patch v30-0004
- v30-0003-Apply-low-order-skip-key-in-_bt_first-more-often.patch (application/octet-stream) patch v30-0003
- v30-0002-Lower-nbtree-skip-array-maintenance-overhead.patch (application/octet-stream) patch v30-0002
- v30-0001-Add-nbtree-skip-scan-optimizations.patch (application/octet-stream) patch v30-0001
On Fri, Mar 21, 2025 at 11:36 AM Peter Geoghegan <pg@bowt.ie> wrote: > A big part of the concern here is with the existing pstate.prechecked > optimization (the one added to Postgres 17 by Alexander Korotkov's > commit e0b1ee17). It now seems quite redundant -- the new > _bt_skip_ikeyprefix mechanism added by my 0003-* patch does the same > thing, but does it better (especially since I taught > _bt_skip_ikeyprefix to deal with simple inequalities in v29). I now > think that it makes most sense to totally replace pstate.prechecked > with _bt_skip_ikeyprefix -- we should use _bt_skip_ikeyprefix during > every scan (not just during skip scans, not just during scans with > SAOP array keys), and be done with it. I just committed "Improve nbtree array primitive scan scheduling". Attached is v30, which fully replaces the pstate.prechecked optimization with the new _bt_skip_ikeyprefix optimization (which now appears in v30-0002-Lower-nbtree-skip-array-maintenance-overhead.patch, and not in 0003-*, due to my committing the primscan scheduling patch just now). I'm now absolutely convinced that fully generalizing _bt_skip_ikeyprefix (as described in yesterday's email) is the right direction to take things in. It seems to have no possible downside. > Under this new scheme, so->scanBehind is strictly a flag that > indicates that a recheck is scheduled, to be performed once the scan > calls _bt_readpage for the next page. It no longer serves role #1, > only role #2. That seems significantly simpler. I especially like this about the new _bt_skip_ikeyprefix scheme. Having so->scanBehind strictly be a flag (that tracks if we need a recheck at the start of reading the next page) substantially lowers the cognitive burden for somebody trying to understand how the primitive scan scheduling stuff works. The newly expanded _bt_skip_ikeyprefix needs quite a bit more testing and polishing to be committable. I didn't even update the relevant commit message for v30. Plus I'm not completely sure what to do about RowCompare keys just yet, which have some funny rules when dealing with NULLs. -- Peter Geoghegan