On the menbership problem for functional and multivalued dependencies in relational databases
From MaRDI portal
Publication:3883572
DOI10.1145/320613.320614zbMath0441.68118OpenAlexW1968137129WikidataQ114614046 ScholiaQ114614046MaRDI QIDQ3883572
Publication date: 1980
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/320613.320614
Related Items (53)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ On a problem of Fagin concerning multivalued dependencies in relational databases ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Specification and Verification of Multi-Agent Systems ⋮ Graph Games and Reactive Synthesis ⋮ An algebraic theory of functional and multivalued dependencies in relational databases ⋮ Insertion anomalies and the justification for 4NF in relational databases ⋮ Runtime enforcement of hyperproperties ⋮ Logical and algorithmic properties of independence and their application to Bayesian networks ⋮ Full hierarchical dependencies in fixed and undetermined universes ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Deciding implication for functional dependencies in complex-value databases ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Succinctness in dependency systems ⋮ Structure of closures in relational schemas with join and functional dependencies ⋮ 'Possible' membership of a multivalued dependency in a relational database ⋮ Compact scheme forests in nested normal form ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The interaction of integrity constraints in an information system ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Appropriate inferences of data dependencies in relational databases ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Unnamed Item ⋮ The theory of functional and template dependencies ⋮ Discrete-time control for rectangular hybrid automata ⋮ Inferring multivalued dependencies from functional and join dependencies ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ Unnamed Item ⋮ Axioms and algorithms for inferences involving probabilistic independence ⋮ Stochastic limit-average games are in EXPTIME ⋮ Concurrent reachability games ⋮ Algorithms and conditional lower bounds for planning problems ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ Quantitative fair simulation games ⋮ Another view of functional and multivalued dependencies in the relational database model ⋮ Conditions for lossless join ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes ⋮ Charting the completeness frontier of inference systems for multivalued dependencies ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Spoilt for Choice: Full First-Order Hierarchical Decompositions ⋮ Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers ⋮ Unnamed Item ⋮ Membership problem for embedded multivalued dependencies under some restricted conditions ⋮ A theory of data dependencies over relational expressions ⋮ Unnamed Item ⋮ Abstract functional dependency structures ⋮ Formal systems for join dependencies
This page was built for publication: On the menbership problem for functional and multivalued dependencies in relational databases