GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search
GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search
In this paper, we study the problem of approximate containment similarity search. Given two records Q and X, the containment similarity between Q and X with respect to Q is |Q intersect X|/ |Q|. Given a query record Q and a set of records S, the containment similarity search finds …