Testing arbitrary subhypergraphs for the lossless join property

DOI10.1016/0020-0255(90)90019-7MaRDI QIDQ918686zbMATH OpenOpenAlexFDO

Authors Elsie Sterbin Gottlieb

Publication date 1990

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(90)90019-7

zbMATH Keywords

arbitrary subhypergraphembedded join dependencyrelational database

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Closures of database hypergraphs
• Conditions for lossless join
• Some results on the deductive structure of join dependencies
• \(R\)-graphs, cycles on hypergraphs, and join dependencies in relational databases
• On the complexity of join dependencies

Cites work

• A Complete Axiomatization of Full Join Dependencies
• A simplied universal relation assumption and its properties
• Degrees of acyclicity for hypergraphs and relational database schemes
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• Maximal objects and the semantics of universal relation databases
• On the Desirability of Acyclic Database Schemes
• On the foundations of the universal relation model

Cited in

(2)

• Generating hinges from arbitrary subhypergraphs
• Decomposing constraint satisfaction problems using database techniques

This page was built for publication: Testing arbitrary subhypergraphs for the lossless join property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918686)