[ 
https://issues.apache.org/jira/browse/KYLIN-3489?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Shaofeng SHI updated KYLIN-3489:
--------------------------------
    Summary: Improve the efficiency of enumerating dictionary values  (was: 
Improve the efficiency of enumerating dictionary values by pre-order visiting)

> Improve the efficiency of enumerating dictionary values
> -------------------------------------------------------
>
>                 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)

Reply via email to