Name
Abstract | ||
|---|---|---|
In this article, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3 or EDS. DBS3 is a shared-memory parallel database system, while the EDS system has a distributed-memory architecture. Because DBS3 implements a parallel dataflow execution model, this approach applies to both architectures. Using randomized search strategies enables the exploration of a search space large enough to include zigzag trees, which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in case of limited memory. Performance measurements obtained using the DBS3 prototype show the advantages of zigzag trees under various conditions. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/BF01228672 | VLDB J. |
Keywords | Field | DocType |
Search space,pipeline,fragmentation,cost function | Architecture,Parallel database,Computer science,Parallel computing,Response time,Dataflow,Execution model,Zigzag,Database | Journal |
Volume | Issue | Citations |
2 | 3 | 19 |
PageRank | References | Authors |
8.92 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikal Ziane | 1 | 198 | 36.29 |
| Mohamed Zaït | 2 | 450 | 106.02 |
| Pascale Borla-Salamet | 3 | 70 | 25.10 |