Abstract. The Nested List Normal Form is proposed as a syntactic normal form for semantically well-designed database schemata obtained from any arbitrary finite nesting of records and lists. The Nested List Normal Form is defined in terms of functional and multivalued depen-dencies, independent from any specific data model, and generalises the well-known Fourth Normal Form from relational databases in order to capture more application domains.
The relationship between redundancy elimination and normal forms in relational database design is i...
Abstract—DBNorma [1] is a semi automated database normalization tool, which uses a singly linked lis...
The current schema design theories assume that a database may be regarded as a single relation. From...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also,...
A common approach in designing relational databases is to start with a universal relation schema, wh...
In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd ...
In this paper, we discuss the deficiencies of normal form definitions based on Functional Dependency...
Abstract. In the relational model of data the Boyce-Codd-Heath nor-mal form, commonly just known as ...
AbstractNested lists are used as a data structure whenever order matters. List types are therefore s...
AbstractWe extend the result on the equivalence between functional and multivalued dependencies in r...
AbstractNesting is a way of transforming a first-normal-form relation into a structure with set-valu...
Because of their strong economic impact, complexity and maintainability are among the most widely us...
AbstractWe prove normal form theorems of a complete axiom system for the inference of functional dep...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
The relationship between redundancy elimination and normal forms in relational database design is i...
Abstract—DBNorma [1] is a semi automated database normalization tool, which uses a singly linked lis...
The current schema design theories assume that a database may be regarded as a single relation. From...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also,...
A common approach in designing relational databases is to start with a universal relation schema, wh...
In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd ...
In this paper, we discuss the deficiencies of normal form definitions based on Functional Dependency...
Abstract. In the relational model of data the Boyce-Codd-Heath nor-mal form, commonly just known as ...
AbstractNested lists are used as a data structure whenever order matters. List types are therefore s...
AbstractWe extend the result on the equivalence between functional and multivalued dependencies in r...
AbstractNesting is a way of transforming a first-normal-form relation into a structure with set-valu...
Because of their strong economic impact, complexity and maintainability are among the most widely us...
AbstractWe prove normal form theorems of a complete axiom system for the inference of functional dep...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
The relationship between redundancy elimination and normal forms in relational database design is i...
Abstract—DBNorma [1] is a semi automated database normalization tool, which uses a singly linked lis...
The current schema design theories assume that a database may be regarded as a single relation. From...