Database Paper Browser

Back to papers

Flow Algorithms for Two Pipelined Filter Ordering Problems

Summary: Presents flow-based O(n^2) algorithms for two pipelined filter-ordering extensions: a distributional parallel-throughput maximization problem and an adversarial minimax multiplicative-regret formulation. Unified flow approach yields optimal orderings and improves prior O(n^3 log n) result. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1391
Venue
PODS
Year
2006
Pagerank
6.3052723e-05
Overall Rank
4,272 | 70.29%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
818 Finding Related Tables 2012 SIGMOD 0.00016311524
2,100 Query Optimization over Web Services 2006 VLDB 9.5443207e-05
6,815 Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems 2008 SIGMOD 4.9177481e-05
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 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
115 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00046221215
143 Optimization of Nonrecursive Queries 1986 VLDB 0.00041510555
1,025 WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web* 2000 SIGMOD 0.00014603741
1,043 Adaptive Ordering of Pipelined Stream Filters 2004 SIGMOD 0.00014476247
2,153 Join Queries with External Text Sources: Execution and Optimization Techniques 1995 SIGMOD 9.4231298e-05
Previous Page 1 / 1 Next

Semantically Similar Papers