Uploaded image for project: 'Ranger'
  1. Ranger
  2. RANGER-4100

Efficient computation of the smallest set of evaluators returned by search of multiple Trie trees

    XMLWordPrintableJSON

Details

    • Improvement
    • Status: Resolved
    • Major
    • Resolution: Fixed
    • None
    • 3.0.0, 2.4.0
    • Ranger
    • None

    Description

      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.

      Attachments

        Activity

          People

            abhayk Abhay Kulkarni
            abhayk Abhay Kulkarni
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

            Dates

              Created:
              Updated:
              Resolved: