A Proof Procedure for Data Dependencies
From MaRDI portal
Recommendations
- A top-down proof procedure for generalized data dependencies
- Formal Systems for Tuple and Equality Generating Dependencies
- scientific article; zbMATH DE number 4112078
- On a general class of data dependencies in the relational model and its implication problems
- scientific article; zbMATH DE number 35423
Cited in
(72)- Formal systems for join dependencies
- Non-finite specifiability of projections of functional dependency families
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Testing unboundedness of database schemes and functional dependencies
- Inferring multivalued dependencies from functional and join dependencies
- Connection-trap-free database schemes
- Inferring null join dependencies in relational databases
- On characterizing boundedness of database schemes with bounded dependencies
- Preservation of integrity constraints in definite DATALOG programs
- Verification of knowledge bases based on containment checking
- Incomplete deductive databases
- A top-down proof procedure for generalized data dependencies
- Constraint-generating dependencies
- On the expressive power of data dependencies
- Semi-oblivious chase termination: the sticky case
- Towards practical feasibility of core computation in data exchange
- Dependencies in relational models of databases
- The complexity of embedded axiomatization for a class of closed database views
- A finite axiomatization of conditional independence and inclusion dependencies
- On a general class of data dependencies in the relational model and its implication problems
- Implication and axiomatization of functional and constant constraints
- Why is it hard to obtain a dichotomy for consistent query answering?
- Update translation in instance mapped heterogeneous peer databases
- Rewriting guarded existential rules into small Datalog programs
- Preserving constraints with the stable chase
- Exploring theories with a model-finding assistant
- Reasoning about embedded dependencies using inclusion dependencies
- Relaxed notions of schema mapping equivalence revisited
- scientific article; zbMATH DE number 4085077 (Why is no real title available?)
- scientific article; zbMATH DE number 4112078 (Why is no real title available?)
- Extending inclusion dependencies with conditions
- Solutions and query rewriting in data exchange
- Semantic query optimization in the presence of types
- Theory of information aspects ? A tool to control independence and redundancy of information in database
- scientific article; zbMATH DE number 1222701 (Why is no real title available?)
- scientific article; zbMATH DE number 549084 (Why is no real title available?)
- Information-based distance measures and the canonical reflection of view updates
- scientific article; zbMATH DE number 2015568 (Why is no real title available?)
- scientific article; zbMATH DE number 1501628 (Why is no real title available?)
- Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
- scientific article; zbMATH DE number 1929304 (Why is no real title available?)
- Restricted chase termination for existential rules: a hierarchical approach and experimentation
- Characterizing boundedness in chase variants
- scientific article; zbMATH DE number 7561463 (Why is no real title available?)
- scientific article; zbMATH DE number 7561477 (Why is no real title available?)
- A fuzzy extension of data exchange
- Grounded fixpoints and active integrity constraints
- Schema mappings: a case of logical dynamics in database theory
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
- XML queries and constraints, containment and reformulation
- Data exchange: semantics and query answering
- Partition semantics for relations
- A framework for comparing query languages in their ability to express Boolean queries
- The notion of abstraction in ontology-based data management
- Restricted Chase Termination: A Hierarchical Approach and Experimentation
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Query languages for data exchange: beyond unions of conjunctive queries
- On rules with existential variables: walking the decidability line
- Reasoning on property graphs with graph generating dependencies
- Proving semantical equivalence of data specifications
- Fuzzy data exchange
- Compact query rewritings for ontology-based query answering
- Explanations for query answers under existential rules
- Characterizing data dependencies then and now
- Answering path queries under linear and guarded existential rules
- Strong equivalence of relational expressions under dependencies
- A semantic approach to optimize linear datalog programs
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- Propagating XML constraints to relations
- Using views to generate efficient evaluation plans for queries
This page was built for publication: A Proof Procedure for Data Dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770004)
