Nested relations and Complex Objects in Databases (S.Abiteboul, P.Fischer and H.-J.Schek eds.) Springer LNCS, Vol. 361, 1989.  Home/Search   Document Not in Database   Summary   Related Articles

....establish the connection between data models and types, i.e. to represent database objects (not necessarily relational databases) as typed objects in programming languages. There have been made a number of attempts to generalize relational databases giving up the firstnormal form assumption, see [1, 4, 6, 9, 10, 13, 16, 17, 18, 20]. They can be divided into two categories. The first one consists of models that do not contain sets. Usually it means that they admit null values and or record structures, the latter including also case, or discriminated union. In this case [5] provides us with the idea how to develop the ....

....domains multivalued dependencies are in one to one correspondence with the decompositions of relations. The model proposed in [5] does not admit constructions containing sets. However, they are necessary in order to describe some models which are being widely studied now, namely nested relations [6, 13, 16, 17, 18, 20] and complex objects [1, 13] which play an essential role in the theory of object oriented databases [2] By complex objects we mean objects constructed from the basis ones by using the operations of forming records (including discriminated union) and sets, i.e. record, variant and set ....

[Article contains additional citation context not shown here]

Nested relations and Complex Objects in Databases (S.Abiteboul, P.Fischer and H.-J.Schek eds.) Springer LNCS, Vol. 361, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC