scientific article; zbMATH DE number 1501628

Publication date 11 January 2001

indiscernibility relation proof system for database dependencies

Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Review text

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.

Recommendations

Cited in

(11)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500375)