Install a search tree depth limit in GIN bulk-insert operations, to prevent
authorTom Lane <tgl@sss.pgh.pa.us>
Tue, 24 Mar 2009 22:06:03 +0000 (22:06 +0000)
committerTom Lane <tgl@sss.pgh.pa.us>
Tue, 24 Mar 2009 22:06:03 +0000 (22:06 +0000)
commite5efda442cfcfa20a0cf6166952c671a0f39689b
tree5b2463555c3b06d69511b0747c4bcb59c4309bb5
parentfc022d72c79b83dfe17aad33b6de2cf0a4f6f3ba
Install a search tree depth limit in GIN bulk-insert operations, to prevent
them from degrading badly when the input is sorted or nearly so.  In this
scenario the tree is unbalanced to the point of becoming a mere linked list,
so insertions become O(N^2).  The easiest and most safely back-patchable
solution is to stop growing the tree sooner, ie limit the growth of N.  We
might later consider a rebalancing tree algorithm, but it's not clear that
the benefit would be worth the cost and complexity.  Per report from Sergey
Burladyan and an earlier complaint from Heikki.

Back-patch to 8.2; older versions didn't have GIN indexes.
src/backend/access/gin/ginfast.c
src/backend/access/gin/gininsert.c
src/include/access/gin.h