Parallel pipelined filter ordering with precedence constraints

DOI10.1145/2344422.2344431zbMATH Open1295.68106OpenAlexW2010712525MaRDI QIDQ3189084FDOQ3189084

Authors: Amol Deshpande, Lisa Hellerstein 

Publication date: 9 September 2014

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

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

Recommendations

• Algorithms for distributional and adversarial pipelined filter ordering problems
• Database Theory - ICDT 2005
• Publication:4952618
• Max-throughput for (conservative) \(k\)-of-\(n\) testing
• Scheduling of pipelined operator graphs

zbMATH Keywords

sequential testingquery optimizationflow algorithmspipelined filter orderingparallel databases

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Database theory (68P15)

Cited In (4)

• Fault-Tolerance Distributed Control Plane for Software Defined Networks
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Max-throughput for (conservative) \(k\)-of-\(n\) testing
• Allowable processing orders in the accelerated cascade algorithm

This page was built for publication: Parallel pipelined filter ordering with precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189084)