1. 27 Mar, 2009 17 commits
  2. 26 Mar, 2009 12 commits
  3. 25 Mar, 2009 9 commits
  4. 24 Mar, 2009 2 commits
    • Tom Lane's avatar
      Install a search tree depth limit in GIN bulk-insert operations, to prevent · e5efda44
      Tom Lane authored
      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.
      e5efda44
    • Tom Lane's avatar