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

Posted to issues@hive.apache.org by "ASF GitHub Bot (Jira)" <ji...@apache.org> on 2020/11/10 03:34:00 UTC

[jira] [Updated] (HIVE-24362) AST tree processing is suboptimal for tree with large number of nodes

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

ASF GitHub Bot updated HIVE-24362:
----------------------------------
    Labels: pull-request-available  (was: )

> AST tree processing is suboptimal for tree with large number of nodes
> ---------------------------------------------------------------------
>
>                 Key: HIVE-24362
>                 URL: https://issues.apache.org/jira/browse/HIVE-24362
>             Project: Hive
>          Issue Type: Bug
>          Components: Hive
>            Reporter: mahesh kumar behera
>            Assignee: mahesh kumar behera
>            Priority: Major
>              Labels: pull-request-available
>          Time Spent: 10m
>  Remaining Estimate: 0h
>
> In hive the children information is stored as list of objects. During processing of the children of a node, the list of object is converted to list of Nodes. This can cause large compilation time if the number of children is large. The list of children can be cached in the AST node to avoid this re-computation. 



--
This message was sent by Atlassian Jira
(v8.3.4#803005)