Define the unique constraints for the table client, Database Management System

Assignment Help:

Define the following constraints for the table client.

(i) BAL_DUE must be at least 1000.
(ii) NAME is a unique key.

(i)ALTER TABLE CLIENT
ADD CONSTRAINT CLIENT_BAL_DUE_C1 CHECK(BAL_DUE < 1000);
(ii) ALTER TABLE CLIENT
ADD CONSTRAINT CLIENT_NAME_U UNIQUE(NAME);


Related Discussions:- Define the unique constraints for the table client

Hoework, Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. ...

Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. For every cow they keep the cow’s name, age (or date of birth), breed and numbered plastic ear tag. The each of t

Super keys, A super key is an attribute or set of attributes used to recogn...

A super key is an attribute or set of attributes used to recognize the records uniquely in a relation. For instance, in the Relation PERSON defines earlier PERSON_ID is a super

Describe the benefits of OOD techniques, Describe the benefits of OOD techn...

Describe the benefits of OOD techniques OOD techniques are very useful for development of large and complex systems. It has been noted that large projects that are developed u

Explain the fundamental concepts of object-orientation, Explain the Fundame...

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Explain relevance of data dictionary in a database system, Explain the rele...

Explain the relevance of Data Dictionary in a Database System? Data dictionary is a database in its own right residing on the disk that consist of Meta data which is = Data abo

Use the relational algebra to formulate query, Consider the following datab...

Consider the following database schema: STAFF(StaffNo, fName, lName, Position, sex, dob, branchNo) BRANCH(BranchNo, Street, City) Assume the following for the above database

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Creating views with read only option-data control, Creating views with Read...

Creating views with Read only option : In the view definition this option is used to make sure that no DML operations can be done on the view.

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

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