DBScholar

Back to papers

Finding Hierarchical Heavy Hitters in Data Streams

Summary: Introduces Hierarchical Heavy Hitters: nodes whose residual descendant mass exceeds a threshold after discounting heavy descendants, yielding a topological stream summary. Presents deterministic and randomized hierarchy-aware algorithms with substantially improved accuracy over naive methods. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
hdc2e820d4a884740
Venue
VLDB
Year
2003
Pagerank
6.2465183e-05
Overall Rank
5,158 | 65.34%
DOI
10.1016/B978-012722442-8/50048-3

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{cormode_vldb03,
        title = {{Finding Hierarchical Heavy Hitters in Data Streams}},
        author = {Cormode, Graham and Korn, Flip and Muthukrishnan, S. and Srivastava, Divesh},
        journal = {PVLDB},
        series = {{VLDB} '03},
        doi = {10.1016/B978-012722442-8/50048-3},
        url = {https://doi.org/10.1016/B978-012722442-8/50048-3},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
403 Bottom-Up Computation of Sparse and Iceberg CUBEs 1999 SIGMOD 0.00019094951
858 What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically 2003 PODS 0.00013420431
1,725 Gigascope: High Performance Network Monitoring with an SQL Interface 2002 SIGMOD 9.7872746e-05
Previous Page 1 / 1 Next

Semantically Similar Papers