FISCHER, P. C.; GUCHT, D. V. Determining when a structure is a nested relation. In: INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES,  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Updating Relational Databases through XML Views - Braganholo (2002) (4 citations) (Correct)
....structure. This hierarchical structure resembles the XML model and has been used to represent it [ABI 84, SIL 2002a] A relational database is a set of flat relations (first normal form relations) whereas an XML instance can be considered an NF view. Several researchers [ARI 83, JAE 82, FIS 85, ROT 88] address the problem of obtaining non first normal form relations from normalized ones. They do this by defining composition and decomposition operations [ARI 83] or nest and unnest operations. The nest operator partitions relations and creates nested relations for each partition formed ....
FISCHER, P. C.; GUCHT, D. V. Determining when a structure is a nested relation. In: INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES,
Extensions to the Relational Data Model - Scholl (1992) (Correct)
....what is required is that the relation has a key consisting of only atomic attributes, that is, be in Partitioned Normal Form (see above) So, in addition to database design, this kind of query languages was another reason to study normal forms for nested relations. An analysis was presented in [45], to detect whether a nested relation can be obtained from a flat one by a sequence of nest operators (in this case, the relation can also be unnested losslessly) Investigations concerning the completeness of such languages have been presented in [127, 84] where it was shown that such an algebra ....
P. C. Fischer and D. van Gucht. Determining when a structure is a nested relation. In Proc. Int. Conf. on Very Large Databases, pages 171--180, Stockholm, 1985.
Handling Fuzzy Complex Objects In Knowledge-Based Systems - Turhan (1994) (Correct)
....representations of information may provide a more intuitive user view of data. 3. Non first normal form reduces the number of tuples and eliminates redundancy. 4. Related to the stated three reasons, querying is also simplified [41] The nested relational data model (Non first normal form) [2, 24, 35, 41, 46, 47, 48, 18, 28] was developed in order to extend the support for the complex objects in the relational data model. Nested relations can naturally represent the hierarchy of complex objects by allowing recursively defined relation valued attributes in addition to atomic attributes. We will give a more formal ....
P. Fischer and D. Van Gucht. Determining when a Structure is a Nested Relation. In Proceedings of the Eleventh International Conference on Very Large Databases, 1985.
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