DBScholar

Back to papers

A Generic Flow Algorithm for Shared Filter Ordering Problems

Summary: Flow-maximization for evaluating overlapping conjunctive boolean queries with shared filters on heterogeneous parallel processors, maximizing throughput under processor capacity constraints. Generic iterative algorithm uses a single-processor min-cost filter-ordering oracle to build parallel plans while preserving essentially the oracle’s approximation ratio, enabling many filter-ordering variants to be optimized in parallel. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1447
Venue
PODS
Year
2008
Pagerank
5.4252897e-05
Overall Rank
8,437 | 42.12%
DOI
10.1145/1376916.1376929

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{liu_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{A Generic Flow Algorithm for Shared Filter Ordering Problems}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376929},
        doi = {10.1145/1376916.1376929},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Liu, Zhen and Parthasarathy, Srinivasan and Ranganathan, Anand and Yang, Hao},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,022 A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses 2009 VLDB 0.00012602841
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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