On equivalence of relational and network database models (Q1058312): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jaroslav Pokorný / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jaroslav Pokorný / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90130-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982086438 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Equivalence of Database Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast algorithms for the elimination of common subexpressions / rank | |||
Normal rank |
Latest revision as of 17:43, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On equivalence of relational and network database models |
scientific article |
Statements
On equivalence of relational and network database models (English)
0 references
1985
0 references
The author continues to study the problem discussed by \textit{Y. E. Lien} [J. Assoc. Comput. Mach. 29, 333-362 (1982; Zbl 0485.68088)]. In the network models, a database schema is represented by a connected digraph called a Bachman diagram. A Bachman diagram B is loop-free if this graph is a tree. A loop-free network database (LFND) cosists of B and a network database for B. Lien established an equivalence between LFNDs and a subclass of relational databases. The subclass contains databases with a conflict- and contention-free relation structure. The databases consist of a single relation R defined on a universal set U of attributes. The author presents an extension of the result and enlarges the class of relational structures H which are equivalent to LFBDs. The extension exploits the presence of functional dependencies in H and a condition on null values occurring in any tuple of R(U) corresponding to H. The discussion in this paper is not self-contained. The concepts of cc-free relational structure introduced by Lien is not explicitly defined here.
0 references
conflict-free and contention-free relation structures
0 references
equivalence of database models
0 references
network models
0 references
database schema
0 references
connected digraph
0 references
Bachman diagram
0 references
loop-free network database
0 references
relational databases
0 references