Construction of relations in relational databases

Using a nonprocedural language for query formulation requires certain automatization of a query answering process. Given a query for creation of a new relation, the problem is to find an efficient procedure which produces this relation from a given relational database. We concentrate upon sequences of join operations which losslessly produce a relation required by a query. A new property of such sequences is analyzed which provides a basis for the presented algorithms that construct an efficient join procedure. The algorithms have polynomial complexity. A modified AND/OR graph is used for the display of a given set of dependencies and a collection of relations representing a database.

[1]  Michael E. Senko,et al.  Data Structures and Data Accessing in Data Base Systems Past, Present, Future , 1977, IBM Syst. J..

[2]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

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

[4]  James R. Pinkert,et al.  An algorithm for servicing multi-relational queries , 1977, SIGMOD '77.

[5]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[6]  Philip A. Bernstein,et al.  Comment on "Decomposition of a Data Base and the Theory of Boolean Switching Functions" , 1977, IBM J. Res. Dev..

[7]  Eliezer L. Lozinskii.  Performance Consideration in Relational Data Base Design , 1978, JCDKB.

[8]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[9]  Sakti P. Ghosh.  Data base organization for data management , 1977 .

[10]  C. Robert Carlson,et al.  A generalized access path model and its application to a relational data base system , 1976, SIGMOD '76.

[11]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[12]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[13]  Leo R. Gotlieb.  Computing joins of relations , 1975, SIGMOD '75.

[14]  Alfred V. Aho,et al.  The Theory of Joins in Relational Data Bases (Extended Abstract) , 1977, FOCS.

[15]  Jyh-Sheng Ke,et al.  Database Skeleton and Its Application to Fuzzy Query Translation , 1978, IEEE Trans. Software Eng..

[16]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[17]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

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

[19]  Jorma Rissanen,et al.  Independent components of relations , 1977, TODS.

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.