Deletion operation - update operations, Database Management System

By using the delete operation some consisting records can be deleted from a relation. To delete some definite records from the database a condition is also specified based on which records can be taken for deletion.

Constraints that can be violated during deletion

Only one type of constraint can be violated during deletion, it is referential integrity constraint. It can happen when you want to delete a record in the table where it is referenced by the foreign key of another table.  Please read the example given below very carefully.

Posted Date: 3/6/2013 5:38:26 AM | Location : United States







Related Discussions:- Deletion operation - update operations, Assignment Help, Ask Question on Deletion operation - update operations, Get Answer, Expert's Help, Deletion operation - update operations Discussions

Write discussion on Deletion operation - update operations
Your posts are moderated
Related Questions
Explain data dictonary on oracle ? Data Dictionary - Data dictionaries are the system tables in which contain descriptions of the database objects and how they are structured.

In a Hierarchical model of data records are organized ? In the hierarchical model of data records are organized as Tree structure.


Authorisation Authorisation is the culmination of the administrative policies of the organisation.  As the name shows, authorisation is a set of rules that can be used to verif

Is it mandatory to declare all the tables in Report by the key word tables for all the tables that exist in the structure of LDB, and are being explained in the Database part of LD

What are the differences among MySQL_fetch_array(), MySQL_fetch_object(), MySQL_fetch_row()? Mysql_fetch_object returns the result from the database like objects while mysql

Explain Domain calculus Domain calculus is one of the types of the relational calculus. The formal specification of the domain calculus was planned after the development of the

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Define Aggregate functions and what aggregate functions supported by the MySQL To calculate a summary value from a set of individual values and uses one of the functions known