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 2017/09/25 01:12:00 UTC

[jira] [Resolved] (KYLIN-2729) Introduce greedy algorithm for cube planner

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

Zhong Yanghong resolved KYLIN-2729.
-----------------------------------
    Resolution: Done

> Introduce greedy algorithm for cube planner
> -------------------------------------------
>
>                 Key: KYLIN-2729
>                 URL: https://issues.apache.org/jira/browse/KYLIN-2729
>             Project: Kylin
>          Issue Type: Sub-task
>    Affects Versions: v2.1.0
>            Reporter: Zhong Yanghong
>            Assignee: Zhong Yanghong
>
> The basic idea of greedy algorithm is to select the highest benefit cuboid round by round. Notice that the result got from this algorithm is not the global optimization one



--
This message was sent by Atlassian JIRA
(v6.4.14#64029)