Hi, say we have entities A,B,C in a Relational Database. Is there a sort-of operational algebra that allows us to determine that if, say, A and B are in a many-many relation and B and C are in a 1-many relation, then A,C are in a certain relationship, i.e., a composition algebra between relations (whenever "composable", of course)? And, while we are at it, when are relations "composable" (in a formal way, ignoring semantic issues of whether the composition is meaningful) , meaning if A is related to B and B to C, can we say A is related to C? Any Mathematical Analogies more than welcome.(adsbygoogle = window.adsbygoogle || []).push({});

Thanks.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Relational DB :Relation-type Algebra?

Tags:

Loading...

Similar Threads - Relational Relation type | Date |
---|---|

Relational Dependencies: You make the Call... | May 19, 2016 |

Relational calculus in a library | Feb 4, 2016 |

Big Data and RDBS (Relational DB). Do They Fit? | Feb 2, 2016 |

Solving recurrence by changing variables | Dec 22, 2015 |

Formal Definition of Inner Join? | Dec 15, 2015 |

**Physics Forums - The Fusion of Science and Community**