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!
Dependency Preservation
It is obvious that the decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservation is another main requirement since a dependency is a constraint on the database. If each attributes appearing on the left and the right side of a dependency appear in the similar relation, then a dependency is considered to be preserved. Therefore, dependency preservation can be checked simply. Dependency preservation is important, because as stated previously, dependency is a constraint on a relation. Therefore, if a constraint is split over more than one relation (dependency is not preserved), the constraint would be complex to meet. We will not talk about this in more detail in this unit. You may refer to the more readings for more details. Though, let us state one basic point:
"A decomposition into 3NF is lossless and dependency preserving whereas a decomposition into BCNF is lossless but may or may not be dependency preserving."
give some example real-life situations where DBMS are most suiitabe
How does a query tree represent a relational algebra expression? Discuss any three rules for query optimisation, giving example as to when should each rule be applied. Ans
Question 1: Define the term business intelligence tools? Briefly explain how the data from one end gets transformed into information at the other end? Definition Exp
Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000. CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA
What are the differences among MySQL_fetch_array(), MySQL_fetch_object(), MySQL_fetch_row()? Mysql_fetch_object returns the result from the database like objects while mysql
Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg
Self-Join: In a self join a table is joined with itself. Let consider the following sample partial data of EMP table EMPNO ENAME MGRID
What is Message switching Message switching transmits data units which can be arbitrarily long. Packet switching has a utmost packet size, if any message longer than that, it s
Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d
Example: //REVOKE ALL ON EMP FROM MCA12; (All permissions will be cancelled) You can also cancel only some of the permissions. Drop: A user-
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