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!
Primary Key
The primary key is the candidate key that is selected by the database designer as the principal denotes of identifying entities within an entity set. The left candidate keys, if any, are called as alternate keys.
Foreign Keys
Let us first tell you the basic definition of foreign key.
Let R2 be a relation, then a foreign key in R2 is a subset of the set of attributes of R2, such that:
1. There be a relation R1 (R1 and R2 not essentially distinct) with a candidate key, and
2. For all time, every value of a foreign key in the present state or instance of R2 is identical to the value of Candidate Key in a few tuple in the present state of R1.
Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even
create an er diagram for production management in film industry
ER diagram on cosmetics
what is the need of a log in dbms
What is bucket overflow and how bucket overflow is handled through Over Flow Chaining or Closed Hashing? Ans: Bucket: unit of storage holding records. Bucket is a disk block
What is conceptual schema? The schemas at the view level are known as subschema that describe dissimilar views of the database.
What is the use of group by clause? Group by clause is used to apply aggregate functions to a set of tuples. The attributes given in the group by clause are used to
Describe integrity and security? a) Domain constraint b) Referential integrity A value that appears in one relation for a given set of attributes also appear fo
Differentiate between join and outer join? Outer joins return all rows from at least one of the tables or views mentioned within the FROM clause, as long as those rows get toge
What is a query tree? Ans: A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu
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