| commit | 2b55f3c989c471d248d3c125b344a0236ba6c7e2 | |
| author | tgl <tgl> | |
| Mon, 11 May 2009 17:56:08 +0000 (11 17:56 +0000) | ||
| committer | tgl <tgl> | |
| Mon, 11 May 2009 17:56:08 +0000 (11 17:56 +0000) | ||
| tree | fe85a3b86cf255822313c9353b083dafc019e36d | treesnapshot (tar.gz zip) |
| parent | b8680356b3b62efdfa44a02b4a2ebe4510a296c5 | commitdiff |
Partially revert my patch of 2008-11-12 that installed a limit on the number
of AND/OR clause branches that predtest.c would attempt to deal with. As
noted in bug #4721, that change disabled proof attempts for sizes of problems
that people are actually expecting it to work for. The original complaint
it was trying to solve was O(N^2) behavior for long IN-lists, so let's try
applying the limit to just ScalarArrayOpExprs rather than everything.
Another case of "foolish consistency" I fear.
Back-patch to 8.2, same as the previous patch was.
of AND/OR clause branches that predtest.c would attempt to deal with. As
noted in bug #4721, that change disabled proof attempts for sizes of problems
that people are actually expecting it to work for. The original complaint
it was trying to solve was O(N^2) behavior for long IN-lists, so let's try
applying the limit to just ScalarArrayOpExprs rather than everything.
Another case of "foolish consistency" I fear.
Back-patch to 8.2, same as the previous patch was.
| src/backend/optimizer/util/predtest.c | diffblobblamehistory |