The paper presents a structured approach to the problem of minimizing the join cost in a relational distributed environment. A tree model is used to represent a query and a set of tree equivalence classes for query representation is identified corresponding to the space of all the feasible strategies to execute the query. The optimal strategy is then chosen by a dynamic programming approach which exploits the properties of the tree model, although the computational complexity remains exponential in the size of the problem

Optimization of join strategies in distributed databases

LEGATO Pasquale;PALETTA Giuseppe;PALOPOLI Luigi
1991

Abstract

The paper presents a structured approach to the problem of minimizing the join cost in a relational distributed environment. A tree model is used to represent a query and a set of tree equivalence classes for query representation is identified corresponding to the space of all the feasible strategies to execute the query. The optimal strategy is then chosen by a dynamic programming approach which exploits the properties of the tree model, although the computational complexity remains exponential in the size of the problem
Distributed databases; dynamic programming; query optimization
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/137121
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact