MapReduce and Design Patterns - Binning Pattern Overview
https://www.tutorialspoint.com/market/index.asp
Get Extra 10% OFF on all courses, Ebooks, and prime packs, USE CODE: YOUTUBE10
Show More Show Less View Video Transcript
0:00
In this video we are discussing binning pattern overview
0:04
It is one kind of partitioning pattern. And here in this case we'll be having only the mapper, there will be no combiner
0:12
no partitioner, no reducer. So here the dataset will be divided into multiple different output files and one bin will
0:21
have multiple output files. So now depending upon the criteria for which this mapper will iterate through the data
0:29
it will send the respective record to the respective output file depending upon the matching of
0:35
the criteria. So this is the basic concept of this Beaning Pattern overview
0:40
So let us discuss more on it. So what is Beaning pattern
0:46
It is also like the partitioning pattern and it separates the data into different categories
0:52
and but not care about the orders. So the depending upon the category, depending upon the criteria, the records will be
0:58
be divided into multiple different output files but it will not bother for the ordering of those
1:05
records. So in the binning pattern it splits the data into map phase because here we're having
1:11
only the mappers. Now each mapper will have separate files per output bins. So a mapper
1:17
can will produce multiple output files and obviously that is a problem. If the system is having
1:23
millions of such mappers then so many output files will get generated and obviously that will be a challenge for the name node scalability So if the number of the mapper is large enough it can generate millions of such
1:38
output files, so this will create a bad effect on the name node scalability. So these are the
1:45
problems with this vining pattern. Now, binning pattern structure. So the mapper iterates
1:52
through the list of different criteria for each bin and when the record matches it will
1:58
be sent to the respective bin. So it will search for the criteria and list of criteria will be there and it will go on
2:05
iterating on those criteria and then depending upon the match, the record will be sent
2:11
to the respective bin. No combiner, partitioner, reducers are used in this pattern
2:18
So from this very diagram you can easily find that here we are having only the bin
2:22
mappers which are taking this inputs from the input splits. So here we are having multiple input splits and multiple billing mapper are working at the
2:31
same time in parallel and they are producing multiple output files. And obviously when the number of mappers will be millions of such and whenever we are having
2:41
such huge number of output files that will be a challenge for the name node scalability
2:48
So in this particular video we have given you only the beening pattern overview
2:52
In the next video we will be going for the implementation of the same. Please watch also the next video for you better understanding
2:59
Thanks for watching this
#Enterprise Technology
#Data Management
#Programming
#Software
#Computer Science
#Computer Education

