Re: Process local hint bit cache
От | Tom Lane |
---|---|
Тема | Re: Process local hint bit cache |
Дата | |
Msg-id | 3739.1301791077@sss.pgh.pa.us обсуждение исходный текст |
Ответ на | Re: Process local hint bit cache (Merlin Moncure <mmoncure@gmail.com>) |
Ответы |
Re: Process local hint bit cache
|
Список | pgsql-hackers |
Merlin Moncure <mmoncure@gmail.com> writes: > On Thu, Mar 31, 2011 at 5:38 PM, Merlin Moncure <mmoncure@gmail.com> wrote: >> working on exanding the cache to # xid > 1. > patch attached. this is essentially my original idea except it's > injected directly in to tqual.c as a kind of a expansion of the 'last > seen' concept. Because the cache loops are inlined and very tight (4 > int compares), it's actually cheaper than jumping out of line into > clog to test this_int = that_int; This seems like a mess. Why is the criterion for caching commit states different from whether the hint bit can be set? And why are you cluttering tqual.c with it? Based on the initial description I'd expected to find this enlarging the single-entry cache in transam.c to have multiple entries. regards, tom lane
В списке pgsql-hackers по дате отправления: