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!
Explain weak and strong entity type ?
Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a weak entity set depends on the existence of a strong entity set; it must associate to the strong set via a on-to-many relationship set. A discriminator of a weak entity set is the set of attributes that distinguishes between all the entities of a weak entity set. The primary key of a weak entity set is formed by the primary key of the strong entity set on that the weak entity set is existence depends, plus the weak entity set's discriminator.
Boyce-Code Normal Form (BCNF) A relationship is said to be in BCNF if it is already in 3NF and the left hand side of each dependency is a candidate key. A relation who is in 3N
Determine the rule that a value of a foreign key should appear as a value of some particular table is called a Ans: Referential constraint. The rule that a value of a fo
Explain the three data models namely relational, network and hierarchical and evaluate their relative advantages and disadvantages. Hierarchical Model: In hierarchical model, da
What is Collation Collation is a kind of sort order. There are majorly 3 types of sort orders, namely: i.) Dictionary case insensitive ii.)Dictionary - case sensitive
What is a cascading update? Referential integrity constraints needs that foreign key values in one table correspond to primary key values in another. If the value of the primar
What are the advantages of Logical Databases? It offers a simple-to-use selection screens. You can change the pre-generated selection screen to your needs. It offers check f
prototype of a distributed information system for a national car part retail outlet chain.
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
How is concurrency identified? Concurrency in objects can be identified by the way they alter their state. Current objects can change their state independently. Aggregation imp
WHAT IS DBMS
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