[
https://issues.apache.org/jira/browse/KYLIN-2729?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Zhong Yanghong updated KYLIN-2729:
----------------------------------
Description: 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
> 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.2.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)
