Abstract:
The properties of join dependences are discussed for the problem of projections synthesis in relational databases with a universal relation. The concept of guaranteed synthesis is introduced, the interrelation between sets of solutions to the synthesis problem is established in the general and quaranteed cases, and conditions are obtained for coincidence of the join of base relations with the projection for the general and quaranteed cases.