Connection-trap-free database schemes
From MaRDI portal
Publication:1185238
DOI10.1016/0022-0000(92)90001-YzbMath0743.68052OpenAlexW1971901542MaRDI QIDQ1185238
Edward P. F. Chan, Paolo Atzeni
Publication date: 28 June 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(92)90001-y
functional dependenciesconnection-traperroneous inference of informationsound and complete information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent database schemas
- Testing the universal instance assumption
- Degrees of acyclicity for hypergraphs and relational database schemes
- Maximal objects and the semantics of universal relation databases
- Database states and their tableaux
- On the foundations of the universal relation model
- Some Results on the Representative Instance in Relational Databases
- A Proof Procedure for Data Dependencies
- Construction of relations in relational databases
- Equivalence of Relational Database Schemes
- Testing satisfaction of functional dependencies
- Horn clauses and database dependencies
- Equivalences among Relational Expressions
- A characterization of globally consistent databases and their correct access paths
- A relational model of data for large shared data banks
This page was built for publication: Connection-trap-free database schemes
