|
ABSTRACT
In this paper query organization, execution, and optimization in the database machine DIRECT are discussed. We demonstrate that the use of a monitor for each relation referenced by a query along with the use of the NEXT PAGE construct permits the DIRECT back-end controller to assign a query to any number of processors for execution. Furthermore, these constructs also permit the controller to balance the load in the back-end by dynamically adjusting how many processors are assigned to each executing query.We also identify the problem of relation fragmentation which occurs when a query is executed by several processors in parallel and develop a technique for estimating the optimal number of processors to compress a relation so that the execution time of the entire query is minimized. These results appear to be applicable to all database machines which employ parallel processing techniques to enhance query execution.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
Dewitt, D.J., "DIRECT --- A Multiprocessor Organization for Supporting Relational Database Management Systems," IEEE Transactions on Computers, June 1979. Also: Computer Sciences Technical Report #325, Univ. of Wisconsin, June 1978.
|
| |
3
|
Ozkarahan, E.A., Schuster, S.A., and K.C. Smith, "RAP --- An associative processor for database management," Proceedings of the 1975 NCC, pp. 379--386.
|
| |
4
|
Schuster, S.A., Ozkarahan, E.A., and K.C. Smith, "A virtual memory system for a relational associative processor," Proceedings of the 1976 NCC, pp. 855--862.
|
 |
5
|
|
 |
6
|
|
 |
7
|
|
|