Independence in database relations

DOI10.1007/978-3-642-39992-3_17MaRDI QIDQ2849431zbMATH OpenOpenAlexFDO

Authors Juha Kontinen, Sebastian Link, Jouko Väänänen

Publication date 17 September 2013

Published in Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39992-3_17

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Database theory (68P15)

Recommendations

• On the finite and general implication problems of independence atoms and keys
• On the interaction of inclusion dependencies with independence atoms
• Independent database schemas
• A finite axiomatization of conditional independence and inclusion dependencies
• Inclusion dependencies and their interaction with functional dependencies

Cited in

(23)

• Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
• Approximation and dependence via multiteam semantics
• Weakly independent database schemes
• Safe dependency atoms and possibility operators in team semantics
• The expressive power of \(k\)-ary exclusion logic
• A finite axiomatization of conditional independence and inclusion dependencies
• On the finite and general implication problems of independence atoms and keys
• The expressive power of \(k\)-ary exclusion logic
• Reduction of database independence to dividing in atomless Boolean algebras
• scientific article; zbMATH DE number 2089481 (Why is no real title available?)
• scientific article; zbMATH DE number 7447734 (Why is no real title available?)
• scientific article; zbMATH DE number 2061713 (Why is no real title available?)
• On the interaction of inclusion dependencies with independence atoms
• Breaking the atom with Samson
• Characterizing strongly first order dependencies: the non-jumping relativizable case
• Integrity constraints revisited: from exact to approximate implication
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• On strongly first-order dependencies
• Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
• On dependence logic
• The flattening operator in team-based logics
• Approximate implication for probabilistic graphical models
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions

This page was built for publication: Independence in database relations

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