What is set intersection operation in relational algebra Database management system

We are building EduLadder(ELADR) - Protocol

The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.

WHITE PAPER Buy Now Try BETA

Real Problems! Real Experts!

Join Our Telegram Channel !

The Eduladder is a community of students, teachers, and programmers. We help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

GATE GMAT CBSE NCERT Career Interview Railway UPSC NID NIFT-UG NIFT-PG PHP AJAX JavaScript Node Js Shell Script Research

Database-Management-System-->View question

What is set intersection operation in relational algebra? - Database management system

Presidency University, Bangalore- Database management system

Asked On2017-07-06 05:54:17 by:Aparna-Dasgupta

Taged users:

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about this Like Dislike

View all questions

Answers

Relations are sets, so we can apply set-theoretic operators However, we want the results to be relations (that is, homogeneous sets of tuples) It is therefore meaningful to only apply union, intersection, difference to pairs of relations defined over the same attributesWe have made no assumptions about the sets of attributes X1 and X2 on which the operands of a join operation are defined; the two sets could even be equal or disjoint.

If X1 = X2 then r1 ⋈ r2 = r1 ∩ r2 since, by definition, the result is a relation which includes tuples t such that t[X1] ∈ r1 and t[X2] ∈ r2, and X1 = X2

Answerd on:2017-07-09 Answerd By:prajwalamv

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this Like Dislike

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder

Welcome to Eduladder V 4.0

Ads

What is set intersection operation in relational algebra? - Database management system

Presidency University, Bangalore- Database management system

Similar Questions

Notes