Heikki Linnakangas <heikki.linnakangas@xxxxxxxxxxxxxxxx> writes: > Tom Lane wrote: >> I think a reasonable solution for this might be to keep an eye on >> maxdepth and force a flush if that gets too large (more than a few >> hundred, perhaps?). Something like this: > I fooled around with a balanced tree, which solved the problem but > unfortunately made the unsorted case slower. Yeah, rebalancing the search tree would fix that, but every balanced tree algorithm I know about is complicated, slow, and needs extra memory. It's really unclear that it'd be worth the trouble for a transient data structure like this one. regards, tom lane -- Sent via pgsql-performance mailing list (pgsql-performance@xxxxxxxxxxxxxx) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
