Explain cascade and restrict clauses of drop schema command, Database Management System

Assignment Help:

Explain several types of constraints that can be specified using CREATE TABLE command. Explain CASCADE and RESTRICT clauses of DROP SCHEMA command?

Constraint Description
PRIMARY KEY Determines that column(s) uniquely identifies each record. The primary key cannot be NULL, and the data value(s) must be unique.

FOREIGN KEY In a one-to-many relationship, the constraint is added to the "many" table. The constraint ensures which if a value is entered into a specified column, it must already exist in the "one" table, or the record is not added.

UNIQUE Ensures that all data values stored in a specified column are unique.
The UNIQUE constraint differs from the PRIMARY KEY constraint in which it permits NULL values.
CHECK Ensures in which a specified condition is true before the data value is added to a table. For example, an order's ship date cannot be previous than its order date.

NOT NULL Ensures in which a specified column cannon contain a NULL value. The NOT NULL constraint can just be created along with the column-level approach to table creation.

Prevents the DROP from taking place if any dependent objects exists (RESTRICT) or causes all dependent objects do also be dropped (CASCADE).


Related Discussions:- Explain cascade and restrict clauses of drop schema command

Transaction states, The following variant of the primary copy asynchronous-...

The following variant of the primary copy asynchronous-update replication protocol has been proposed for totally replicated systems. (a)  A transaction executing at site A updat

What are the components of storage manager, What are the components of stor...

What are the components of storage manager? The storage manager components include a) Authorization and integrity manager b) Transaction manager c) Buffer manager d

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Transaction, Draw the precedence graph of the following schedule and determ...

Draw the precedence graph of the following schedule and determine whether the schedule is serializable. (Note that all instructions, except lock and unlock, are omitted. We assume

Difference between a composite key and attribute, Question: (a) Discuss...

Question: (a) Discuss the difference between a composite key and a composite attribute. How would each be indicated in an E-R diagram? Support your answer with appropriate exam

Describes the several relationship constraints, Describes the several relat...

Describes the several relationship constraints through giving suitable example? Constraints on relationships: There are two kinds of constraints on relationships. 1) Mapping

Locking, define locking in simple language and decribed it

define locking in simple language and decribed it

Draw the architecture of mysql, Data Base Management System 1. Draw the...

Data Base Management System 1. Draw the Architecture of MySQL and explain about its subsystems briefly. 2. Elaborate with the help of an example the concept of Primary key a

Durability-transaction , Durability : This property necessitates that once ...

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

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