SHORTEST SEMIJOIN SCHEDULE FOR A LOCAL AREA DISTRIBUTED DATABASE SYSTEM.

被引：0

作者：

Masuyama, Shigeru ^{[1
]}

Ibaraki, Toshihide ^{[1
]}

Nishio, Shojiro ^{[1
]}

Hasegawa, Toshiharu ^{[1
]}

机构：

[1] Kyoto Univ, Jpn, Kyoto Univ, Jpn

来源：

IEEE Transactions on Software Engineering | 1987年 / SE-13卷 / 05期

关键词：

COMPUTER NETWORKS - Local Networks - DATABASE SYSTEMS - Distributed;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The authors adopt a simplified model of a local area network, imposing no constraint on the transmission line capacity and the communication processing capability at each site. For this model, an efficient algorithm for obtaining the shortest semijoin schedule, in the sense of minimizing the total number of semijoin transmissions, is developed. It is based on a schedule diagram introduced to represent the semijoin schedule.

引用

页码：602 / 606