Date of Award
Mechanical, Automotive, and Materials Engineering
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
In Distributed Database Systems, the principal objective is to find an execution strategy which minimizes the cost. To find the best strategy, the query processing strategies which are commonly used include joins, semijoins and improvement algorithms. Here, in this thesis, a semijoin query processing strategy is used to find the best execution strategy. In the AHY (Apers-Hevner-Yao) algorithms, the investigations only focus on reducing the amount of transmissions. They make the assumption that the cost to send the packets from any source to any destination is the same and they don't take into consideration the differences in delays in the links on the network. The objective of this thesis is to develop a heuristic which will take the network load along with the size of the data to be transmitted and compare it to the AHY algorithm GENERAL (Response time version).Dept. of Mechanical, Automotive, and Materials Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1995 .B47. Source: Masters Abstracts International, Volume: 34-06, page: 2394. Advisers: Subir Bandyopadhyaya; Joan Morrissey. Thesis (M.Sc.)--University of Windsor (Canada), 1996.
Bethur, Mohan Kumar S., "Response time minimization in distributed query optimization." (1996). Electronic Theses and Dissertations. 3341.