[
https://issues.apache.org/jira/browse/KUDU-1644?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16873487#comment-16873487
]
Todd Lipcon commented on KUDU-1644:
-----------------------------------
This optimization can even happen at the DRS level, which is useful for IN-list
on PK prefixes. For example, we may have {{PK IN ('foo', 'bar')}} but within a
given DRS we know from the DRS row bounds that we have an implied predicate
{{PK BETWEEN 'apple' and 'cat'}}. If we merge that implied predicate with the
IN list, it simplifies to {{PK = 'bar'}} which can be evaluated as a range scan.
This isn't as general as the proposal in KUDU-2875, but in the common case of a
well-compacted table, it could possibly have almost the same level benefit vs
the naive full scan of the PK column.
> Simplify IN-list predicate values based on tablet partition key bounds
> ----------------------------------------------------------------------
>
> Key: KUDU-1644
> URL: https://issues.apache.org/jira/browse/KUDU-1644
> Project: Kudu
> Issue Type: Sub-task
> Components: tablet
> Reporter: Dan Burkert
> Priority: Major
>
> When new scans are optimized by the tablet, the tablet's partition key bounds
> aren't taken into account in order to remove predicates from the scan. One
> of the most important such optimizations is that IN-list predicates could
> remove values based on the tablet's constraints.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
