Inferring null join dependencies in relational databases
From MaRDI portal
Publication:1198969
DOI10.1007/BF02074878zbMath0752.68028OpenAlexW2071285637WikidataQ114693692 ScholiaQ114693692MaRDI QIDQ1198969
Publication date: 16 January 1993
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02074878
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Lossless outer joins with incomplete information
- A new interpretation for null values in the weak instance model
- Database relations with null values
- Fixed-point extensions of first-order logic
- The nested universal relation database model
- Nonapplicable nulls
- Degrees of acyclicity for hypergraphs and relational database schemes
- Incomplete Information in Relational Databases
- A Proof Procedure for Data Dependencies
- Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
- A Complete Axiomatization of Full Join Dependencies
This page was built for publication: Inferring null join dependencies in relational databases