Dependency preservation, Database Management System

Assignment Help:

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."

 


Related Discussions:- Dependency preservation

What are the components of storage manager, What are the components of stor...

What are the components of storage manager? The storage manager components include a) Authorization and integrity manager b) Transaction manager c) Buffer manager d

Define transitive dependencies, What do you understand by transitive depend...

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 datab

Process to find the non-concurrent objects, Process to find the non-concurr...

Process to find the non-concurrent objects Once we find out non-concurrent (mutually exclusive) objects, we can fold all objects together in one thread of process or control. O

Unix System Administration, What Command You Use What Day of the week were ...

What Command You Use What Day of the week were you born

A table joined with itself is called, A table joined with itself is called ...

A table joined with itself is called ? A table joined with itself is known as self join table. Normal 0 false false false EN-IN X-NONE X-NONE

In e-r diagram how relationship type is represented, In E-R Diagram how rel...

In E-R Diagram how relationship type is represented ? In E-R Diagram relationship type is represented as a Diamond.

How does the two phase protocol ensure serializability, How does the two ph...

How does the two phase protocol ensure serializability in database schedules?   Ans:  A transaction is termed to follow the two-phase locking protocol if all locking operations

Give an example of multiple inheritance, Give an example of multiple inheri...

Give an example of multiple inheritance.  One example of multiple inheritance is a committee for students affair which include faculty and administrative staff member.

Explain retrieval in qbe, Explain retrieval in QBE? Retrieval in QBE : ...

Explain retrieval in QBE? Retrieval in QBE : A "GUI" for expressing queries. Based on the Domain Relational Calculus (DRC) Actually invented before GUIs. Very co

Determine the operation that do not participate to be union, 1. Which relat...

1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd