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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer & Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.