Size Bounds and Query Plans for Relational Joins
From MaRDI portal
Publication:2862210
DOI10.1137/110859440zbMath1276.68066arXiv1711.03860OpenAlexW2169998163MaRDI QIDQ2862210
Dániel Marx, Martin Grohe, Albert Atserias
Publication date: 14 November 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.03860
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Linear programming (90C05)
Related Items
Structural decompositions for problems with global constraints, It's all a matter of degree. Using degree information to optimize multiway joins, Answering conjunctive queries with inequalities, Covers of Query Results, Fractional covers of hypergraphs with bounded multi-intersection, Enumerating homomorphisms, Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries, Linear Programs with Conjunctive Database Queries, General space-time tradeoffs via relational queries, Unnamed Item, Unnamed Item, I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration, Structural tractability of enumerating CSP solutions, Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
