diff --git a/Report.md b/Report.md index 3db4d14ad60e83939550d3cb05e7af84586b26a0..03d0fbe1a9d09a4551bac9d2f1e56e0ae13e1d91 100644 --- a/Report.md +++ b/Report.md @@ -80,7 +80,7 @@ Collections.sort(wordList, new Comparator<String>() { You can see the output file [here](https://gitlab.my.ecp.fr/2014guom/BigDataProcessAssignment2/blob/master/output/output_preprocess). -All the details are written in my code [Preprocess.java](https://gitlab.my.ecp.fr/2014guom/BigDataProcessAssignment2/blob/master/output/Preprocess.java). +All the details are written in my code [Preprocess.java](https://gitlab.my.ecp.fr/2014guom/BigDataProcessAssignment2/blob/master/Preprocess.java). ## Set-similarity joins > You are asked to efficiently identify all pairs of documents (d1, d2) that are similar (sim(d1, d2) >= t), given a similarity function sim and a similarity threshold t. Specifically, assume that: