Algorithms, Database, Distributed Systems, Join, Data Processing.
⌈M / B⌉ ⌉) Sort Cost (S): 2N ∙ (1 + ⌈ logB-1 ⌈N / B⌉ ⌉) Merge Cost: (M + N) Total Cost: Sort + Merge The worst case for the merging phase is when the join attribute of all the tuples in both relations contains the same value. Cost: (M ∙ N) + (sort cost) HASH JOIN The high-level idea of the hash