On 9 November 2012 14:55, Marti Raudsepp <marti@juffo.org> wrote:
> On Fri, Nov 9, 2012 at 4:24 PM, Simon Riggs <simon@2ndquadrant.com> wrote:
>> We need a fast lookup structure that is expandable to accommodate
>> arbitrary numbers of truncates. Shared hash table, with some form of
>> overflow mechanism.
>
> Surely you only need to remember the last completed truncate for each
> relation?
Yes
> The latest one also invalidates any snapshots before earlier
> truncates.
1 per table, arbirary number of tables
-- Simon Riggs http://www.2ndQuadrant.com/PostgreSQL Development, 24x7 Support, Training & Services
