[
https://issues.apache.org/jira/browse/LENS-1444?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16353393#comment-16353393
]
Hudson commented on LENS-1444:
------------------------------
FAILURE: Integrated in Jenkins build Lens-Commit #1458 (See
[https://builds.apache.org/job/Lens-Commit/1458/])
LENS-1444: Optimize the algorithm of finding all eligible union (rajatgupta59:
rev a7f407bcb59ffa84c8ab6e830ba98aee81516085)
* (edit)
lens-cube/src/main/java/org/apache/lens/cube/parse/CandidateCoveringSetsResolver.java
> Optimize the algorithm of finding all eligible union candidates
> ---------------------------------------------------------------
>
> Key: LENS-1444
> URL: https://issues.apache.org/jira/browse/LENS-1444
> Project: Apache Lens
> Issue Type: Task
> Components: cube
> Reporter: Rajat Khandelwal
> Assignee: Rajat Khandelwal
> Priority: Major
> Attachments: LENS-1444.01.patch
>
>
> Current algorithm is given {{n}} candidates, first find {{2 ^n^ -1}} union
> candidates using power set and then among them, remove the ones which don't
> cover the queried time range(s).
> Proposed optimization: Pushdown of the prune logic. We'll not create a list
> of {{2 ^n^ -1}} candidates, we'll check for coverability before adding it as
> an eligible union candidate. This will bring down the number of
> {{UnionCandidates}} in the memory and preventing Full-GC.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
