[
https://issues.jboss.org/browse/TEIID-1517?page=com.atlassian.jira.plugin...
]
Steven Hawkins resolved TEIID-1517.
-----------------------------------
Resolution: Won't Fix
I don't think there's sufficient need to proactively work this. In the dependent
set case we're still processing the join as a merge join, so it's only an
incremental improvement to apply the search earlier in the plan (and that only is needed
if the value set is too large).
As for the uncorrelated in case, we will typically rewrite as a join if there is costing
or the user can explicitly use a hint to force join handling.
Use tree logic for dependent joins, subquery set, and partitioned
joins
-----------------------------------------------------------------------
Key: TEIID-1517
URL:
https://issues.jboss.org/browse/TEIID-1517
Project: Teiid
Issue Type: Feature Request
Components: Query Engine
Reporter: Steven Hawkins
Assignee: Steven Hawkins
Fix For: 8.2
The tree logic would help each of the given areas of functionality.
Currently subqueryin produces a linear search, partitioning is limited by the bucketing
logic, and dependent joins will only create a tree of a limited size.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see:
http://www.atlassian.com/software/jira