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:43:47 UTC

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

Lisen Mu created DRILL-171:
------------------------------

             Summary: 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


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