]
RH Bugzilla Integration commented on TEIID-2728:
------------------------------------------------
Van Halbert <vhalbert(a)redhat.com> changed the Status of [bug
Very large sorts are inefficient
--------------------------------
Key: TEIID-2728
URL:
https://issues.jboss.org/browse/TEIID-2728
Project: Teiid
Issue Type: Bug
Components: Query Engine
Affects Versions: 8.4
Reporter: Steven Hawkins
Assignee: Steven Hawkins
Fix For: 8.6
This is a regression of TEIID-2429. When the memory space needed for a sort is estimated
to be above 2 GB, the expression used (even though it's assigned to a long) will
overflow. This then causes the processing to use the batch size as the intermediate sort
buffer size, which for any high row count will lead to many passes (the logic typically
should achieve at most a two pass sort).
--
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: