diff options
| author | Andres Freund | 2026-01-12 18:14:58 +0000 |
|---|---|---|
| committer | Andres Freund | 2026-01-12 18:22:04 +0000 |
| commit | 0b96e734c5904ee26b8f622b3348620dda4bfee5 (patch) | |
| tree | f66dadcfcdb8db26120032448cc056eca78b7095 /doc/TODO.detail/function | |
| parent | 852558b9ec9d54194195a7b7418d57e83a2fda70 (diff) | |
There are two reasons for doing so:
1) It is generally faster to perform checks in a batched fashion and making
sequential scans faster is nice.
2) We would like to stop setting hint bits while pages are being written
out. The necessary locking becomes visible for page mode scans, if done for
every tuple. With batching, the overhead can be amortized to only happen
once per page.
There are substantial further optimization opportunities along these
lines:
- Right now HeapTupleSatisfiesMVCCBatch() simply uses the single-tuple
HeapTupleSatisfiesMVCC(), relying on the compiler to inline it. We could
instead write an explicitly optimized version that avoids repeated xid
tests.
- Introduce batched version of the serializability test
- Introduce batched version of HeapTupleSatisfiesVacuum
Reviewed-by: Melanie Plageman <melanieplageman@gmail.com>
Discussion: https://postgr.es/m/6rgb2nvhyvnszz4ul3wfzlf5rheb2kkwrglthnna7qhe24onwr@vw27225tkyar
Diffstat (limited to 'doc/TODO.detail/function')
0 files changed, 0 insertions, 0 deletions
