A Proof Procedure for Data Dependencies
From MaRDI portal
Publication:3770004
DOI10.1145/1634.1636zbMATH Open0632.68097OpenAlexW2028222220WikidataQ114614168 ScholiaQ114614168MaRDI QIDQ3770004FDOQ3770004
Authors: Catriel Beeri, Moshe Y. Vardi 
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.1636
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 (67)
- Preserving constraints with the stable chase
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constraint-generating dependencies
- Title not available (Why is that?)
- Reasoning about embedded dependencies using inclusion dependencies
- On the expressive power of data dependencies
- Towards practical feasibility of core computation in data exchange
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Data exchange: semantics and query answering
- Title not available (Why is that?)
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Title not available (Why is that?)
- Testing unboundedness of database schemes and functional dependencies
- Information-based distance measures and the canonical reflection of view updates
- On characterizing boundedness of database schemes with bounded dependencies
- A fuzzy extension of data exchange
- A semantic approach to optimize linear datalog programs
- Implication and axiomatization of functional and constant constraints
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- Exploring theories with a model-finding assistant
- Preservation of integrity constraints in definite DATALOG programs
- Partition semantics for relations
- Verification of knowledge bases based on containment checking
- A finite axiomatization of conditional independence and inclusion dependencies
- Update translation in instance mapped heterogeneous peer databases
- Why is it hard to obtain a dichotomy for consistent query answering?
- Incomplete deductive databases
- On rules with existential variables: walking the decidability line
- Propagating XML constraints to relations
- Semi-oblivious chase termination: the sticky case
- Non-finite specifiability of projections of functional dependency families
- Title not available (Why is that?)
- Formal systems for join dependencies
- Dependencies in relational models of databases
- Inferring multivalued dependencies from functional and join dependencies
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
- Using views to generate efficient evaluation plans for queries
- Query languages for data exchange: beyond unions of conjunctive queries
- Connection-trap-free database schemes
- On a general class of data dependencies in the relational model and its implication problems
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Rewriting guarded existential rules into small Datalog programs
- Strong equivalence of relational expressions under dependencies
- Relaxed notions of schema mapping equivalence revisited
- Inferring null join dependencies in relational databases
- XML queries and constraints, containment and reformulation
- The complexity of embedded axiomatization for a class of closed database views
- Extending inclusion dependencies with conditions
- A top-down proof procedure for generalized data dependencies
- Solutions and query rewriting in data exchange
- Semantic query optimization in the presence of types
- Proving semantical equivalence of data specifications
- Fuzzy data exchange
- A framework for comparing query languages in their ability to express Boolean queries
- Reasoning on property graphs with graph generating dependencies
- Theory of information aspects ? A tool to control independence and redundancy of information in database
- Title not available (Why is that?)
- Restricted Chase Termination: A Hierarchical Approach and Experimentation
- Title not available (Why is that?)
- Restricted chase termination for existential rules: a hierarchical approach and experimentation
- Characterizing boundedness in chase variants
- Schema mappings: a case of logical dynamics in database theory
- The notion of abstraction in ontology-based data management
- Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
- Title not available (Why is that?)
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)
