Download:
|
by Mikal Ziane, Mohamed Zait, Pascale Borla-salamet, Projet Rodin Inria
The VLDB Journal
http://www-poleia.lip6.fr/~ziane/vldbj93.ps.gz
Add To MetaCart
Abstract:
In this paper, 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 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 case of limited memory. Performance measurements run using the DBS3 prototype show the advantages of zigzag trees under various conditions. 1
Citations
|
368
|
Access path selection in a relational database management system
– Selinger, Astrahan, et al.
- 1979
|
|
146
|
Apers . Dataflow query execution in a parallel main-memory environment
– Wilschut, G
- 1991
|
|
123
|
Dynamic Query Evaluation Plans
– Grafe, Karen
- 1989
|
|
121
|
Benchmarking Database Systems - A Systematic Approach
– Bitton, DeWitt, et al.
- 1983
|
|
120
|
A Performance Evaluation of Four Parallel Join Algorithms in a SharedNothing Multiprocessor Environment
– Schneider, DeWitt
- 1989
|
|
118
|
Encapsulation of Parallelism in the Volcano Query Processing System
– Graefe
- 1990
|
|
96
|
Multiprocessor hash-based join algorithms
– DeWitt, Gerber
- 1985
|
|
92
|
Query Optimization for Parallel Execution
– Ganguly, Hasan, et al.
- 1992
|
|
91
|
Tradeo s in processing complex join queries via hashing in multiprocessor database machines
– Schneider, DeWitt
- 1990
|
|
72
|
Optimization of parallel query execution plans in xprs
– Hong, Stonebraker
- 1991
|
|
72
|
Optimization of large join queries: Combining heuristics and combinatorial techniques
– Swami
- 1989
|
|
71
|
Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization
– Ioannidis, Kang
- 1991
|
|
62
|
Join and Semijoin Algorithms for a Multiprocessor Database Machine
– Valduriez, Gardarin
- 1984
|
|
45
|
Exploiting inter-operation parallelism in XPRS
– Hong
- 1992
|
|
44
|
Parallel Database Systems: The Future of Database Processing or a Passing Fad
– DeWitt, Gray
- 1990
|
|
43
|
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
– Chen, Lo, et al.
- 1992
|
|
35
|
Extending the Search Strategy in a Query Optimizer
– Lanzelotte, Valduriez
- 1991
|
|
33
|
Scheduling and Processor Allocation for Parallel Execution of Multi-Join Queries
– Chen, Yu, et al.
- 1992
|
|
27
|
et al. Prototyping Bubba, a highly parallel database system
– Boral
- 1990
|
|
18
|
Optimization of nonrecursive queries in OODBs
– Lanzelotte, Valduriez, et al.
- 1991
|
|
14
|
Optimization of Object-Oriented Recursive Queries using Cost-Controlled Strategies
– Lanzelotte, Valduriez, et al.
- 1992
|
|
9
|
Parallel Query Processing in DBS3
– Ziane, Zait, et al.
- 1993
|
|
7
|
Prototyping DBS3, a Shared Memory Parallel System
– Bergsten, Couprie, et al.
- 1991
|
|
6
|
Esql2: an extended sql2 with f-logic semantics
– Gardarin, Valduriez
- 1992
|
|
5
|
et al. The design of xprs
– Stonebraker
- 1988
|
|
3
|
et al. Query processing in r
– Lohman
- 1985
|
|
2
|
Compiling control into queries for parallel execution management
– Borla-Salamet, Chachaty, et al.
- 1991
|
|
2
|
Access method selection in a parallel database system (in french
– Zait
- 1990
|
