Database Paper Browser

Back to papers

Finding Global Icebergs over Distributed Data Sets

Summary: Find global icebergs across many nodes despite items that are globally frequent but locally rare, avoiding prohibitive raw-data shipping. Introduce sampling and CountSketch-based distributed protocols with provable accuracy; CountSketch cuts communication by an order of magnitude while maintaining high accuracy. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1402
Venue
PODS
Year
2006
Pagerank
5.0654592e-05
Overall Rank
6,431 | 55.27%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 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
166 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00039361552
597 Computing Iceberg Queries Efficiently 1998 VLDB 0.00019475592
745 Distributed Top-K Monitoring 2003 SIGMOD 0.00017330487
781 Spectral Bloom Filters 2003 SIGMOD 0.00016741046
848 Approximate Counts and Quantiles over Sliding Windows 2004 PODS 0.0001597308
865 What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically 2003 PODS 0.00015808172
1,003 Adaptive Filters for Continuous Queries over Distributed Data Streams 2003 SIGMOD 0.00014698435
1,136 Chain: Operator Scheduling for Memory Minimization in Data Stream Systems 2003 SIGMOD 0.00013760154
1,340 Scalable Distributed Stream Processing 2003 CIDR 0.00012489223
5,673 Distributed Set-Expression Cardinality Estimation 2004 VLDB 5.3780919e-05
Previous Page 1 / 1 Next

Semantically Similar Papers