Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Define the basic operations of the relational algebra?
Ans: Basic operators of relational algebra are:
1. Union (∪) - Selects tuples which are in either P or Q or in both of them. The duplicate tuples are removed.
R = P ∪ Q
2. Difference or Minus (-) - eliminates common tuples from the first relation.
R = P - Q
3. Cartesian Product or Cross Product (×) - The cartesian product of two relations is the concatenation of tuples that are belonging to the two relations and containing all possible combination of the tuples.
R = P× Q
4. Projection (π) - The projection of a relation is illustrated as a projection of all its tuples over some set of attributes that is it yields a vertical subset of the relation. The relation's projection T on the attribute A is presented by T [A] or πA(T),.
5. Selection (σ) - Selects just some of the tuples, those satisfy specified criteria, from the relation. It yields a horizontal subset of a following relation.
R = σB(P)
Exclusive lock It is asked for by a transaction on a data item that it wants to update. No other transaction can put either a shared lock or an exclusive lock on a dat
Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction. In this protocol every transaction issue lock and u
FDs in Relationships: Enrols Relationship: None as it is many to many Teaches Relationship : Course code → Instructor Instructor → Course code The next question is:
What is object containment? References among objects can be used to model dissimilar real-world concepts.
notes about update opreation
List any eight applications of DBMS. a) Universities b) Airlines c) Banking d) Credit card transactions e) Tele communication f) Sales g)Finance h) Manufac
Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4
UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples
Consider employee table of (i) and list names of department(s) for which average salary for department is more than 10,000. (SELECT d_name FROM dept WHERE d_code IN (SELECT d_c
One-to-one relationship: For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participatio
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd