[
https://issues.apache.org/jira/browse/KYLIN-3489?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16585779#comment-16585779
]
ASF subversion and git services commented on KYLIN-3489:
--------------------------------------------------------
Commit c9337cb4a5e6c4f04c10b7fde1d5e3f6a8ffa25b in kylin's branch
refs/heads/master from Zhong
[ https://gitbox.apache.org/repos/asf?p=kylin.git;h=c9337cb ]
KYLIN-3489 improve the efficiency of enumerating dictionary values by pre-order
visiting
> Improve the efficiency of enumerating dictionary values by pre-order visiting
> -----------------------------------------------------------------------------
>
> Key: KYLIN-3489
> URL: https://issues.apache.org/jira/browse/KYLIN-3489
> Project: Kylin
> Issue Type: Improvement
> Components: Metadata
> Reporter: Zhong Yanghong
> Assignee: Zhong Yanghong
> Priority: Major
> Fix For: v2.5.0
>
> Attachments: APACHE-KYLIN-3489.patch
>
>
> Currently, to enumerate all of the values of a dictionary, we enumerate the
> ids first and then get the related values. The compute complexity is nlogn.
> We can achieve the compute complexity of n by pre-order visiting the trie
> tree.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
