Generating computationally-efficient representations of large datasets

A system comprising:

• one or more computers;
• and
• one or more storage devices storing instructions that are operable, when executed on the one or more computers, to cause the one or more computers to:
• generate a computationally-efficient representation of a large input dataset, comprising:
• generate a reduced set of elements that contains fewer elements than the ground set of elements by removing elements from the ground set of elements based on a defined probability;
• and
• generate the computationally-efficient representation by, for each element in the reduced set of elements:
• determine whether the element appears in more than a threshold number of the plurality of sets;
• and
• when the element appears in more than the threshold number of the plurality of sets, remove the element from sets in the plurality of sets until the element appears in only the threshold number of the plurality of sets;
• apply the coverage algorithm to the computationally-efficient representation of the large input dataset to identify a subset of the plurality of sets;
• and
• provide data identifying the subset of the plurality of sets in response to the received request.

One or more non-transitory computer-readable storage mediums comprising instructions stored thereon that are executable by a processing device and upon such execution cause the processing device to perform operations of:

• generating a computationally-efficient representation of a large input dataset, comprising:
• generating a reduced set of elements that contains fewer elements than the ground set of elements by removing elements from the ground set of elements based on a defined probability;
• and
• generating the computationally-efficient representation by, for each element in the reduced set of elements:
• determining whether the element appears in more than a threshold number of the plurality of sets;
• and
• when the element appears in more than the threshold number of the plurality of sets, removing the element from sets in the plurality of sets until the element appears in only the threshold number of the plurality of sets;
• applying the coverage algorithm to the computationally-efficient representation of the large input dataset to identify a subset of the plurality of sets;
• and
• providing data identifying the subset of the plurality of sets in response to the received request.