

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Clear and concise notes on Relational Algebra as part of Discrete Mathematics. Covers relations, operations, properties, and examples. Ideal for BCA/BSc CS semester exams.
Typology: Summaries
1 / 3
This page cannot be seen from the preview
Don't miss anything!


3. Union Operator (U) - UNION is symbolized by ∪ symbol. - It includes all tuples that are in tables A or in B. - It also eliminates duplicate tuples. - So, set A UNION set B would be expressed as: Result <- A ∪ B - For a union operation to be valid: R and S must have the same number of attributes; attribute domains need to be compatible; duplicate tuples should be automatically removed. 4. Intersection Operator (∩) - An intersection is defined by the symbol ∩. - For example: A ∩ B - It defines a relation consisting of a set of all tuples that are in both A and B. However, A and B must be union-compatible. 5. Cartesian Product (X) - This type of operation is helpful to merge columns from two relations. - Generally, a Cartesian product is never a meaningful operation when it performs alone. - However, it becomes meaningful when it is followed by other operations. - Cartesian Product operation is denoted by X. 6. Join Operation ( ⋈) - Join operation is essentially a Cartesian product followed by a selection criterion. - Join operation is denoted by ⋈. - JOIN operation also allows joining variously related tuples from different relations.