[jira] [Commented] (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=17692932#comment-17692932 ] 

Madhan Neethiraj commented on RANGER-4100:
------------------------------------------

Policy evaluator lookup is updated with the same optimization:

master: [https://github.com/apache/ranger/commit/93e888f7c0d12bd18426a49719fa996f8874d162] 

ranger-2.4: [https://github.com/apache/ranger/commit/0f930c9053d080555544f5e515059e8d292cc22d] 

> 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)