Testing satisfaction of functional dependencies

DOI10.1145/322326.322330MaRDI QIDQ3945628zbMATH OpenOpenAlexWikidataFDO

Authors Peter Honeyman

Publication date 1982

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322326.322330

zbMATH Keywords

relational databasedatabase managementcongruence closurepolynomial- time algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(18)

• Independent database schemes under functional and inclusion dependencies
• On the expressive power of data dependencies
• A characterization of finite fd-acyclicity
• On the desirability of \(\gamma\)-acyclic BCNF database schemes
• Testing unboundedness of database schemes and functional dependencies
• On characterizing boundedness of database schemes with bounded dependencies
• Partition semantics for relations
• Consistent query answering in multi-relation databases
• Axiomatisation of functional dependencies in incomplete relations
• Non-finite specifiability of projections of functional dependency families
• Null inclusion dependencies in relational databases
• Connection-trap-free database schemes
• A new interpretation for null values in the weak instance model
• Update operations in deductive databases with functional dependencies
• The nested universal relation data model
• Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
• Independent database schemas
• Efficient and optimal query answering on independent schemes

This page was built for publication: Testing satisfaction of functional dependencies

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