Details
-
New Feature
-
Status: Closed
-
Major
-
Resolution: Fixed
-
None
Description
We are proposing an enhanced hash join algorithm called “hybrid hybrid grace hash join”.
We can benefit from this feature as illustrated below:
- The query will not fail even if the estimated memory requirement is slightly wrong
- Expensive garbage collection overhead can be avoided when hash table grows
- Join execution using a Map join operator even though the small table doesn't fit in memory as spilling some data from the build and probe sides will still be cheaper than having to shuffle the large fact table
The design was based on Hadoop’s parallel processing capability and significant amount of memory available.
Attachments
Attachments
Issue Links
- is related to
-
HIVE-10287 Implement Hybrid Hybrid Grace Hash Join for Spark Branch [Spark Branch]
- Open
-
HIVE-10123 Hybrid grace Hash join : Use estimate key count from stats to initialize BytesBytesMultiHashMap
- Closed
-
HIVE-10284 enable container reuse for grace hash join
- Closed
-
HIVE-9789 Hybrid Hybrid Grace Hash Join: improve hashtable serialization
- Open
-
HIVE-9790 Hybrid Hybrid Grace Hash Join: improve side file serialization
- Open
-
HIVE-10072 Add vectorization support for Hybrid Grace Hash Join
- Closed
-
HIVE-10403 Add n-way join support for Hybrid Grace Hash Join
- Closed
- is required by
-
HIVE-11306 Add a bloom-1 filter for Hybrid MapJoin spills
- Closed
- links to