AbstractA database model based on Non First Normal Form is presented. A key feature of the model is an algebraic query language allowing data restructuring. A natural connection between instances in this model, and relational database instances satisfying the Universal Relation Scheme Assumption is investigated
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also,...
Relational database systems entered the marketplace in the early 1980s and have since become the sta...
Future users of large data banks must be protected from having to know how the data is organized in ...
Analysis and Design of Relational Schemata for Database Systems. PhD thesis, UCLA, July 1976. [Fagi...
AbstractWe propose a conceptually simple, though technically complex, algorithmic method for designi...
A new characterization of relational database schemes in normal forms is given. This characterizatio...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd ...
Relations in partitioned normal form are an important subclass of nested relations. This paper is co...
for Future users of large data banks must be protected from having to know how the data is organized...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
The relationship between redundancy elimination and normal forms in relational database design is i...
This paper identifies several areas of database modeling and design that have been problematic for s...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also,...
Relational database systems entered the marketplace in the early 1980s and have since become the sta...
Future users of large data banks must be protected from having to know how the data is organized in ...
Analysis and Design of Relational Schemata for Database Systems. PhD thesis, UCLA, July 1976. [Fagi...
AbstractWe propose a conceptually simple, though technically complex, algorithmic method for designi...
A new characterization of relational database schemes in normal forms is given. This characterizatio...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd ...
Relations in partitioned normal form are an important subclass of nested relations. This paper is co...
for Future users of large data banks must be protected from having to know how the data is organized...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
The relationship between redundancy elimination and normal forms in relational database design is i...
This paper identifies several areas of database modeling and design that have been problematic for s...
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also,...
Relational database systems entered the marketplace in the early 1980s and have since become the sta...
Future users of large data banks must be protected from having to know how the data is organized in ...
DOI
Add to ORKG