Space Lower Bounds for Itemset Frequency Sketches

  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},
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
Optimal Lower Bound for Itemset Frequency Indicator Sketches
Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages
Stratified Sampling Meets Machine Learning
Finding Subcube Heavy Hitters in Analytics Data Streams
Finding Subcube Heavy Hitters in Data Streams
Fingerprinting Codes and the Price of Approximate Differential Privacy


Lower Bounds in Differential Privacy
  • A. De
  • Computer Science, Mathematics
  • TCC
  • 2012