Date of Award

1994

Publication Type

Master Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Bandyopadhyay, S.

Keywords

Computer Science.

Rights

info:eu-repo/semantics/openAccess

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Abstract

The technology of distributed databases (DDB) is based on two other technologies which have developed a sufficiently solid foundation during the seventies: computer networks technology and database technology. One of the main difficulties in distributed database systems is to select an execution strategy that minimizes resource consumption. Some optimization strategies such as AHY (Apers-Hevner-Yao) Algorithms only focus on reducing the amount of transmissions. They assume that the cost to transmit the packets from one site to another site is the same. However, this is not true in the real world, since the cost of transmission is dependent on the network load situation. Therefore, it is possible to develop some heuristics which consider the network load as well. The objective of this thesis is to develop some heuristics which will take the network load into account and to compare the result with the AHY Algorithms. Source: Masters Abstracts International, Volume: 33-04, page: 1269. Advisers: Subir Bandyopadhyay; Joan Morrissey. Thesis (M.Sc.)--University of Windsor (Canada), 1994.

Share

COinS