AbstractNesting is a way of transforming a first-normal-form relation into a structure with set-valued entries in some positions instead of atomic entries. In this paper we study how functional and multivalued dependencies interact with nesting. We describe how nesting preserves, alters, or destroys dependencies holding in a first-normal-form relation. We then consider dependencies which hold in each block of the horizontally decomposed relation induced by nesting and study the relationship between these “local” dependencies and “global” dependencies in the normalized relation
One problem concerning the universal relation assumption is the inability of known methods to obtain...
AbstractNested lists are used as a data structure whenever order matters. List types are therefore s...
We present a lattice-base formalism to relate, in a novel way, different representation methods for ...
AbstractNesting is a way of transforming a first-normal-form relation into a structure with set-valu...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
The current schema design theories assume that a database may be regarded as a single relation. From...
Abstract. The Nested List Normal Form is proposed as a syntactic normal form for semantically well-d...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
A new decomposition theory for the Relational Database Model is given. It uses a horizontal decompos...
Symmetric dependencies, or MultiValued Dependencies-like, are those dependencies that follow the ded...
AbstractA lattice theoretic approach is developed to study the properties of functional dependencies...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
The nested relational model extends the flat relational model by relaxing the first normal form assu...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
AbstractNested lists are used as a data structure whenever order matters. List types are therefore s...
We present a lattice-base formalism to relate, in a novel way, different representation methods for ...
AbstractNesting is a way of transforming a first-normal-form relation into a structure with set-valu...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
The current schema design theories assume that a database may be regarded as a single relation. From...
Abstract. The Nested List Normal Form is proposed as a syntactic normal form for semantically well-d...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
A new decomposition theory for the Relational Database Model is given. It uses a horizontal decompos...
Symmetric dependencies, or MultiValued Dependencies-like, are those dependencies that follow the ded...
AbstractA lattice theoretic approach is developed to study the properties of functional dependencies...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
The nested relational model extends the flat relational model by relaxing the first normal form assu...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
AbstractNested lists are used as a data structure whenever order matters. List types are therefore s...
We present a lattice-base formalism to relate, in a novel way, different representation methods for ...