Applications of Information Inequalities to Database Theory Problems

04/24/2023
by   Dan Suciu, et al.
0

The paper describes several applications of information inequalities to problems in database theory. The problems discussed include: upper bounds of a query's output, worst-case optimal join algorithms, the query domination problem, and the implication problem for approximate integrity constraints. The paper is self-contained: all required concepts and results from information inequalities are introduced here, gradually, and motivated by database problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2018

Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems

Worst-case optimal join algorithms are the class of join algorithms whos...
research
06/24/2023

Join Size Bounds using Lp-Norms on Degree Sequences

Estimating the output size of a join query is a fundamental yet longstan...
research
12/24/2018

Integrity Constraints Revisited: From Exact to Approximate Implication

Integrity constraints such as functional dependences (FD), and multi-val...
research
09/21/2023

Information inequality problem over set functions

Information inequalities appear in many database applications such as qu...
research
03/21/2020

Covering the Relational Join

In this paper, we initiate a theoretical study of what we call the join ...
research
05/14/2018

Note on Reverse Pinsker Inequalities

A simple method is shown to provide optimal variational bounds on f-dive...
research
06/24/2019

Bag Query Containment and Information Theory

The query containment problem is a fundamental algorithmic problem in da...

Please sign up or login with your details

Forgot password? Click here to reset