Details
-
Improvement
-
Status: Open
-
Minor
-
Resolution: Unresolved
-
10.3.1.4
-
None
-
Normal
-
Performance
Description
Pulled from the write-up for DERBY-47:
As seen in the beforeAndAfter.html document attached to DERBY-47, the compilation/optimization time for a query with an IN list consisting of all literals is far larger than it is for a similar query in which the IN list consists of all parameters. Since the "probe predicate" optimization implemented as part of DERBY-47 should apply similarly to both types of queries, it would be good to figure out what it is about literals that makes for such a long compilation time (with respect to parameters), and to address that issue.
Note that this relatively excessive compilation time was an issue even before the changes for DERBY-47 were committed.