DISTRIBUTED QUERY PROCESSING WITH LOAD BALANCING IN LOCAL AREA NETWORKS
Tallennettuna:
| Julkaisussa: | ProQuest Dissertations and Theses (1985) |
|---|---|
| Päätekijä: | |
| Julkaistu: |
ProQuest Dissertations & Theses
|
| Aiheet: | |
| Linkit: | Citation/Abstract Full Text - PDF |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 303383986 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798413192467 | ||
| 035 | |a 303383986 | ||
| 045 | 0 | |b d19850101 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a LU, HONGJUN | |
| 245 | 1 | |a DISTRIBUTED QUERY PROCESSING WITH LOAD BALANCING IN LOCAL AREA NETWORKS | |
| 260 | |b ProQuest Dissertations & Theses |c 1985 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a This thesis presents a new approach to distributed query processing in locally distributed database systems, load-balanced query processing (LBQP), which integrates distributed query processing and load balancing. Several observations about previous research work in distributed query processing motivated this study. First, only a few query processing algorithms have been developed specifically for distributed databases based on local networks. Second, the use of multiple copies of data to improve performance in a distributed database system has not been addressed by most existing algorithms. Finally, and perhaps most importantly, existing query optimization algorithms have considered only the static characteristics of a distributed database. The algorithm reported here considers the dynamic load status of the system and the existence of multiple copies of data to provide better performance than is achievable with purely static planning techniques. The dynamic query allocation problem for distributed database systems with fully-replicated data was studied first using simulation. Two new heuristic algorithms were proposed for dynamically choosing a processing site for a newly arrived query in a local network environment. In order to obtain empirical experience regarding distributed query processing in local area networks, a testbed was built to conduct experiments on the performance of distributed join algorithms. A three-phase load-balanced query processing algorithm, Algorithm LBQP, was then developed based on these experimental results and the results of the study of dynamic query allocation. This algorithm first statically generates a logical processing plan for a query. A dynamic query unit allocation algorithm is then applied to the plan to determine the processing sites for each relation. Finally, specific processing methods for the distributed joins in the resulting plan are selected. A model of distributed database systems with partially-replicated data was used to investigate the performance of the dynamic query unit algorithm of LBQP. The results showed significant improvements in both the mean waiting time for queries and the overall system throughput. | |
| 653 | |a Computer science | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (1985) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/303383986/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/303383986/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch |