Parallel Query Execution Algorithms
Partitioned query execution
Parallel query execution algorithms employ multiple threads that together execute a single query execution plan, with the goal of increased processing bandwidth and decreased response time. Multiple forms of parallelism may be employed in isolation or in combination. Most parallel query execution algorithms are serial algorithms executed in multiple threads, usually with no or only minor adaptations to function correctly or efficiently in the multi-threaded environment.
Set-oriented query languages and the relational algebra have given rise to query optimization and parallel database processing almost from their beginning in the 1970s. They represented a new complexity or liability in database software design as non-procedural languages and physical data independence prevent users from specifying query processing steps and thus require an automatic system component to provide plans for data access and for query...
- 1.Bratbergsengen K. Hashing methods and relational algebra operations. In: Proceedings of the 10th International Conference on Very Large Data Bases; 1984. p. 323–33.Google Scholar
- 2.DeWitt DJ, Gerber RH, Graefe G, Heytens ML, Kumar KB, Muralikrishna M. GAMMA – a high performance dataflow database machine. In: Proceedings of the 12th International Conference on Very Large Data Bases; 1986. p. 228–37.Google Scholar
- 3.Fushimi S, Kitsuregawa M, Tanaka H. An overview of the system software of a parallel relational database machine GRACE. In: Proceedings of the 12th International Conference on Very Large Data Bases; 1986. p. 209–19.Google Scholar