[
https://issues.apache.org/jira/browse/HIVE-11398?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14680884#comment-14680884
]
Hive QA commented on HIVE-11398:
--------------------------------
{color:red}Overall{color}: -1 at least one tests failed
Here are the results of testing the latest attachment:
https://issues.apache.org/jira/secure/attachment/12749637/HIVE-11398.5.patch
{color:red}ERROR:{color} -1 due to 2 failed/errored test(s), 9305 tests executed
*Failed tests:*
{noformat}
TestMiniSparkOnYarnCliDriver - did not produce a TEST-*.xml file
org.apache.hive.hcatalog.streaming.TestStreaming.testTransactionBatchCommit_Json
{noformat}
Test results:
http://ec2-174-129-184-35.compute-1.amazonaws.com/jenkins/job/PreCommit-HIVE-TRUNK-Build/4909/testReport
Console output:
http://ec2-174-129-184-35.compute-1.amazonaws.com/jenkins/job/PreCommit-HIVE-TRUNK-Build/4909/console
Test logs:
http://ec2-174-129-184-35.compute-1.amazonaws.com/logs/PreCommit-HIVE-TRUNK-Build-4909/
Messages:
{noformat}
Executing org.apache.hive.ptest.execution.PrepPhase
Executing org.apache.hive.ptest.execution.ExecutionPhase
Executing org.apache.hive.ptest.execution.ReportingPhase
Tests exited with: TestsFailedException: 2 tests failed
{noformat}
This message is automatically generated.
ATTACHMENT ID: 12749637 - PreCommit-HIVE-TRUNK-Build
> Parse wide OR and wide AND trees to flat OR/AND trees
> -----------------------------------------------------
>
> Key: HIVE-11398
> URL: https://issues.apache.org/jira/browse/HIVE-11398
> 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.3.patch,
> HIVE-11398.4.patch, HIVE-11398.5.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
(v6.3.4#6332)
