Inferences for numerical dependencies

DOI10.1016/0304-3975(85)90075-1MaRDI QIDQ1079963zbMATH OpenOpenAlexWikidataFDO

Authors Jack Minker, John Grant

Publication date 1985

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(85)90075-1

zbMATH Keywords

database dependenciesfirst-order logicgeneralization of functional dependenciesHorn formulaeinference ruleslogical implicationrelational database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Review text

Numerical dependencies - a generalization of functional dependencies, which naturally occur in databases as integrity constraints - are studied in the paper. It is proved that there does not exist a finite set of sound and complete inference rules for numerical dependencies in contrast to the case of functional dependencies. It is also proved that non- trivial numerical dependencies which are not functional dependencies cannot be expressed by Horn formulae in first-order logic.

Recommendations

• Normalization and axiomatization for numerical dependencies
• Functional dependencies in relations with null values
• Appropriate inferences of data dependencies in relational databases
• scientific article; zbMATH DE number 4009860
• scientific article; zbMATH DE number 2038176

Cites work

• A normal form for relational databases that is based on domains and keys
• Algebraic dependencies
• Horn clauses and database dependencies
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Inclusion dependencies and their interaction with functional dependencies
• Inferences for numerical dependencies
• Logic for improving integrity checking in relational data bases
• On recursive axioms in deductive databases
• On the computational complexity of cardinality constraints in relational databases
• On the family of generalized dependency constraints
• Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
• Template Dependencies

Cited in

(12)

• Inferences for numerical dependencies
• Foundations of entity-relationship modeling
• Jack Minker --- A profile
• General information spaces: measuring inconsistency, rationality postulates, and complexity
• Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations
• Guessing singular dependencies
• On the finite and general implication problems of independence atoms and keys
• Normalization and axiomatization for numerical dependencies
• Postulate satisfaction for inconsistency measures in monotonic logics and databases
• Inferential constants
• On measuring inconsistency in definite and indefinite databases with denial constraints
• Numerical constraints on XML data

This page was built for publication: Inferences for numerical dependencies

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