Re: autovacuum next steps, take 2
| От | Tom Lane | 
|---|---|
| Тема | Re: autovacuum next steps, take 2 | 
| Дата | |
| Msg-id | 10348.1172547814@sss.pgh.pa.us обсуждение исходный текст  | 
		
| Ответ на | Re: autovacuum next steps, take 2 ("Matthew T. O'Connor" <matthew@zeut.net>) | 
| Ответы | 
                	
            		Re: autovacuum next steps, take 2
            		
            		 | 
		
| Список | pgsql-hackers | 
"Matthew T. O'Connor" <matthew@zeut.net> writes:
> Tom Lane wrote:
>> I'm inclined to propose an even simpler algorithm in which every worker
>> acts alike;
> That is what I'm proposing except for one difference, when you catch up 
> to an older worker, exit.
No, that's a bad idea, because it means that any large table starves
even-larger tables.
(Note: in all this I assume we're all using "size" as a shorthand for
some sort of priority metric that considers number of dirty tuples not
only size.  We don't want every worker insisting on passing over every
small read-only table every time, for instance.)
        regards, tom lane
		
	В списке pgsql-hackers по дате отправления: