Title
Scheduling Queries For Parallel Execution On Multicomputer Database Management System
Abstract
In this paper, we investigate two scheduling approaches for multicomputer-based parallel database systems: The competition.based technique allows queries to compete freely for computing resources, while the planning-based scheme relies on a centralized scheduler to plan the execution of all queries. Our studies show that competition-based though provides impressive performance, the planning-based is consistently the better approach.
Publication Date
1-1-1996
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
1134 LNCS
Number of Pages
698-707
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/bfb0034723
Copyright Status
Unknown
Socpus ID
84865974248 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/84865974248
STARS Citation
Lo, Yu Lung; Hua, Kien A.; and Tavanapong, Wallapak, "Scheduling Queries For Parallel Execution On Multicomputer Database Management System" (1996). Scopus Export 1990s. 2199.
https://stars.library.ucf.edu/scopus1990/2199