hive-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jesus Camacho Rodriguez (JIRA)" <>
Subject [jira] [Updated] (HIVE-11398) Parse wide OR and wide AND trees to flat OR/AND trees
Date Thu, 06 Aug 2015 10:12:04 GMT


Jesus Camacho Rodriguez updated HIVE-11398:
    Attachment: HIVE-11398.2.patch

[~gopalv], new patch fixes the issues with the optimization; triggering a new QA run.
There are some changes in vectorization tests (vectorization mode gets disabled) that I guess
will be solved once [~mmccline] patches go in?

> Parse wide OR and wide AND trees to flat OR/AND trees
> -----------------------------------------------------
>                 Key: HIVE-11398
>                 URL:
>             Project: Hive
>          Issue Type: New Feature
>          Components: Logical Optimizer, UDF
>    Affects Versions: 1.3.0, 2.0.0
>            Reporter: Gopal V
>            Assignee: Jesus Camacho Rodriguez
>         Attachments: HIVE-11398.2.patch, HIVE-11398.patch
> Deep trees of AND/OR are hard to traverse particularly when they are merely the same
structure in nested form as a version of the operator that takes an arbitrary number of args.
> One potential way to convert the DFS searches into a simpler BFS search is to introduce
a new Operator pair named ALL and ANY.
> ALL(A, B, C, D, E) represents AND(AND(AND(AND(E, D), C), B), A)
> ANY(A, B, C, D, E) represents OR(OR(OR(OR(E, D), C),B),A)
> The SemanticAnalyser would be responsible for generating these operators and this would
mean that the depth and complexity of traversals for the simplest case of wide AND/OR trees
would be trivial.

This message was sent by Atlassian JIRA

View raw message