On Mon, Jan 30, 2017 at 4:28 PM, Andrew Borodin <boro...@octonica.com> wrote: > I'll summarize here my state of studying concurrent methods of page unlinking. > > GIN B-tree does not have "high key". That means, that rightmost key on > a page is maximal for the non-leaf page. > But I do not see anything theoretical in a way of implementation of > Lanin and Shasha`s methods of page merging, with slight modifications. > Their paper does not even mention high key(high fence key in papers by > Goetz Graefe). > > But it's not a simple task due to large portions of shared code > between entry tree and posting tree. > > Also, I do not see a reason why this method can be practically > superior to proposed patch. > > Currently, I do not have resources to implement a proof of concept for > fully concurrent page unlinking to make benchmarking.
I am marking this patch as returned with feedback. -- Michael -- Sent via pgsql-hackers mailing list (email@example.com) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers