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 entity integrity and referential integrity. How does SQL allow specification of these?
Ans: Entity Integrity Rule- If the attribute A of relation R is a prime attribute of R after that A cannot accept null values.
Referential Integrity Rule- In referential integrity, it is made sure that a value that appears in one relation for a given set of attributes as well appears for a particular set of attributes in another relation.
In SQL, referential integrity and entity integrity rules are implemented as constraints on the relation known as reference Key constraint and primary Key constraint correspondingly.
These constraints can be fixed with relation at the time of creation of the relations or after the creation of the relations by altering the definition of the relations. For instance:
Illustrate the statement 'Projection operation distributes over the union operation'. Give an example. Ans: Π L (E 1 ∪ E 2 ) = (Π L (E 1 )) ∪ (Π L (E 2 )) This says th
Differentiate OO development from structured development. Structured approach of problem solving is based upon the idea of decomposition of system into subsystem. In this appro
What is the use of integrity constraints? Integrity constraints make sure that changes made to the database by authorized users do not result in a loss of data consistency. The
Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent
Normal 0 false false false EN-US X-NONE X-NONE
Explain entity integrity and referential integrity rules within relational model. Show how these are realized in SQL? Entity Integrity Rule - No primary key value could be nu
Explain Network Model in DBMS? Network Model - It was formalised within the late year of 1960s through the Database Task Group of the Conference on Data System Language (DBTG
explain in detail about crash recovery
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
Describe the Association: Design Before we describe association design let us define association "Association is set of links between two objects in the object model". It is
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