3 citations · 6 across the 5 of their papers we have counts for
6 papers
Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue
Daniela Böhm, Georg Gottlob, Matthias Lanzinger +4
Query optimization has played a central role in database research for decades. However, more often than not, the proposed optimization techniques lead to a performance improvement…
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +3
Join queries involving many relations pose a severe challenge to today's query optimisation techniques. To some extent, this is due to the fact that these techniques do not pay suf…
Incremental Updates of Generalized Hypertree Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +1
Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions c…
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +2
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The st…
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Wolfgang Fischl, Georg Gottlob, Davide Mario Longo +1
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been p…
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Wolfgang Fischl, Georg Gottlob, Davide M. Longo +1
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been p…