Expand description

Exact sketching algorithms.

This submodule contains the implementation of the exact sketching algorithms as part of a trait.

A sketch is a representation of the similarity between two list of sets.

It is used in cases such as in graphs for representing the similarity between two nodes, de facto providing features that characterize a candidate edge between two nodes.

While in the HyperLogLog case we provide the approximated version of this algorithm, sometimes it is necessary, such as in test cases, to have the exact version of the algorithm. The approximated version is faster and uses less memory, but it is not, of course, guaranteed to be exact. Learn more about the approximated version in the [HyperLogLog.estimated_overlap_and_differences_cardinality_matrices] method.

Traits