Date of Award

2001

Degree Type

Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Morrissey, J.,

Keywords

Computer Science.

Rights

CC BY-NC-ND 4.0

Abstract

The utilizing of semi-join is often a common starting point for join algorithms in distributed databases. It helps reduce the quantity of data transferred between sites. In our thesis, we propose an algorithm, based on the semi-join operator. By utilizing the maximum reduction capability of the semi-join operation, we use our algorithm to reduce the query relations as much as possible. In order to improve the reduction ability of our algorithm, we combine composite semi-joins into our algorithm. Usually, composite semi-join may produce more reduction than separate simple semi-joins in our algorithm with more time costs. Although a composite semi-join itself may not be beneficial because of its more total time costs, it always is gainful to the execution of subsequent join operations. Our proposed algorithm is evaluated objectively against the effects of a full reducer and the total cost of initial feasible solution (IFS). It has been shown that the algorithm gives substantial reductions on relations and total costs. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2000 .L443. Source: Masters Abstracts International, Volume: 40-03, page: 0724. Adviser: J. Morrissey. Thesis (M.Sc.)--University of Windsor (Canada), 2001.

Share

COinS