No label defined (Q4500375)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1501628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1501628 |
Statements
11 January 2001
0 references
proof system for database dependencies
0 references
indiscernibility relation
0 references
0.8852164
0 references
0.87309825
0 references
0.8654471
0 references
0.86482567
0 references
0.8623436
0 references
The paper concerns a well-known theme of the relational database theory, namely a proof system for database dependencies. The author presents this theme in a special formalism based on the notion of indiscernibility relation. He focuses on functional dependencies, association rules and multivalued dependencies. Section 2 introduces preliminaries that include reformulated definitions of functional and multivalued dependencies and contexts. In section 3 a relational deduction apparatus is introduced. Relational deduction is a semantic tableaux method of proof. In the next section, the author shows that Armstrong's axioms are valid in any information frame with so called strong relations and the deduction technique gives a decidable procedure for the implication problem for functional dependencies. In section 5 and 6 the same is shown for association rules. Then the deduction technique is applied to multivalued dependencies. Finally, its further applications are discussed. The paper presents an interesting alternative for capturing properties of database dependencies.
0 references