Finding Frequent Items in Data Streams
Summary: Unified framework and baseline implementations for comparing frequent-item stream algorithms, correcting fragmented prior evaluations. Extensive experiments reveal substantial performance variation: top methods achieve high accuracy with tens of KB memory at millions of items/sec. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Graham Cormode (AT&T)
- 2. Marios Hadjieleftheriou (AT&T)
BibTeX Citation
@article{cormode_vldb08,
title = {{Finding Frequent Items in Data Streams}},
author = {Cormode, Graham and Hadjieleftheriou, Marios},
journal = {PVLDB},
series = {{VLDB} '08},
volume = {1},
number = {2},
pages = {1530--1541},
doi = {10.14778/1454159.1454238},
url = {https://doi.org/10.14778/1454159.1454238},
year = {2008}
}
Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 83 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00035962466 |
| 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00030586757 |
| 710 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.00014603777 |
| 863 | How to Summarize the Universe: Dynamic Maintenance of Quantiles | 2002 | VLDB | 0.00013390792 |
| 2,750 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 8.0569441e-05 |
| 2,876 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS | 7.9156746e-05 |
| 3,039 | Estimating Statistical Aggregates on Probabilistic Data Streams | 2007 | PODS | 7.723493e-05 |
| 3,096 | Holistic UDAFs at Streaming Speeds | 2004 | SIGMOD | 7.6497893e-05 |
| 3,928 | Statistical Analysis of Sketch Estimators | 2007 | SIGMOD | 6.9160175e-05 |
| 4,099 | Fast Data Stream Algorithms using Associative Memories | 2007 | SIGMOD | 6.8061151e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,028 | Finding Persistent Items in Data Streams | 2017 | VLDB |
| 2 | 2,876 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS |
| 3 | 8,773 | Stream Frequency over Interval Queries | 2019 | VLDB |
| 4 | 14,313 | Mining Frequent Itemsets with Bit Strings and Trie | 2002 | VLDB |
| 5 | 9,399 | Feasible Itemset Distributions in Data Mining: Theory and Application | 2003 | PODS |
| 6 | 11,951 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 7 | 6,255 | Finding Frequent Items in Probabilistic Data | 2008 | SIGMOD |
| 8 | 12,473 | Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams | 2014 | SIGMOD |
| 9 | 4,782 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB |
| 10 | 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |