Bounds and Algorithms for joins via fractional edge covers

Abstract

Among the operations of relational algebra, the join operation tends to be the most costly. There is a wealth of research in the database literature devoted to efficient join processing. Short of fully computing the result of a join or a sequence of joins (we use the term join query in the following), in many applications it is also important to get good bounds on the size of the result. © 2013 Springer-Verlag Berlin Heidelberg.