1. 13 Nov, 2008 1 commit
    • Tom Lane's avatar
      Arrange to cache the results of looking up a btree predicate proof comparison · e7d8bfb9
      Tom Lane authored
      operator.  The result depends only on the two input operators and the proof
      direction (imply or refute), so it's easy to cache.  This provides a very
      large savings in cases such as Sergey Konoplev's long NOT-IN-list example,
      where predtest spends all its time repeatedly figuring out that the same pair
      of operators cannot be used to prove anything.  (But of course the O(N^2)
      behavior still catches up with you eventually.)  I'm not convinced it buys
      a whole lot when constraint_exclusion isn't turned on, but it's not a lot
      of added code so we might as well cache all the time.
      e7d8bfb9
  2. 12 Nov, 2008 12 commits
  3. 11 Nov, 2008 9 commits
  4. 10 Nov, 2008 7 commits
  5. 09 Nov, 2008 4 commits
  6. 08 Nov, 2008 1 commit
  7. 07 Nov, 2008 3 commits
  8. 06 Nov, 2008 3 commits