[DERBY-808] PreparedStatements can take longer to execute than equivalent Statements when there are multiple join conditions mixed with some search clauses.

• Type: Bug
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 10.1.2.1, 10.2.1.6
• Fix Version/s: 10.1.3.1, 10.2.1.6
• Component/s: SQL
• Environment: generic
• Assignee: Satheesh E. Bandaram
• Reporter: Satheesh E. Bandaram
• Created: 12/Jan/06 10:36
• Updated: 04/Dec/09 11:05
• Resolved: 25/Apr/06 03:36

Description

PreparedStatements could take much longer than Statements because of incorrect search clause transitive closure optimization. For the customer case I investigated this problem, Statement would complete in about 13 seconds, where as equivalent PreparedStatement ran "forever". (stoped it after hours)

I think there a problem with PredicateList.searchClauseTransitiveClosure method. This method tries to add new search clauses based on equality join between tables involved. Current code only looks for ConstantNodes on the right side of searchClauses. This would miss ParameterNodes, so Derby might miss search clause transitive closure optimizations for PreparedStatements.

Issue Links

• incorporates: DERBY-824 Enhance logic in PredicateList to use variant type of expression while determining search clauses or predicates, instead of using ConstantNode or ParameterNodes directly.

Sub-Tasks

• Clean up coding error in searchClauseTransitiveClosure method in PredicateList.java: Closed