[teiid-issues] [JBoss JIRA] (TEIID-1517) Use tree logic for dependent joins, subquery set, and partitioned joins
[
https://issues.jboss.org/browse/TEIID-1517?page=com.atlassian.jira.plugin...
]
Steven Hawkins updated TEIID-1517:
----------------------------------
Fix Version/s: 8.2
(was: 8.1)
This is only applicable for subqueryin (typically uncorrelated) - that has not been
optimized to a join and for non-pushed dependent joins. In each case we have simplistic
logic to create a Set, but only of a fixed size. For both of these there is a backing
TupleBuffer that should instead be a tree.
However I would probably want to work the array value comparison for dependent joins
first.
Pushing to 8.2
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:
https://issues.jboss.org/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira