What are the problems in database normalization, Database Management System

Assignment Help:

What are the problems if one were not to normalize?  When do these problems surface?          

Ans:  Database normalization, sometimes considered to as  canonical synthesis, is a method for designing relational database tables to minimize duplication of information and, in so doing, to preserve the database against specific types of logical or structural problems, that are data anomalies. For instance, when multiple instances of a given piece of information take place in a table, the possibility exists that these examples will not be kept consistent while the data within the table is updated, leading to a loss of data integrity. A table that is adequately normalized is less vulnerable to problems of this type, as its structure reflects the basic assumptions for while multiple instances of similar information should be denoted by a single instance only.


Related Discussions:- What are the problems in database normalization

What is the role of order by clause, What is the role of ORDER By Clause? ...

What is the role of ORDER By Clause? ORDER BY clause: The ORDER BY clause permits you to sort the records in your result set. The ORDER BY clause can just be used in select s

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

#title using the invoice, using the invoice table shown below,write the rel...

using the invoice table shown below,write the relational schema,draw a dependencies,inclunding all partial and transitive dependencies.assume that the table does not contain repeat

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Explain relational model and their use in dbms, Explain Relational model an...

Explain Relational model and their use in DBMS? Relational Model - The relational model was first introduced through E.F. Codd of the IBM Research in the year of 1970. The mode

Explain the structured decomposition, Differentiate between the object orie...

Differentiate between the object oriented decomposition and the structured decomposition? Process-oriented (structural) decomposition divides a complex process, function or tas

Explain current page table and shadow page table, Explain current page tabl...

Explain current page table and shadow page table. The key idea behind the shadow paging method is to maintain two page tables during the life of the transaction: the current pa

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