Abhay Kulkarni created RANGER-4100:
--------------------------------------
Summary: Compute 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
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)
