Maintaining k -MinHash Signatures over Fully-Dynamic Data Streams with Recovery
Andrea E. F. Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota · 2025
We consider the task of performing Jaccard similarity queries over a large collection of items that are dynamically updated according to a streaming input model. An item here is a subset of a large universe U of elements. A well-studied approach to address this important problem in data mining is to design fast-similarity data sketches. In this paper, we focus on global solutions for this problem, i.e., a single data structure which is able to answer both Similarity Estimation and All-Candidate Pairs queries, while also dynamically managing an arbitrary, online sequence of element insertions and deletions received in input.