Relations in partitioned normal form are an important subclass of nested relations. This paper is concerned with the problem of restructuring relations in partitioned normal form to new and potentially very different schemes. The main problem with restructuring is to minimize the amount of information lost during the transformation. A new restructuring operator is defined which minimizes that loss of information. Its definition is refined step by step into more and more computationally efficient versions.Anglai
This paper discusses problems and confusion that can arise in normalizing certain relations, using t...
By distinguishing nested attributes as Decomposable and Non-Decomposable, it is proved that for all ...
Abstract—An algorithm is given for the lossless decomposition of a relation into Boyce-Codd Normal F...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We consider the representable equational theory of binary relations, in a language expressing compos...
AbstractA database model based on Non First Normal Form is presented. A key feature of the model is ...
Since the first publications on non-first-normal-form relations in the late 70's and early 80&a...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Abstract. Nested relations are an important subclass of object-relational systems that are now being...
AbstractWe consider the representable equational theory of binary relations, in a language expressin...
Term rewriting is generally implemented using graph rewriting for efficiency reasons. Graph rewritin...
Rewriting is traditionally presented as a method to compute normal forms in varieties. Conceptually,...
Nested relations have been put forward as a way of extending the applicability of the classical rela...
This paper discusses problems and confusion that can arise in normalizing certain relations, using t...
By distinguishing nested attributes as Decomposable and Non-Decomposable, it is proved that for all ...
Abstract—An algorithm is given for the lossless decomposition of a relation into Boyce-Codd Normal F...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We consider the representable equational theory of binary relations, in a language expressing compos...
AbstractA database model based on Non First Normal Form is presented. A key feature of the model is ...
Since the first publications on non-first-normal-form relations in the late 70's and early 80&a...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Abstract. Nested relations are an important subclass of object-relational systems that are now being...
AbstractWe consider the representable equational theory of binary relations, in a language expressin...
Term rewriting is generally implemented using graph rewriting for efficiency reasons. Graph rewritin...
Rewriting is traditionally presented as a method to compute normal forms in varieties. Conceptually,...
Nested relations have been put forward as a way of extending the applicability of the classical rela...
This paper discusses problems and confusion that can arise in normalizing certain relations, using t...
By distinguishing nested attributes as Decomposable and Non-Decomposable, it is proved that for all ...
Abstract—An algorithm is given for the lossless decomposition of a relation into Boyce-Codd Normal F...