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)
What are the two types of errors? The two types of errors are: a) Logical error b) System error
What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.
What are the three data anomalies that are similarly to take place as a result of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why n
Define single valued and multivalued attributes. Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes. M
What is a homogeneous distributed database? In homogeneous distributed databases, all sites have the same database management system software, are aware of one another, and agr
Types of data independence Data independence can be classified into the following two types: Physical Data Independence: This means that for any change made in the physi
i want notes on this topic
In E-R diagram how generalization is represented? in E-R diagram generalization is represented by Triangle shape.
It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records
Describe in brief about the Sequence Diagrams Sequence diagrams are interaction diagrams which emphasize time ordering of messages. In UML, it is shown as a table which shows
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