Assume, that a text file crime-stories.txt contain the texts of the large number of crime stories. Assume,
Fantastic news! We've Found the answer you've been seeking!
Question:
Assume, that a text file patterns.txt contains the text patterns, for example regular expressions. Assume, that the file is formatted, such that one pattern is located in one line of the text file.
To simplify the problem, assume that all text patterns in a file patterns.txt are distinct. Finally, assume that a function match(text-line, text-pattern) returns true when text line matches a pattern text-pattern. Otherwise, the function returns false.
You must specify the parameters (if any) of your application and the key-value data in the input and output of the Map and Reduce stages.
There is no need to write Java code, however, if you like it then it is all right to do so. The precise explanations in plain English or in a pseudocode will do. Please note, that if you decide to use pseudocode then your explanations must precisely explain what happens at each stage of Map- Reduce application
Related Book For
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill
Posted Date: