Name
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. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0306-4379(91)90028-8 | Inf. Syst. |
Keywords | Field | DocType |
query optimization,distributed databases,dynamic programming,distributed database | Query optimization,Computer science,Sargable,Decision tree model,Theoretical computer science,Sort-merge join,Distributed database,Equivalence class,Boolean conjunctive query,Database,Computational complexity theory | Journal |
Volume | Issue | ISSN |
16 | 4 | Information Systems |
Citations | PageRank | References |
2 | 0.43 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasquale Legato | 1 | 282 | 20.44 |
| Giuseppe Paletta | 2 | 224 | 16.20 |
| Luigi Palopoli | 3 | 1387 | 185.69 |