[jira] [Comment Edited] (RANGER-4100) Efficient computation of the smallest set of evaluators returned by search of multiple Trie trees

["Madhan Neethiraj (Jira)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/RANGER-4100?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17691310#comment-17691310 ] 

Madhan Neethiraj edited comment on RANGER-4100 at 2/23/23 12:20 AM:
--------------------------------------------------------------------

Commit details:

master: [https://github.com/apache/ranger/commit/85f5483ed444bf40caa588ec5b788a51532c3095]

ranger-2.4: [https://github.com/apache/ranger/commit/7ec75608e7bcdfe286885fecaf00ea3a8d7a318f|https://github.com/apache/ranger/commit/85f5483ed444bf40caa588ec5b788a51532c3095]


was (Author: abhayk):
Commit details:

master:

https://github.com/apache/ranger/commit/85f5483ed444bf40caa588ec5b788a51532c3095

> Efficient computation of the smallest set of evaluators returned by search of multiple Trie trees
> -------------------------------------------------------------------------------------------------
>
>                 Key: RANGER-4100
>                 URL: https://issues.apache.org/jira/browse/RANGER-4100
>             Project: Ranger
>          Issue Type: Improvement
>          Components: Ranger
>            Reporter: Abhay Kulkarni
>            Assignee: Abhay Kulkarni
>            Priority: Major
>             Fix For: 3.0.0, 2.4.0
>
>
> The algorithm that computes the intersection of evaluators returned when multiple trie structures are searched depends on the order in which the trie structures are searched. This is sub-optimal, when the evaluators returned by trie structure that is searched earlier happens to be a bigger set then the evaluators by the search of later trie structures.
> This Jira updates the intersection computation to be more optimal and not dependent for performance on the order of search of the trie structures.



--
This message was sent by Atlassian Jira
(v8.20.10#820010)