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!
Before defines the second type of integrity constraint, viz., Entity Integrity, we should be well-known with the concept of NULL.
Mostly, NULL is intended as a basis for dealing with the trouble of missing information. This type of situation is frequently encountered in the actual world. For instance, historical records sometimes have entries such as "Date of birth unknown", or police records may contain the entry "Present whereabouts unknown." Therefore it is necessary to have some way of dealing with such concepts in database systems.
Therefore Codd proposed an approach to this issue that creates use of special markers known as NULL to show such missing information.
A given attribute in the relation may or may not be allowed to include NULL. However, can the Primary key or any of its components (in case of the primary key is a composite key) contain a NULL? To answer this Query an Entity Integrity Rule states: No component of the primary key of a relation is permitted to accept NULL. In different words, the definition of each attribute involved in the primary key of any basic relation have to explicitly or implicitly contain the specifications of NULL NOT ALLOWED.
what are the purposes of dbms in details
A table joined with itself is called ? A table joined with itself is known as self join table. Normal 0 false false false EN-IN X-NONE X-NONE
Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation
explain the steps for reduction of er model into relational model?
Describe the two types of methods for retrieving rows in Python? Fetchone()- Returns the next row as a sequence Fetch all()- Returns the entire result set like a strin
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both
What is schema
Normalization :It is a process of examine the given relation schemas based on their primary key and Functional Dependencies (FDs) to achieve the properties Minimizing redun
What are the advantages of having an index structure? Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco
What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f
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