Relational transformation and a redundancy in relational data base

Authors:
Eliezer L. Lozinskii
Affiliations:
-
Venue:
VLDB '76 Proceedings of the second international conference on Systems for Large Data Bases
Year:
1976

Citing 2
Cited 0

A relational model of data for large shared data banks

Communications of the ACM
The relational and network approaches: Comparison of the application programming interfaces

SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers some transformation and replacement of relations in a relational data base, called association and dissociation, which are intended to decrease the time of jobs processing and files updating, although it is accompanied by an increase of information redundancy. Some examples are examined. It is shown that in a considerable number of practical cases association and dissociation are effective means of processing time reduction and data base adaptation.