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!
Determine the Strong and Weak Entity
Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and an entity not having a primary key of its own. In such a case, the entity having its own primary key is known as a strong entity and the entity not having its own primary key is known as a weak entity. Whenever we need to relate a strong and a weak entity together, the ERD would alter just a little.
Say, for instance, we have a statement "A Student lives in a Home." STUDENT is obviously a strong entity having a primary key Roll. But HOME might not have a unique primary key, as its only attribute Address may be shared by a lot of homes (what if it is a housing estate?). HOME is a weak entity in this case.
Explain Two phase locking protocol A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the tra
What is a Data Flow Diagram? Data Flow Diagram: A data flow diagram is the graph that shows flow of data values from their sources in objects in the course of processes whic
Rearrange Classes and Operations Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often oper
What is a view in SQL? When can views be updated? A view is a virtual table which consists of columns from one or more tables. Through it is same to a table; it is stored in
compare the features of oracle RDBMS with MySQL and Microsoft SQL server
Although, the essential features of E-R diagrams are enough to design many database situations. Though, with more difficult relations and advanced database applications, it is need
Determine the steps of path in association network You can analyse use of paths in association network in the following steps: Examine every operation and see what asso
Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the t
Differentiate between B-tree and B + tree Ans: A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time
In Database software have only pure security or some dis secured by administrator?
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