Short Communication: Fast Min-Hash Joins for Privacy-Preserving Match
Abstract
We optimize Min-Hash joins for approximate entity match on salted identifiers, reaching 4.2� throughput on Spark with bounded recall loss.
Cite this article
Allen, E. (2025). Short Communication: Fast Min-Hash Joins for Privacy-Preserving Match. Research Explorations in Global Knowledge & Technology (REGKT), 4 (1). Retrieved from https://regkt.com/article.php?id=215&slug=short-communication-fast-minhash-joins-privacy-preserving-match