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

Transaction managenment, can you please explain with the help of suitable e...

can you please explain with the help of suitable example the difference between conflict equivalence and conflict serializability?

Mobile database, write short note on mobile database

write short note on mobile database

What is magnetic disks, What is magnetic disks?explain it? Magnetic dis...

What is magnetic disks?explain it? Magnetic disk provides the bulk of secondary storage of modern computer system. The disk capacity is growing at over 50% per year. But the st

The file based system in dbms, The File Based System File based systems...

The File Based System File based systems are an early attempt to computerise the manual filing system. For example, a manual file can be set up to hold all the correspondence r

Normalization, in case of functional dependencies how we get the higher nor...

in case of functional dependencies how we get the higher normal form.

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

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

Bid Cunt, How do I use strap on?#

How do I use strap on?#

Memory components of sga, Problem 1. Describe the Oracle Architecture w...

Problem 1. Describe the Oracle Architecture with a neat labeled diagram, Also explain the individual components of the Architecture. 2. Write about the following Oracle 9i o

List the steps for converting state diagram to the code, List the steps for...

List the steps for converting state diagram to the code. a) Finding major control path b) Finding the conditional statements  c) Finding the loops  d) Finding error ro

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