Membership problems for data dependencies in relational expressions
From MaRDI portal
In relational databases, a query can be formulated in terms of a relational algebra expression using projection, selection, restriction, cross product and union. In this paper, we consider a problem, called the membership problem, of determining whether a given dependency d is valid in a given relational expression E over a given database scheme R, that is, whether every instance of the view scheme defined by E satisfies d (assuming that the underlying constraints in R are always satisfied).
Recommendations
Cites work
- A relational model of data for large shared data banks
- Adequacy of decompositions of relational databases
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- Calculating constraints on relational expression
- Determining View dependencies using tableaux
- scientific article; zbMATH DE number 3648167 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Optimizing the performance of a relational algebra database interface
- Preserving Functional Dependencies
Cited in
(4)- Charting the completeness frontier of inference systems for multivalued dependencies
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- scientific article; zbMATH DE number 1735959 (Why is no real title available?)
- Characterisations of multivalued dependency implication over undetermined universes
This page was built for publication: Membership problems for data dependencies in relational expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060028)