Name
Abstract | ||
|---|---|---|
In this paper, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3, a shared-memory parallel database system. Our approach enables exploring 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 the case of limited memory. Because DBS3 implements a parallel dataflow execution model, this approach applies to both shared-memory and distributed-memory architectures. Performance measurements run using the DBS3 prototype show the advantages of zigzag trees under various conditions. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/PDIS.1993.253066 | PDIS |
Keywords | Field | DocType |
parallel query processing,better response time,shared-memory parallel database system,performance measurement,zigzag tree,limited memory,distributed-memory architecture,right-deep tree,compile-time optimization,dbs3 prototype,parallel dataflow execution model,shared memory,response time,automatic control,space exploration,parallel programming,search space,measurement,parallelization,database systems,database theory,throughput,distributed databases | Query optimization,Parallel database,Computer science,Parallel computing,Dataflow,Execution model,Database theory,Distributed database,Distributed shared memory,Zigzag | Conference |
ISBN | Citations | PageRank |
0-8186-330-1 | 29 | 7.67 |
References | Authors | |
23 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikal Ziane | 1 | 198 | 36.29 |
| Mohamed Zaït | 2 | 450 | 106.02 |
| Pascale Borla-Salamet | 3 | 70 | 25.10 |
| Borla-Salamet, P. | 4 | 29 | 7.67 |