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."
Explain natural join? Natural Join - Similar as equi-join except in which the join attributes (having similar names) are not involved in the resulting relation. Only one sets
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
Project Description: I would like to get a database of a website which has clients email name and phone number. If you are able to get information from a website, by entering
explain normalisation
Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher
Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen
What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n
What is DataWarehousing? Subject-oriented, meaning that the data in the database is organized so that all the data elements relating to the similar real-world event or object
how to write tables and drow E-R diagrams for hosiptal management system and how to normalize and cardinalities?
What are called multilevel indices? Indices with two or more levels are known as multilevel indices.
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