.png){kind=icon}
Return
An Executable Specification of Map-Join-Reduce Using Haskell
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2891285.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Map-Join-Reduce programming model effectively supports the join operation among different heterogeneous data sets by adding the Join module and processes the multiway joining directly. In this paper, we propose a rigorous description of the Map-Join-Reduce that performs as an executable specification. First, this paper briefly introduces the differences between the Map-Join-Reduce and the MapReduce. Then, we use Haskell to specify each module of the Map-Join-Reduce programming model and analyze the structure and function of each module. Finally, we test the specification by analyzing an example of the mall sales records. The executable specification contributes to helping the developers to unscramble the relationship between the MapReduce and the Map-Join-Reduce, which may serve as a basis for further development of the theory of related programming model design. Furthermore, the most important function of an executable specification is guaranteeing the target informal or semi-formal model with interesting properties. This paper is a forward step to prepare for verifying related properties and, even, providing verified prototypes.
Keywords:
Cloud computing
executable specification
programming model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
pH Dependence of the Four Individual Transitions in the Catalytic S-Cycle during Photosynthetic Oxygen Evolution.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSaveShareSaveShareSaveSHadoop: Improving MapReduce performance by optimizing job execution mechanism in Hadoop clusters
PREAI
ShareSaveShareSave
View more