Name
Abstract | ||
|---|---|---|
. This paper describes a new methodological framework forrelational parallel query optimization. This model is based on two conceptualfeatures. First, the query optimization is structured in two modules(inter-operator parallelism and intra-operator parallelism); second,the intra-operator parallelism is encapsulated into a single parallel matchoperator. A theoretical comparative study of the three main match algorithmsis proposed.Keywords: Parallel query optimization, match... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-61695-0_11 | ACPC |
Keywords | Field | DocType |
parallel query optimization,algorithm com- plexity,shared-nothing architecture.,parallel match operator,intra-operation parallelism,match operator,query optimization,shared nothing architecture | Query optimization,Instruction-level parallelism,Task parallelism,Computer science,Parallel computing,Shared nothing architecture,Data parallelism,Operator (computer programming),Hash function,Nested loop join | Conference |
ISBN | Citations | PageRank |
3-540-61695-0 | 1 | 0.64 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nadejda Biscondi | 1 | 20 | 16.95 |
| Lionel Brunie | 2 | 686 | 126.62 |
| André Flory | 3 | 165 | 102.68 |
| Harald Kosch | 4 | 775 | 116.64 |