[
https://issues.apache.org/jira/browse/KYLIN-4666?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Zhong Yanghong updated KYLIN-4666:
----------------------------------
Description: Currently, we need to do sort for very merge operation, which
will cost much time for thousands of merges. It's better to leverage a bit more
buffer to reduce the chance of sort (was: It's better to use PriorityQueue
rather than Collections.sort() to sort elements and find minimum value.)
> Improve TopNCounter's merge performance
> ---------------------------------------
>
> Key: KYLIN-4666
> URL: https://issues.apache.org/jira/browse/KYLIN-4666
> Project: Kylin
> Issue Type: Improvement
> Reporter: Zhong Yanghong
> Assignee: Zhong Yanghong
> Priority: Major
>
> Currently, we need to do sort for very merge operation, which will cost much
> time for thousands of merges. It's better to leverage a bit more buffer to
> reduce the chance of sort
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
