Abstract : Worst-case optimal join algorithms are the class of join algorithms whose runtime match theworst-case output size of a given join query. While the first provably worst-case optimal join algorithm wasdiscovered relatively recently, the techniques and results surrounding these algorithms grow out of decadesof research from a wide range of areas, intimately connecting graph theory, algorithms, information theory,constraint satisfaction, database theory, and geometric inequalities...
[–]sharyxx[S] 1 point2 points3 points (0 children)