Efficient algorithms for resource allocation in distributed and parallel query processing environments
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 316-323
- https://doi.org/10.1109/icdcs.1989.37961
Abstract
Several effective algorithms are presented for the optimal allocation of computer resources in a proposed stream-oriented parallel-processing scheme for database operations. These algorithms can be utilized to obtain the optimal allocation of memory resources for every type of query in sequential-processing environments, parallel-processing environments with shared-memory multiprocessors, and distributed-processing environments. The computation complexities of the proposed algorithms are analyzed and used to clarify the effectiveness of those algorithms Author(s) Liu, P. Inst. of Inf. Sci. & Electron., Tsukuba Univ., Japan Kiyoki, Y. ; Masuda, T.Keywords
This publication has 10 references indexed in Scilit:
- A Stream-Oriented Approach to Parallel Processing for Deductive DatabasesPublished by Springer Nature ,1988
- Distributed query processingACM Computing Surveys, 1984
- A Survey of Proposed Architectures for the Execution of Functional LanguagesIEEE Transactions on Computers, 1984
- Estimating block transfers and join sizesPublished by Association for Computing Machinery (ACM) ,1983
- Performance Analysis of Alternative Database Machine ArchitecturesIEEE Transactions on Software Engineering, 1982
- Operating system support for database managementCommunications of the ACM, 1981
- Processor allocation strategies for multiprocessor database machinesACM Transactions on Database Systems, 1981
- Access path selection in a relational database management systemPublished by Association for Computing Machinery (ACM) ,1979
- Decomposition—a strategy for query processingACM Transactions on Database Systems, 1976
- Optimizing the performance of a relational algebra database interfaceCommunications of the ACM, 1975