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 two types of errors? The two types of errors are: a) Logical error b) System error
exercise solution
DDL Compiler The DDL compiler changes the data definition statements (such as CREATE TABLE .... in SQL) into a set of tables having metadata tables. These tables have infor
Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o
A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
what is lossless & dependency preserving decomposition ?
Explain briefly concurrent task by taking an example. Concurrent Task- The concurrent occurrence of more than one event is called concurrent task. Operating systems can handl
A customer places orders for parts and belongs to a particular industry group. An individual order is taken by a particular sales representative on a specific date and the sales re
What is Oracle databse structure? Oracle database structure: The relational model has three main aspects: Structures: Structures are well-defined objects which store th
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