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:
What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct
What is schema
What is a super key? A super key is a set of one or more attributes that collectively permits us to recognize uniquely an entity in the entity set.
UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples
Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both
Have a look around the site, and at some of the sites they have featured. These are all examples of bad design, and also offer an explanation about why they fall into this category
Define data conversion? Helpful to load data into temporary staging tables. Then can write SQL code to do much of data processing. SQL code is simpler and faster to write than
The natural join is equal to which product? The natural join is equal to Combination of projection and Cartesian product
Design an EER schema for the following application and translate the EER schema into relational schemas (and constraints). It is possible that some requirements cannot be captured
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