# Space Lower Bounds for Itemset Frequency Sketches

@article{Liberty2016SpaceLB, title={Space Lower Bounds for Itemset Frequency Sketches}, author={E. Liberty and M. Mitzenmacher and J. Thaler and Jonathan R. Ullman}, journal={Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems}, year={2016} }

Given a database, computing the fraction of rows that contain a query itemset or determining whether this fraction is above some threshold are fundamental operations in data mining. A uniform sample of rows is a good sketch of the database in the sense that all sufficiently frequent itemsets and their approximate frequencies are recoverable from the sample, and the sketch size is independent of the number of rows in the original database. For many seemingly similar problems there are betterâ€¦Â Expand

#### Topics from this paper

#### 8 Citations

Optimal Lower Bound for Itemset Frequency Indicator Sketches

- Mathematics, Computer Science
- ArXiv
- 2014

Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages

- Computer Science, Mathematics
- KDD
- 2015

Finding Subcube Heavy Hitters in Analytics Data Streams

- Computer Science, Mathematics
- WWW
- 2018

Finding Subcube Heavy Hitters in Data Streams

- Computer Science, Mathematics
- WWW 2018
- 2017

Fingerprinting Codes and the Price of Approximate Differential Privacy

- Computer Science, Mathematics
- SIAM J. Comput.
- 2018