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

Can a stored procedure call itself, Can a stored procedure call itself or r...

Can a stored procedure call itself or recursive stored procedure? How much level SP nesting is possible? Yes. Because Transact-SQL supports recursion, you can write kept proced

Describe the basic steps involved in recovery, Question: One of the tas...

Question: One of the tasks a database management system must perform is to ensure that the data is still intact in the face of software and hardware failure. This task is known

What are the various forms of data transparency, What are the various forms...

What are the various forms of data transparency? a) fragmentation transparency b) replication transparency c) location transparency

Define atom of domain relational calculus, Define Atom of domain relational...

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Physical dbms architecture, PHYSICAL DBMS ARCHITECTURE  The physical ...

PHYSICAL DBMS ARCHITECTURE  The physical architecture defines the software components used to process and enter data, and how these software components are related and interc

Primary key, The primary key is selected from the

The primary key is selected from the

Define catalog and meta data, Define Catalog and meta data ? A catalog ...

Define Catalog and meta data ? A catalog is a compilation of records elaborating the contents of a particular collection or group of collections. Metadata (Meta data, or someti

Explain sequential file organization, Question 1 What do you mean by datab...

Question 1 What do you mean by database management system? Question 2 Write a note on Object-Oriented Model Question 3 Explain Sequential File Organization Question

State in detail about data flow diagram, What is a Data Flow Diagram?  ...

What is a Data Flow Diagram?  Data Flow Diagram: A data flow diagram is the graph that shows flow of data values from their sources in objects in the course of processes whic

Explain candidate key and super key, Explain Candidate Key and Super Key ...

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

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