Polynomial-time implication problems for unary inclusion dependencies

DOI10.1145/78935.78937zbMath0698.68090OpenAlexW2042412119WikidataQ114613756 ScholiaQ114613756MaRDI QIDQ3476305

Moshe Y. Vardi, Paris C. Kanellakis, Stavros S. Cosmandakis

Publication date: 1990

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

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

zbMATH Keywords

model theorypolynomial-time algorithmsfunctional dependenciesdatabase managementcomplete axiomatizationlogical designlossless joinembedded implicational dependenciesfinite implication problemsunary inclusion dependencies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Model theory (03C99) Information storage and retrieval of data (68P20)

Related Items (14)

On the finite and general implication problems of independence atoms and keys ⋮ Null inclusion dependencies in relational databases ⋮ Extending inclusion dependencies with conditions ⋮ A Correspondence Between Variable Relations And Three-Valued Propositional Logic ⋮ Integrity constraints for XML ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ The effect of unary inclusion dependencies on relational database design ⋮ The complexity of finite model reasoning in description logics ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Inclusion dependencies and their interaction with functional dependencies in SQL ⋮ Independent database schemes under functional and inclusion dependencies ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ The implication problem for functional dependencies and variants of marginal distribution equivalences

This page was built for publication: Polynomial-time implication problems for unary inclusion dependencies