[
https://issues.apache.org/jira/browse/TAJO-99?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13792427#comment-13792427
]
Hyunsik Choi edited comment on TAJO-99 at 10/11/13 10:42 AM:
-------------------------------------------------------------
I've uploaded the patch. This patch contains as follows:
* a greedy heuristic for left-deep tree join ordering
* join ordering algorithm interface
* logical optimizer refactoring to use cost-based join order algorithm
* add various utilities for join order string representation and join cost
computation
was (Author: hyunsik):
I've uploaded the patch. This patch contains as follows:
* a greedy heuristic for left-deep tree join ordering
* join ordering algorithm interface
* logical optimizer enhancement to use the best join order
* add various utilities for join order string representation and join cost
computation
> Design the interface of join enumeration algorithm
> --------------------------------------------------
>
> Key: TAJO-99
> URL: https://issues.apache.org/jira/browse/TAJO-99
> Project: Tajo
> Issue Type: Sub-task
> Components: planner/optimizer
> Reporter: Hyunsik Choi
> Assignee: Hyunsik Choi
> Fix For: 0.2-incubating
>
> Attachments: TAJO-99.patch
>
>
> The core feature of cost-based optimizer is cost-based join enumeration
> approach. The main objective of this is to find the best join order from lots
> of enumerated join trees. In database community, there have been many studies
> for join enumeration ways.
> It would like to great to provide a generic and pluggable interface for join
> enumeration algorithms. It may encourage contributors to implement various
> join enumeration ways, and users could choose the best join ordering
> algorithm for their purpose.
--
This message was sent by Atlassian JIRA
(v6.1#6144)
