Formalization of Multiway-Join Algorithms

Thibault Dardinier

September 16, 2019

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Worst-case optimal multiway-join algorithms are recent seminal achievement of the database community. These algorithms compute the natural join of multiple relational databases and improve in the worst case over traditional query plan optimizations of nested binary joins. In 2014, Ngo, Ré, and Rudra gave a unified presentation of different multi-way join algorithms. We formalized and proved correct their "Generic Join" algorithm and extended it to support negative joins.

License

BSD License

Topics

Session Generic_Join

Depends on

Used by

Cite

× 
@article{Generic_Join-AFP,
  author  = {Thibault Dardinier},
  title   = {Formalization of Multiway-Join Algorithms},
  journal = {Archive of Formal Proofs},
  month   = {September},
  year    = {2019},
  note    = {\url{https://isa-afp.org/entries/Generic_Join.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: