Learn More
Algorithms for computing similarity joins in MapReduce were offered in [2]. Similarity joins ask to find input pairs that are within a certain distance d according to some distance measure. Here we explore the " anchor-points algorithm " of [2]. We continue looking at Hamming distance, and show that the method of that paper can be improved; in particular,(More)
  • 1