Re: [PoC] Improve dead tuple storage for lazy vacuum
Dilip Kumar <dilipbalaut@gmail.com>
On Mon, Jan 23, 2023 at 6:00 PM John Naylor <john.naylor@enterprisedb.com> wrote: > > Attached is a rebase to fix conflicts from recent commits. I have reviewed v22-0022* patch and I have some comments. 1. >It also changes to the column names max_dead_tuples and num_dead_tuples and to >show the progress information in bytes. I think this statement needs to be rephrased. 2. /* * vac_tid_reaped() -- is a particular tid deletable? * * This has the right signature to be an IndexBulkDeleteCallback. * * Assumes dead_items array is sorted (in ascending TID order). */ I think this comment 'Assumes dead_items array is sorted' is not valid anymore. 3. We are changing the min value of 'maintenance_work_mem' to 2MB. Should we do the same for the 'autovacuum_work_mem'? 4. + + /* collected LP_DEAD items including existing LP_DEAD items */ + int lpdead_items; + OffsetNumber deadoffsets[MaxHeapTuplesPerPage]; We are actually collecting dead offsets but the variable name says 'lpdead_items' instead of something like ndeadoffsets num_deadoffsets. And the comment is also saying dead items. 5. /* * lazy_vacuum_heap_page() -- free page's LP_DEAD items listed in the * vacrel->dead_items array. * * Caller must have an exclusive buffer lock on the buffer (though a full * cleanup lock is also acceptable). vmbuffer must be valid and already have * a pin on blkno's visibility map page. * * index is an offset into the vacrel->dead_items array for the first listed * LP_DEAD item on the page. The return value is the first index immediately * after all LP_DEAD items for the same page in the array. */ This comment needs to be changed as this is referring to the 'vacrel->dead_items array' which no longer exists. -- Regards, Dilip Kumar EnterpriseDB: http://www.enterprisedb.com
Commits
-
radixtree: Fix SIGSEGV at update of embeddable value to non-embeddable.
- bb7f195ff788 17.0 landed
-
Get rid of anonymous struct
- bf183f168c44 17.0 landed
-
Teach radix tree to embed values at runtime
- 0fe5f64367bc 17.0 landed
-
Teach TID store to skip bitmap for small numbers of offsets
- f35bd9bf359d 17.0 landed
-
Use bump context for TID bitmaps stored by vacuum
- 8a1b31e6e596 17.0 landed
-
Fix alignment of stack variable
- 0ea51bac3802 17.0 landed
-
Use TidStore for dead tuple TIDs storage during lazy vacuum.
- 667e65aac354 17.0 landed
-
Rethink create and attach APIs of shared TidStore.
- 2d8f56dabbfd 17.0 landed
-
Fix inconsistent function prototypes with function definitions.
- a0e22ef9114b 17.0 landed
-
Fix a calculation in TidStoreCreate().
- 4edb37e322a6 17.0 landed
-
Fix potential integer handling issue in radixtree.h.
- 80d5d4937c16 17.0 landed
-
Add TIDStore, to store sets of TIDs (ItemPointerData) efficiently.
- 30e144287a72 17.0 landed
-
Fix link error for test_radixtree module on Windows
- ab6ae6260372 17.0 landed
- 9552e3ace317 17.0 landed
-
Blind attempt to fix ODR violations
- 1f1d73a8b83f 17.0 landed
-
Fix incorrect format specifier for int64
- e444ebcb85c0 17.0 landed
-
Fix redefinition of typedefs
- ac234e6377dd 17.0 landed
-
Add template for adaptive radix tree
- ee1b30f128d8 17.0 landed
-
Fix signedness error in 9f225e992 for gcc
- de7c6fe8347a 17.0 landed
-
Introduce helper SIMD functions for small byte arrays
- 9f225e992bed 17.0 landed
-
Optimize vacuuming of relations with no indexes.
- c120550edb86 17.0 cited
-
Add bound check before bsearch() for performance
- bbaf315309ed 14.0 cited
-
Allocate consecutive blocks during parallel seqscans
- 56788d2156fc 14.0 cited