[jira] [Created] (LENS-1444) Optimize the algorithm of finding all eligible union candidates

["Rajat Khandelwal (JIRA)" <ji...@apache.org>]

Rajat Khandelwal created LENS-1444:
--------------------------------------

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


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
(v6.4.14#64029)