MinHash is a probabilistic data structure for computing `Jaccard similarity`_ between sets. Args: num_perm (int, optional): Number of

`E. Zhu et al. <http://www.vldb.org/pvldb/vol9/p1185-zhu.pdf>`_. Args: threshold (float): Containment阈值 取值范围[0.0, 1.0]。 num_

The :ref:`minhash_lsh` index. It supports query with `Jaccard similarity`_ threshold. Reference: `Chapter 3, Mining of Massive Datasets

Cassandra Client.

OrderedStorage storage implementation using Cassandra as backend. Note: Since we need to (i) select and delete values by both 'key'

OrderedStorage storage implementation using Cassandra as backend. Note: since we are interested in keeping duplicates or ordered dat

A class that handles one dataset

This is a wrapper class around ``defaultdict(list)`` enabling it to support an API consistent with `Storage`

This is a wrapper class around ``defaultdict(set)`` enabling it to support an API consistent with `Storage`

Currently this is not used.

A class that handles the reddit data files

A bufferized version of `redis.pipeline.Pipeline`. The only difference from the conventional pipeline object is the ``_buffer_size``.

Cassandra session shared across all storage instances.

Storage implementation using Cassandra. Note: like other implementations, each storage has its own client. Unlike other

Context manager for batch insertion of documents into a MinHashLSH.

Base class for Redis-based storage containers. Args: config (dict): Redis storage units require a configuration o

Base class for key, value containers where the values are sequences.