Re: Patch for circular buffer in tuplestore to optimize merge joins (v1)

stark <stark@enterprisedb.com> writes:
> This patch implements a circular buffer in tuplestore which drops old tuples
> as they're no longer needed. It uses this for merge joins to avoid having to
> spill the tuplestore if no single value exceeds work_mem. It also is what's
> needed for both recursive query support and OLAP window functions (hence why
> it implements the more complex circular buffer rather than just moving the
> single tuple up to the head of the buffer).

Applied with revisions; mostly, that I took out the "circular buffer"
logic because I had no confidence in it.  It's a lot simpler to move the
remaining tuples down to the head of the array during tuplestore_trim.
And at least for the existing use-case, it's demonstrably useless to
have all the extra logic: there'll only be one tuple to move each time,
so it's cheaper to just do that.  When and if we have callers with
different usage patterns, we can measure whether it's worth trying to
avoid the memmove().  I'm dubious that it will be a win even then,
since the only way to have a lot of stuff to move is if you don't
trim very often.

            regards, tom lane