[
https://jira.jboss.org/jira/browse/TEIID-541?page=com.atlassian.jira.plug...
]
Steven Hawkins resolved TEIID-541.
----------------------------------
Resolution: Done
Added planner detection and processing logic for a partitioned sort join that looks for
unbalanced inner joins such that only one of the sides is fully sorted and the other is
partitioned according to the batch bounds of the first. Right now it is hard coded to
only scale to allowing 8 batches on the smaller side (typically 16k rows). We could scale
more with a recursive partitioning process.
Implement a partitioned merge join
----------------------------------
Key: TEIID-541
URL:
https://jira.jboss.org/jira/browse/TEIID-541
Project: Teiid
Issue Type: Feature Request
Components: Query Engine
Affects Versions: 6.0.0
Reporter: Steven Hawkins
Assignee: Steven Hawkins
Fix For: 6.1.0
To obviate the need for a hash join, we should have a scalable partitioned merge join.
The smaller of the two join sides will be sorted and it's batch bounds used to
partition the larger side rather than performing a full sort.
--
This message is automatically generated by JIRA.
-
If you think it was sent incorrectly contact one of the administrators:
https://jira.jboss.org/jira/secure/Administrators.jspa
-
For more information on JIRA, see:
http://www.atlassian.com/software/jira