Connection-trap-free database schemes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3876650 (Why is no real title available?)
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- A Proof Procedure for Data Dependencies
- A characterization of globally consistent databases and their correct access paths
- A relational model of data for large shared data banks
- Construction of relations in relational databases
- Database states and their tableaux
- Degrees of acyclicity for hypergraphs and relational database schemes
- Equivalence of Relational Database Schemes
- Equivalences among Relational Expressions
- Horn clauses and database dependencies
- Independent database schemas
- Maximal objects and the semantics of universal relation databases
- On the foundations of the universal relation model
- Some Results on the Representative Instance in Relational Databases
- Testing satisfaction of functional dependencies
- Testing the universal instance assumption
This page was built for publication: Connection-trap-free database schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185238)