You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@drill.apache.org by "Lisen Mu (JIRA)" <ji...@apache.org> on 2013/08/15 12:45:49 UTC

[jira] [Updated] (DRILL-171) Graph creation has O(n^2) complexity

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

Lisen Mu updated DRILL-171:
---------------------------

    Attachment: DRILL-171.patch.0.txt

The fix is simple, is there any side effect?

                
> Graph creation has O(n^2) complexity
> ------------------------------------
>
>                 Key: DRILL-171
>                 URL: https://issues.apache.org/jira/browse/DRILL-171
>             Project: Apache Drill
>          Issue Type: Improvement
>            Reporter: Lisen Mu
>         Attachments: DRILL-171.patch.0.txt
>
>
> AdjacencyList.newInstance() loops over all operators, while  AdjacencyListBuilder traverses all children of each operator recursively,  against LogicalOperatorBase or AbstractBase. 

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira