Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Size bounds and query plans for relational joins

Autor
Atserias, A.; Grohe, M.; Marx, D.
Tipus d'activitat
Article en revista
Revista
SIAM journal on computing
Data de publicació
2013
Volum
42
Número
4
Pàgina inicial
1737
Pàgina final
1767
DOI
https://doi.org/10.1137/110859440 Obrir en finestra nova
Resum
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often dominated by the output size, it is an important task for database query optimizers to compute estimates on the size of joins and to find good execution plans for sequences of joins. We study these problems from a theoretical perspective, both in the worst-case model and in an average-case model where the database is chosen...
Paraules clau
Database query, Fractional edge cover, Join, Linear programming, Query plan
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants