Application of SQL/N to the attribute-relation associations implicit in functional dependencies

SQL/N is an expressive nonprocedural data base language that is upward compatible with SQL. Its expressive power is derived from both the use of natural quantifiers and the quantification of subsets of relations, in particular the subsets that are the groups of related tuples that occur in associations between relations. We show that SQL/N is also very expressive in specifying requests involving attribute-relation associations, and that attribute-relation associations are implicit in functional dependencies. We show that an attribute-relation association may be derived from the association between an algebraic projection relation and the relation on which the projection operation is performed. Two common cases of attribute-relation associations are investigated: first the case of an association restricted to a single relation, and second a more general attribute-relation association where an attribute from one relation is associated with a second relation.

[1]  E. F. Codd,et al.  Relational database: a practical foundation for productivity , 1982, CACM.

[2]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[3]  David Maier,et al.  Generalized Mutual Dependencies And The Decomposition Of Database Relations , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[4]  Yehoshua Sagiv,et al.  Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies , 1982, JACM.

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

[6]  Claude Delobel,et al.  Decompositions and functional dependencies in relations , 1980, TODS.

[7]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .

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

[9]  David W. Stemple,et al.  Human factors comparison of a procedural and a nonprocedural query language , 1981, TODS.

[10]  Patricia G. Selinger,et al.  Support for repetitive transactions and ad hoc queries in System R , 1981, TODS.

[11]  Seymour Ginsburg,et al.  Properties of functional-dependency families , 1982, JACM.

[12]  James Bradley Introduction to data base management in business , 1983 .

[13]  Jeffrey D. Ullman,et al.  Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization , 1982, JACM.

[14]  J. L. Kuhns LOGICAL ASPECTS OF QUESTION-ANSWERING BY COMPUTER , 1969 .

[15]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[16]  Ronald Fagin,et al.  A normal form for relational databases that is based on domains and keys , 1981, TODS.

[17]  J. Bradley Operations Data Bases , 1978, VLDB.

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

[19]  J. Bradley An extended owner-coupled set data model and predicate calculus for database management , 1978, TODS.