Update operations in dbms - insert operation, Database Management System

Assignment Help:

Update Operations and Dealing with Constraint Violations

There are three basic operations to be executes on relations:

  • Insertion
  • Deletion
  • Update

The INSERT Operation:

The insert operation permits us to insert a new tuple in a relation. When we try to insert a new record, then any of the following four types of constraints can be violated:

 

  • Key constraint: If the value of the key attribute in new tuple t is the similar as in the existing tuple in relation R.
  • Domain constraint: If the value given to an attribute lies outside the domain of that attribute.
  • Referential Integrity constraint: If the value of the foreign key in t refers to a tuple that doesn't show in the referenced relation.

 • Entity Integrity constraint: If the primary key attribute value of new tuple t is given as null.


Related Discussions:- Update operations in dbms - insert operation

Division operation, To do the division operation R1 ÷ R2, R2 should be a co...

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subse

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

What is the function of io/m signal in the 8085, What is the function of IO...

What is the function of IO/M signal in the 8085? It is a status signal. It is used to differentiate among memory locations and I/O operations. When this signal is low (IO/M = 0

Query to delete constraint from alter table, A constraint named less_than_2...

A constraint named less_than_20 was defined on the field date_of_birth of table student. Delete this constraint. ALTER TABLE student DROP CONSTRAINT less_than_20;

Explain the deadlock avoidance, Define deadlock avoidance. An alternat...

Define deadlock avoidance. An alternative method for avoiding deadlocks is to needs additional information about how resources are to be requested. Each request requires the s

List the armstrong axioms for functional dependencies, List the Armstrong's...

List the Armstrong's axioms for functional dependencies.  What do you understand by soundness and completeness of these axioms?      Ans: The Armstrong's axioms are: F1:

Explain about database system structure, Explain about database system stru...

Explain about database system structure? Storage manager Authorization and integrity manager Transaction manager File manager Buffer manager Storage manager

The first normal form (1nf), The First Normal Form (1NF) Let us first d...

The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1.      There are no duplicate tuples or rows in the relation. 2.

Optimistic concurrency control, Optimistic Concurrency Control Is locki...

Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency

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