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."
What is Trigger? A trigger is a SQL procedure that initiates an action when an event (INSERT, DELETE or UPDATE) occurs. Triggers are kept in and managed by the DBMS. Triggers a
What is an Operand? The data on which the operation is to be performed is known as an Operand
What is view in SQL? How is it defined? Any relation that is not part of the logical model, but is made visible to a user as a virtual relation is known as a view. We descri
construct an er diagram for a hospital with a set of patients and a set of medical doctors. associate with each patient a log of various test and examination conducted.convert er d
Normalize the given relation to 3NF, justifying each step
What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.
Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati
How does a query tree represent a relational algebra expression? Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is
Consider the following relations: BRANCH( bno, street, area, city, pcode, Tel_no, Fax_no) STAFF( Sno, Fname, Lname, address, position , salary, bno) Express the subsequent qu
Part: Recommended (Non-query) Optimisations This section entitled "Recommended (non-query) optimisations" should be a brief report containing recommended optimisations you would
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