We investigate the problem of optimizing distributed queries by using semijoins in order to minimize the amount of data communication
between sites. The problem is reduced to that of finding an optimal semijoin sequence that locally fully reduces the relations
referenced in a general query graph before processing the join operations.