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!
List two restrictions that are applied on the modification (updation, insertion or deletion) of base tables through view.
Ans: The two restrictions are:
1. If a view does not consist of primary key and/or at least one of the attributes along with the NOT NULL constraint which do not have default values specified, is not updatable. This restriction is needed because if we are inserting any row in the view than all attributes not included in view of the base relation are will be denoted by the NULLs if any default value is not specified. In this type of case, if any attribute is set as NOT NULL or primary key, then it should not be NULL, and the insertion will be violating the constraints.
2. If a view defined by using grouping and/or aggregate functions, is not updatable. This restriction is also needed because, if we want to modify the base relation by view then we are not in the position to identify that tuple(s) will be modified in the group in what way.
Define Outer join Outer join - If there are any type of values in the one table that do not have corresponding value(s) in the other, in an equi-join which will not be selected
Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider
What is an E-R model? Draw an E-R Diagram for the company database with following Descriptions? The company is organized within departments. Each department has a unique name a
Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside
how oracle can be used
difference between internal schema and external schema in DBMS
Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar
Analyzing Association Traversal Association Traversal shall be understood properly for the association design explanation. Analyzing association traversal means analyzing tra
Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On delete Cascade : Using this key whenever a parent row is removed in a referenced
define anomalies and different types of anomalies with example
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd