Applications of entropic inequalities to query evaluation

We describe the main ingredients of the PANDA algorithm for evaluating Boolean Conjunctive Queries, whose time complexity is expressed in terms of the submodular width of the query. The main principle behind the algorithm is to convert proofs of entropic inequalities into algorithmic steps. I will describe this first on a simple example consisting of a full conjunctive query, then will describe it for a Boolean query.