Dependency preservation, Database Management System

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

 

Posted Date: 3/7/2013 2:23:40 AM | Location : United States







Related Discussions:- Dependency preservation, Assignment Help, Ask Question on Dependency preservation, Get Answer, Expert's Help, Dependency preservation Discussions

Write discussion on Dependency preservation
Your posts are moderated
Related Questions
Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328

How to draw an ER diagram to a finance companz

In object oriented design, which steps must designer take to adjust inheritance? To readjust inheritance following steps should be taken: i)  Rearrange and adjust the classe

Let us first look into some of the important features of ER model. Entity relationship model is a high-level conceptual data model. It permits us to define the data invo

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

List the Armstrong's axioms for functional dependencies.  What do you understand by soundness and completeness of these axioms?      Ans: The Armstrong's axioms are: F1:

Shared lock or Read Lock It is requested by a transaction that needs to just read the value of data item. A shared lock on a data item does not permit an exclusive lock

Describe the definition of a transaction in SQL  Ans: The SQL transaction starts implicitly. Transactions are finished by either Commit work that commits the transaction and st

If one requires to access data using Logical Database , the use of events is unavoidable. Yes, if someone wants to access data using Logical database then the use of events