Re: Make HeapTupleSatisfiesMVCC more concurrent

From: Andres Freund <andres(at)anarazel(dot)de>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: Jeff Janes <jeff(dot)janes(at)gmail(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Make HeapTupleSatisfiesMVCC more concurrent
Date: 2015-08-19 15:00:39
Message-ID: 20150819150038.GA15922@awork2.anarazel.de
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 2015-08-19 10:55:00 -0400, Tom Lane wrote:
> My own thought about reducing the cost of XidInMVCCSnapshot, if that
> proves necessary, is that maybe it would be worth the trouble to sort
> the arrays so we could use binary search. That would increase the
> cost of snapshot acquisition noticeably though.

It's also considerably more expensive for search in many cases because
it's very hard to predict (branching and prefetching). I doubt it'd be
worthwhile.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Kevin Grittner 2015-08-19 15:06:08 Re: Bug? ExecChooseHashTableSize() got assertion failed with crazy number of rows
Previous Message Tom Lane 2015-08-19 14:55:00 Re: Make HeapTupleSatisfiesMVCC more concurrent