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:
FDs in Relationships: Enrols Relationship: None as it is many to many Teaches Relationship : Course code → Instructor Instructor → Course code The next question is:
how to make an e r diagram?
a need some real life examples of database management systems three level of ANSI SPARC architecture life teacher and student ,company and employee or for NGO etc.
Increased parallelism : Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have
What is a hashing function? What are the properties of a good hashing function? Describe the folding technique for hashing functions. Ans: Hashing function is a method
In Database software have only pure security or some dis secured by administrator?
Database systems have many opposite efforts ?
Problem: ‘Users and Information system specialists need to spend inordinate amounts of time locating and gathering data' (Watson and Hal, 1998) Recent developments in the ar
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
Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.
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