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.
Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?
Differance between Open addressing and chaining for collision resolution ? In open addressing , proceeding from the occupied position specified by hash address the program che
Write short notes on Schema diagram. A database schema along with primary key and foreign key dependencies can be depicted pictorially by schema diagram. Every relation appears
Given the subsequent relations: vehicle (reg_no, make, colour) Person (eno, name, address) Owner (eno, reg_no) Write expressions
i need help for assignment ..
Question 1 Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? Question 2 With a necessary example explain (i)
prototype of a distributed information system for a national car part retail outlet chain.
describe all the tables you have created. ?get table_name, status, num_rows, user_stats in user_tables system view ?get table_name, constraint_name, constraint_type in user_constr
Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.
Consider the relation schemas as follows. works (person name, company name, salary); lives (person name, street, city); located in(company name, city); managers (person name
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