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.

diff --git a/src/backend/access/gin/gininsert.c b/src/backend/access/gin/gininsert.c
index ebb16f3ceffdc05beaa4921e55d7160c121ccd3b..f98c611352def9322ebd2e85e252a20aab97e1aa 100644 (file)
--- a/src/backend/access/gin/gininsert.c
+++ b/src/backend/access/gin/gininsert.c
@@ -238,7 +238,9 @@ ginBuildCallback(Relation index, HeapTuple htup, Datum *values,
        buildstate->indtuples += ginHeapTupleBulkInsert(buildstate, *values, &htup->t_self);
 
        /* If we've maxed out our available memory, dump everything to the index */
-       if (buildstate->accum.allocatedMemory >= maintenance_work_mem * 1024L)
+       /* Also dump if the tree seems to be getting too unbalanced */
+       if (buildstate->accum.allocatedMemory >= maintenance_work_mem * 1024L ||
+               buildstate->accum.maxdepth > GIN_MAX_TREE_DEPTH)
        {
                ItemPointerData *list;
                Datum           entry;

diff --git a/src/include/access/gin.h b/src/include/access/gin.h
index 0eb5b760d682509bcb21ad8f0c2258a9fef88999..e5d9999651ac7fcffac1a6ec0b3bbfdeb4afa4e8 100644 (file)
--- a/src/include/access/gin.h
+++ b/src/include/access/gin.h
@@ -32,6 +32,14 @@
 #define GIN_CONSISTENT_PROC                       4
 #define GINNProcs                                         4
 
+/*
+ * Max depth allowed in search tree during bulk inserts.  This is to keep from
+ * degenerating to O(N^2) behavior when the tree is unbalanced due to sorted
+ * or nearly-sorted input.  (Perhaps it would be better to use a balanced-tree
+ * algorithm, but in common cases that would only add useless overhead.)
+ */
+#define GIN_MAX_TREE_DEPTH 100
+
 /*
  * Page opaque data in a inverted index page.
  *
@@ -314,12 +322,9 @@ extern IndexTuple ginPageGetLinkItup(Buffer buf);
 
 /* gindatapage.c */
 extern int     compareItemPointers(ItemPointer a, ItemPointer b);
-extern void
-MergeItemPointers(
-                                 ItemPointerData *dst,
+extern void MergeItemPointers(ItemPointerData *dst,
                                  ItemPointerData *a, uint32 na,
-                                 ItemPointerData *b, uint32 nb
-);
+                                 ItemPointerData *b, uint32 nb);
 
 extern void GinDataPageAddItem(Page page, void *data, OffsetNumber offset);
 extern void PageDeletePostingItem(Page page, OffsetNumber offset);