[jira] [Updated] (HIVE-22731) Support probe decode with row-level filtering

["Panagiotis Garefalakis (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/HIVE-22731?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Panagiotis Garefalakis updated HIVE-22731:
------------------------------------------
    Summary: Support probe decode with row-level filtering  (was: Probe MapJoin hashtables for row level filtering)

> Support probe decode with row-level filtering
> ---------------------------------------------
>
>                 Key: HIVE-22731
>                 URL: https://issues.apache.org/jira/browse/HIVE-22731
>             Project: Hive
>          Issue Type: Improvement
>          Components: Hive, llap
>            Reporter: Panagiotis Garefalakis
>            Assignee: Panagiotis Garefalakis
>            Priority: Major
>              Labels: pull-request-available
>         Attachments: HIVE-22731.1.patch, HIVE-22731.2.patch, HIVE-22731.WIP.patch, decode_time_bars.pdf
>
>          Time Spent: 0.5h
>  Remaining Estimate: 0h
>
> Currently, RecordReaders such as ORC support filtering at coarser-grained levels, namely: File, Stripe (64 to 256mb), and Row group (10k row) level. They only filter sets of rows if they can guarantee that none of the rows can pass a filter (usually given as searchable argument).
> However, a significant amount of time can be spend decoding rows with multiple columns that are not even used in the final result. See figure where original is what happens today and in LazyDecode we skip decoding rows that do not match the key.
> To enable a more fine-grained filtering in the particular case of a MapJoin we could utilize the key HashTable created from the smaller table to skip deserializing row columns at the larger table that do not match any key and thus save CPU time. 
> This Jira investigates this direction. 



--
This message was sent by Atlassian Jira
(v8.3.4#803005)