Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, C. Beeri, and J. D. Ullman, “The theory of joins in relational data bases,”ACM Trans. Database Syst. 4(3):297–314 (1979).
W. W. Armstrong, “Decompositions and functional dependencies in relations,”A CM Trans. Database Syst. 5(4):404–430 (1980).
C. Beeri and P. A. Bernstein, “Computational problems related to the design of normal form relational schemas,”ACM Trans. Database Syst. 4(1):30–59 (1979).
J. Bradley, “Operations data bases,”Proc. ACM Conf. VLDB 164–176 (Berlin, 1978).
J. Bradley, “An extended owner-coupled set data model and predicate calculus for data base management,”ACM Trans. Database Syst. 3(4):385–416 (1978).
J. Bradley, “Application of a user-friendliness measure to the SQL and EOS data base retrieval languages,”Proc. CIPS Conf., 921–927 (Waterloo, Ontario, 1981).
J. Bradley,File & data-base techniques (Holt, Tinehart & Winston, New York, 1982).
J. Bradley,Introduction to data base management in business (Holt, Rinehart and Winston, New York, 1983).
J. Bradley, “SQL/N and modes of association,” (available from Computer Science Department, University of Calgary, Alberta).
J. Bradley, “SQL/N: a natural quantifier extension to SQL,” (available from Computer Science Department, University of Calgary, Alberta).
J. Bradley, “A comprehensive guide to the nonprocedural database language SQL/N,” Volume 1:Language Capabilities, Volume 2:Implemented's Guide (Polyinformatics Press, Saanichton, B. C., 1984).
D. D. Chamberlin,et al., “Support for repetitive transactions and ad hoc queries in System R.,”ACM Trans. Database Syst.,6(1):79–94 (1981).
CODASYL, DDLC JOD, 1981, available from Federal Department of Supply and Services, Hull, Quebec, Canada.
CODASYL, COBOL Committee JOD, 1981, available from Federal Department of Supply and Services, Hull, Quebec, Canada.
E. F. Codd, “Further normalization of the database relational model,” inCourant Computer Science Symposium Series (Prentice-Hall, New York, 1972), Vol. 6, pp. 33–64.
E. F. Codd, “Relational completeness of database sub-languages,” inCourant Computer Science Symposium Series (Prentice-Hall, New York, 1972), Vol. 6, pp. 65–98.
E. F. Codd, “Relational data base, a practical foundation for productivity,”Comm. of ACM,25(2):109–117 (1982).
C. J. Date,Introduction to database systems (Addison-Wesley, Reading, 1981).
R. Fagin, “Multivalued dependencies and a new normal form for relational data bases,”ACM Trans Database Syst.,2(3):262–278 (1977).
R. Fagin, “A normal form for relational data bases that is based on domains and keys,”ACM Trans. Data Base Syst.,6(3):387–415 (1981).
R. Fagin, “Horn clauses and database dependencies,”J. ACM,29(4):952–985 (1982).
S. Ginsburg and S. M. Zaiddan, “Properties of functional dependency families,”J. ACM,29(3):678–698 (1982).
J. L. Kuhns, “Logical aspects of question answering by computer,”Proc. 3rd Int., Symp. on Computer and Information ScienceMiami Beach, Florida (Academic Press, New York, 1969).
A. O. Mendelzon and D. Maier, “Generalized mutual dependencies and the decomposition of data base relations,”Proc. ACM Conf. VLDB, Rio de Janeiro, 75–82 (1979).
J. Rissonen,Theory of relations for databases, Lecture Notes in Computer Science (Springer-Verlag, Berlin, 1978), pp. 536–551.
F. Sadri and J. D. Ullman, “Templete dependencies: a large class of dependencies in relational data bases and its complete axiomatizatipn,”J. ACM,29(2):363–372.
Y. Sagiv and S. F. Walecka, “Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies,”J. ACM,29(1):103–117 (1982).
C. Welty and D. W. Stemple, “Human factors comparison of procedural and nonprocedural query languages,”ACM Trans. Database Syst., 626–649 (1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bradley, J. Application of SQL/N to the attribute-relation associations implicit in functional dependencies. International Journal of Computer and Information Sciences 12, 65–86 (1983). https://doi.org/10.1007/BF00993194
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00993194