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!
What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the database.
Ans: Assume X, Y, and Z are the set of attributes. If X → Y and Y → Z afterwards the functional dependency X → Z is a transitive functional dependency. Alternatively, if a nonkey attribute is as well functionally dependent on the other nonkey attribute(s), then there is a transitive functional dependency. Transitive functional dependencies are as well cause the data redundancies and the other consequences. For instance, consider the subsequent relation:
CREATE TABLE CONTACTS
(CONTACT_ID NUMBER (5) PRIMARY KEY,
L_NAME VARCHAR (20),
F_NAME VARCHAR (20),
COMPANY_NAME VARCHAR (20),
COMPANY_LOCATION VARCHAR (50))
In the following relation, all the nonkey attributes are functionally dependent on the primary key, that is CONTACT_ID. But, there is as well a transitive functional dependency exists in the relation - CONTACT_ID COMPANY_LOCATION because CONTACT_ID → COMPANY_NAME and COMPANY_NAME →COMPANY_LOCATION. The result of transitive dependency, there are anomalies in the above relation like this:
Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e
We face problem of stock Opening balance and closing balance in Minus
SET concept is used in which type of modelling? SET concept is used in Network Model.
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
A relationship set is a set of relationships of the similar type. For example, let consider the relationship among two entities sets course and student. Collection of all the in
Partial Key : It is a group of attributes that can uniquely identify small entities and that are related to same base entity. It is sometime named as Discriminator. Altern
What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of
atient(PNumber, Name, NHS_no, Amount_due, DNO, Doctor, Medical_Treatment), relation of schema Staff(StaffNum, Name, DNO, Task) and relation of schema Dept(DNO, Name, Location, Dire
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
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
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