kylin-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Zhong Yanghong (JIRA)" <j...@apache.org>
Subject [jira] [Updated] (KYLIN-3489) Improve the efficiency of enumerating dictionary values by pre-order visiting
Date Wed, 15 Aug 2018 08:06:00 GMT

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

Zhong Yanghong updated KYLIN-3489:
----------------------------------
    Attachment: APACHE-KYLIN-3489.patch

> 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
>            Reporter: Zhong Yanghong
>            Assignee: Zhong Yanghong
>            Priority: Major
>         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)

Mime
View raw message