An Abstract Description Method of Map-Reduce-Merge Using Haskell

Algorithm 12

getPartitionPair lTable rTable =

map (map (∖((lTablet, lNum), (rTablet, rNum))→ (lTablet, rTablet)))        – Step 4

$ map (filter (uncurry partitionSelcetor))                – Step 3

$ [[(pairLeft, pairRight) ∣ pairRight ←rTableNum] ∣ pairLeft ←lTableNum]    – Step 2

where                              – Step 1

  lTableNum = zip lTable [1,2.. ]

  rTableNum = zip rTable [1,2.. ]