Taxonomy and formal properties of distributed joins

Abstract A general framework for studying the properties of joins between fragmented relations is presented. A join between fragmented relations can be performed as a set of partial joins between their fragments and can be represented as a join graph. A taxonomy of join graphs is developed. Rules are given for determining the class of a join graph from the properties of the fragmentation of relations and from semantic knowledge of different types of database dependencies. The fact that a join graph belongs to a given class is relevant for the efficiency of join execution; two typical application areas of these results are the design of distributed databases and the optimization of distributed queries.

[1]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[2]  Stefano Ceri,et al.  Allocation of Operations in Distributed Database Access , 1982, IEEE Transactions on Computers.

[3]  Stefano Ceri,et al.  Horizontal data partitioning in database design , 1982, SIGMOD '82.

[4]  Shi-Kuo Chang,et al.  A Methodology for Structured Database Decomposition , 1980, IEEE Transactions on Software Engineering.

[5]  Stefano Ceri,et al.  Correctness of query execution strategies in distributed databases , 1983, TODS.

[6]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

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

[8]  David Maier,et al.  Fragments of Relations: First Hack , 1981, XP2 Workshop on Relational Database Theory.

[9]  Eugene Wong,et al.  Query processing in sdd-i: a system for distributed databases , 1979 .

[10]  Alfred V. Aho,et al.  The theory of joins in relational data bases , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Jeffrey Ullman,et al.  Principles of Data Base Systems , 1980 .

[12]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, TODS.

[13]  Shamkant B. Navathe,et al.  Distribution Design of Logical Database Schemas , 1983, IEEE Transactions on Software Engineering.

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

[15]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[16]  Eugene Wong,et al.  Introduction to a system for distributed databases (SDD-1) , 1980, TODS.

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