Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Optimize RealtimeDictionaryBasedRangePredicateEvaluator by not scanning the dictionary when cardinality is high #5331

Merged
merged 1 commit into from
May 9, 2020
Merged

Optimize RealtimeDictionaryBasedRangePredicateEvaluator by not scanning the dictionary when cardinality is high #5331

merged 1 commit into from
May 9, 2020

Commits on May 5, 2020

  1. Optimize RealtimeDictionaryBasedRangePredicateEvaluator by not scanni… 

    …ng the dictionary when cardinality is high

For real-time range predicate, because the dictionary is not sorted, in order to get the matching dictionary ids, we have to scan the whole dictionary.
This will cause performance issue when the cardinality is high for the column.
Optimize it by adding a cardinality threshold (1000 for now) to decide whether to pre-calculate all the matching dictionary ids.
    @Jackie-Jiang
    Jackie-Jiang committed May 5, 2020
    Configuration menu
    Copy the full SHA
    021e062 View commit details
    Browse the repository at this point in the history