On interpretations of relational languages and solutions to the implied constraint problem

DOI10.1145/319702.319730zbMath0477.68105OpenAlexW2094875247MaRDI QIDQ3933796

Alan R. Aronson, Anthony C. Klug, Barry E. Jacobs

Publication date: 1982

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319702.319730

zbMATH Keywords

relational databasedata modelsprogram conversiondata manipulationsubschema

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (8)

Characterization of desirable properties of general database decompositions. ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Information-Optimal Reflections of View Updates on Relational Database Schemata ⋮ On the expressive power of data dependencies ⋮ The theory of functional and subset dependencies over relational expressions ⋮ Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context ⋮ Unique complements and decompositions of database schemata

This page was built for publication: On interpretations of relational languages and solutions to the implied constraint problem