论文信息 - Distributed query evaluation in local area networks

Distributed query evaluation in local area networks

Heuristic strategies to solve multirelational queries in local area networks using broadcast routing are presented. In broadcast routing (used in broadcast and ring networks), data transmitted by one site are received by all the other network sites. This fact is exploited to derive new strategies to minimize a linear combination of query response and total time.

Giovanni Maria Sacco

[1] Philip A. Bernstein,et al. Using Semi-Joins to Solve Relational Queries , 1981, JACM.

[2] Eugene Wong,et al. Decomposition—a strategy for query processing , 1976, TODS.

[3] Wesley W. Chu,et al. Optimal Query Processing for Distributed Database Systems , 1982, IEEE Transactions on Computers.

[4] Alan R. Hevner,et al. The optimization of query processing on distributed database systems , 1979 .

[5] Patrick Valduriez. Semi-join algorithms for multiprocessor systems , 1982, SIGMOD '82.

[6] E. Douglas Jensen,et al. Computer Interconnection Structures: Taxonomy, Characteristics, and Examples , 1975, CSUR.

[7] Giovanni Maria Sacco. Fragmentation: a technique for efficient query processing , 1986, TODS.

[8] Ming T. Liu. Distributed Loop Computer Networks , 1978, Adv. Comput..

[9] Clement T. Yu,et al. On the design of a query processing strategy in a distributed database environment , 1983, SIGMOD '83.

[10] S. B. Yao,et al. Optimization Algorithms for Distributed Queries , 1986, IEEE Transactions on Software Engineering.

[11] Umeshwar Dayal,et al. Optimal semijoin schedules for query processing in local distributed database systems , 1981, SIGMOD '81.