desirable properties of decomposition, Database Management System

Desirable Properties Of Decomposition

Decomposition is a process of dividing a relation into its projections that will not be disjoint. Please remind the Relational projection operator and keep in mind no duplicate tuples are allowed in a projection.

Desirable properties of decomposition are given below:

  • Lossless-join decomposition
  • Attribute preservation
  • Dependency preservation
  • Lack of redundancy

 

Posted Date: 3/7/2013 2:15:39 AM | Location : United States







Related Discussions:- desirable properties of decomposition, Assignment Help, Ask Question on desirable properties of decomposition, Get Answer, Expert's Help, desirable properties of decomposition Discussions

Write discussion on desirable properties of decomposition
Your posts are moderated
Related Questions
The dataset " CFOLYMPICS.XLS " contains the observations used in the above article.  The definitions of the variables are also included in this spreadsheet.  However, for the purpo


Q.   With the help of a suitable diagram gives module wise explanation of system architecture of DBMS. Sol. A Database management is a collection of interrelated data and col

What are the Requirements of algorithm designer Algorithm designer should: i) Select proper algorithm so as to minimize implementation cost ii) Find most appropriate d

Question : (a) Data mining is one of the best ways to analyse data and using software method, hidden and unexpected patterns and relationships in sets of data can be extracte

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

Create an entity relationship diagram, Database Management System

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.