Unique complements and decompositions of database schemata
From MaRDI portal
Publication:1318468
DOI10.1016/S0022-0000(05)80021-2zbMath0802.68042OpenAlexW2018768177MaRDI QIDQ1318468
Publication date: 11 December 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80021-2
decompositionBoolean algebrapartially ordered setscomplementupdate semanticsviewsdatabase schemadeductive database schemata
Related Items (5)
Invariance Properties of the Constant-Complement View-Update Strategy ⋮ Characterization of desirable properties of general database decompositions. ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Lossless Decompositions in Complex-Valued Databases ⋮ Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Database relations with null values
- Why Horn formulas matter in computer science: initial structures and generic examples
- MFDBS 91. 3rd symposium on mathematical fundamentals of database and knowledge base systems. Rostock, Germany, May 6-9, 1991. Proceedings
- The problem of incomplete information in relational databases
- On the expressive power of data dependencies
- On the Desirability of Acyclic Database Schemes
- Finitely Specifiable Implicational Dependency Families
- Incomplete Information in Relational Databases
- Independent and Separable Database Schemes
- A normal form for relational databases that is based on domains and keys
- Update semantics of relational views
- On interpretations of relational languages and solutions to the implied constraint problem
- A simplied universal relation assumption and its properties
This page was built for publication: Unique complements and decompositions of database schemata