Testing satisfaction of functional dependencies

DOI10.1145/322326.322330zbMath0485.68094OpenAlexW1973125170WikidataQ114614031 ScholiaQ114614031MaRDI QIDQ3945628

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)

Related Items (17)

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

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