You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tajo.apache.org by "Hyunsik Choi (JIRA)" <ji...@apache.org> on 2013/10/11 12:36:42 UTC

[jira] [Resolved] (TAJO-99) Design the interface of join enumeration algorithm

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

Hyunsik Choi resolved TAJO-99.
------------------------------

       Resolution: Fixed
    Fix Version/s: 0.2-incubating

I've just committed it. From now, we don't need to guess a correct join order by hand. Of course, we need to continue enhancement of join order algorithms.

> 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)