Unit database integrity, Database Management System

Assignment Help:

Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic needs may still have some undesirable characteristics such as data redundancy, and anomalies.

What are these undesirable characteristics and how can we eliminate them from the database system? This part is an attempt to answer this question. Though, please note that most of these undesirable properties do not arise if the database modelling has been carried out very carefully using some method like the Entity-Relationship Model. It is still important to use the methods in this unit to check the database that has been acquired and ensure that no mistakes have been made in modeling.

The central thought in these discussions is the concept of Database integrity, the notion of functional dependency, which rely on understanding the semantics of the data and which deals with what information in a relation is dependent on what other information in the relation. Our prime objective in this section is to describe the concept of data integrity, functional dependence and then describes normal forms using functional dependencies and using other types of data dependencies.

OBJECTIVES

After reading this section you should be able to

  • Explain the concept of entity integrity;
  • Define relational database referential integrity constraints;
  • Explain the concept of functional dependency, and
  • show how to use the dependencies information to decompose relations; whenever essential to obtain relations that have the desirable properties that we want without losing any of the information in the original relations.

 


Related Discussions:- Unit database integrity

Define deadlock detection, Define Deadlock detection If a system does ...

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

ER Diagram, Soccer player ER Diagram to Relational database schema

Soccer player ER Diagram to Relational database schema

Define the terms physical schema and logical schema., Define the terms 1) p...

Define the terms 1) physical schema 2) logical schema. Physical schema: The physical schema explains the database design at the physical level, which is the lowest level of abs

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Give the forms of triggers, Give the forms of triggers? The triggering ...

Give the forms of triggers? The triggering event can be insert or delete. For updated the trigger can state columns. The referencing old row as clause The referencing

Normalization database, I need some help with my normalization database hom...

I need some help with my normalization database homework.

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

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