Database Paper Browser

Back to papers

Sketching Probabilistic Data Streams

Summary: First sublinear-space, sublinear-time algorithms for aggregating probabilistic data streams under possible-worlds semantics. Introduces concise streaming sketches extending conventional sketching to probabilistic streams to approximate distributions of complex aggregates (distinct counts, joins) with randomized guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3858
Venue
SIGMOD
Year
2007
Pagerank
7.6697078e-05
Overall Rank
3,041 | 78.85%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers