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

<table><tr><td><table class="algorithm" id="alg3"><tr><td colspan="2"><i><i> </i>mapReduceMerge </i>:: <svg height="14.85" id="M32" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M290 -163h-170v866h170v-28q-79 -7 -94 -19.5t-15 -72.5v-627q0 -59 14.5 -71.5t94.5 -19.5v-28z" id="x5B"></path></g>
</svg><i>Map K</i>11<i> V</i>11<svg height="14.85" id="M33" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M226 -163h-170v27q79 7 94 20t15 73v627q0 59 -15 72t-94 20v27h170v-866z" id="x5D"></path></g>
</svg> <svg height="7.6374998" id="M34" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 22.012501 7.6374998" width="22.012501" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,2.9,7.575)"><path d="M901 255q-71 -62 -185 -187l-22 15l102 147h-727v50h727l-102 147l22 15q114 -125 185 -187z" id="x2192"></path></g>
</svg> <svg height="14.85" id="M35" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M290 -163h-170v866h170v-28q-79 -7 -94 -19.5t-15 -72.5v-627q0 -59 14.5 -71.5t94.5 -19.5v-28z" id="x5B"></path></g>
</svg><i>Map K</i>12<i> V</i>12<svg height="14.85" id="M36" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M226 -163h-170v27q79 7 94 20t15 73v627q0 59 -15 72t-94 20v27h170v-866z" id="x5D"></path></g>
</svg> <svg height="7.6374998" id="M37" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 22.012501 7.6374998" width="22.012501" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,2.9,7.575)"><path d="M901 255q-71 -62 -185 -187l-22 15l102 147h-727v50h727l-102 147l22 15q114 -125 185 -187z" id="x2192"></path></g>
</svg> <svg height="14.85" id="M38" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M290 -163h-170v866h170v-28q-79 -7 -94 -19.5t-15 -72.5v-627q0 -59 14.5 -71.5t94.5 -19.5v-28z" id="x5B"></path></g>
</svg><i>Map K</i>23<i> V</i>33<svg height="14.85" id="M39" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M226 -163h-170v27q79 7 94 20t15 73v627q0 59 -15 72t-94 20v27h170v-866z" id="x5D"></path></g>
</svg></td></tr><tr><td colspan="2"><i><i> </i>mapReduceMerge lTable rTable = moduleMerge </i>(<i>mapReduce</i>1<i> lTable</i>)(<i>mapReduce</i>2<i> rTable</i>)</td></tr></table></td></tr></table>

Mathematical Problems in Engineering

alg3

Algorithm 3

Algorithm 3: An Abstract Description Method of Map-Reduce-Merge Using Haskell 