A generalised relational data model is formalised for the representation of data with nested structure of arbitrary depth. A recursive algebra for the proposed model is presented. All the operations are formally defined. The proposed model is proved to be a superset of the conventional relational model (CRM). The functionality and validity of the model is shown by a prototype implementation that has been undertaken in the functional programming language Miranda
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
This article considers the possibility of creating an experimental algebra system based on the techn...
This article considers the possibility of creating an experimental algebra system based on the techn...
The relational model and its extensions are often considered incompatible with object-orientation. H...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that ar...
A consistent extension of the relational model is defined, which allows the recording and manipulati...
Book synopsis: This monograph describes a method of data modelling whose basic aim is to make databa...
Advanced temporal and spatial applications require both the representation of complex objects and th...
Constraint relational databases use constraints to both model and query data. A constraint relation ...
AbstractThe relational model is extended to include nested structures. This extension is formalised ...
This article considers the possibility of creating an experimental algebra system based on the techn...
This article considers the possibility of creating an experimental algebra system based on the techn...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
This article considers the possibility of creating an experimental algebra system based on the techn...
This article considers the possibility of creating an experimental algebra system based on the techn...
The relational model and its extensions are often considered incompatible with object-orientation. H...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that ar...
A consistent extension of the relational model is defined, which allows the recording and manipulati...
Book synopsis: This monograph describes a method of data modelling whose basic aim is to make databa...
Advanced temporal and spatial applications require both the representation of complex objects and th...
Constraint relational databases use constraints to both model and query data. A constraint relation ...
AbstractThe relational model is extended to include nested structures. This extension is formalised ...
This article considers the possibility of creating an experimental algebra system based on the techn...
This article considers the possibility of creating an experimental algebra system based on the techn...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
This article considers the possibility of creating an experimental algebra system based on the techn...
This article considers the possibility of creating an experimental algebra system based on the techn...