Database Paper Browser

Back to papers

Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems

Summary: Addresses evaluating multiple overlapping stream queries with shared filters, a hard extension of set cover, and proposes near-optimal approximations. An edge-coverage Greedy (1+log n+log α) and a randomized Harmonic (2β) algorithm, implemented in a prototype with multimedia stream experiments showing Greedy outperforms alternatives and scales. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3983
Venue
SIGMOD
Year
2008
Pagerank
4.9177481e-05
Overall Rank
6,815 | 52.59%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,429 A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses 2009 VLDB 0.00012033518
1,509 Discovering Queries based on Example Tuples 2014 SIGMOD 0.00011612727
8,252 A Generic Flow Algorithm for Shared Filter Ordering Problems 2008 PODS 4.5497007e-05
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