You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@kylin.apache.org by "Zhong Yanghong (JIRA)" <ji...@apache.org> on 2018/08/15 08:09:00 UTC

[jira] [Commented] (KYLIN-3489) Improve the efficiency of enumerating dictionary values by pre-order visiting

    [ https://issues.apache.org/jira/browse/KYLIN-3489?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16580821#comment-16580821 ] 

Zhong Yanghong commented on KYLIN-3489:
---------------------------------------

Hi [~Shaofengshi], could you help review this patch? Thanks very much.

> 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)