Database Paper Browser

Back to papers

Optimization of Continuous Queries with Shared Expensive Filters

Summary: Adaptive shared execution of expensive filters across many continuous conjunctive queries beats any fixed-order strategy as filter costs rise, despite adaptivity overhead. Shows optimal adaptive planning is NP-hard and ln m-inapproximable; gives a greedy algorithm with O(log^2 m log n) approximation and a precomputation technique to cut runtime overhead. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1431
Venue
PODS
Year
2007
Pagerank
6.2371282e-05
Overall Rank
4,384 | 69.51%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 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