Algorithms for distributional and adversarial pipelined filter ordering problems

DOI10.1145/1497290.1497300zbMath1445.68078OpenAlexW2160921566MaRDI QIDQ4962790

Anne Condon, Ning Wu, Amol Deshpande, Lisa Hellerstein

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1497290.1497300

zbMATH Keywords

query optimizationflow algorithmspipelined filter orderingselection ordering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Database theory (68P15) Nonnumerical algorithms (68W05)

Related Items

Further connections between contract-scheduling and ray-searching problems, Best-of-both-worlds analysis of online search, Weighted online search, Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games, The expanding search ratio of a graph, Max-throughput for (conservative) \(k\)-of-\(n\) testing, Optimization of decentralized multi-way join queries over pipelined filtering services, Unnamed Item, A game theoretic approach to a problem in polymatroid maximization