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:
How does Tuple-oriented relational calculus vary from domain-oriented relational calculus? The tuple-oriented calculus uses a tuple variables i.e., variable whose only allowed
PART MARKING: We will only mark TWO of the four questions below but you must submit answers to all four. We will choose the questions we mark randomly and we will supply you with
Database systems have many opposite efforts ?
Which sorting technique is used to sort databases, whose sizes are very big? Give one such algorithm. Why do sorting techniques like quicksort, insertion sort, etc. not applied
Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I
Explain the term - Handling Boundary Condition These are some circumstances that to be handled in any system initialization and termination. Describes how system is bro
Determine the language that needs a user to specify the data to be retrieved with no specifying exactly how to get it is Ans: Non-Procedural DML
State about the Activity Diagram Activity diagrams show flow from one activity to other. It is an ongoing non atomic execution within a state machine. Activity finally results
What is Primary key? Primary Key - Primary key is one of the candidate keys which uniquely identifies each row in the relation.
Can a domain, assigned to a data element be changed? Yes. We can do so by just overwriting the entry in the field domain.
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