Define partial key and primary key, Database Management System

Assignment Help:

Define Partial Key and Primary Key

A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar owner entity. Primary key is a unique key but not comprise null values. An entity set can comprise at most one primary key.


Related Discussions:- Define partial key and primary key

Difference between operating system and database security, Difference betwe...

Difference between Operating System and Database Security Security within the operating system can be executed at various levels ranging from passwords for access to system, t

We need help in booking system for golf business, We need help in Booking S...

We need help in Booking System for Golf Business Development of a web based booking system which permits clients to book golf lessons with the following features- a) 4 user p

Data analysis and design, give some example real-life situations where DBMS...

give some example real-life situations where DBMS are most suiitabe

What are the two main goals of parallelism, What are the two main goals of ...

What are the two main goals of parallelism? Load -balance multiple small accesses, so that the  throughput of such accesses enhances. Parallelize large accesses so that the res

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Explain transaction manager and their work, Explain Transaction manager and...

Explain Transaction manager and their work? Transaction Manager: Ensure the database remains in a constant (correct) state despite system failure, and in which concurrent trans

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

Basic set operation, These are the binary operations; i.e., each is applied...

These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R

Consistency, what do you mean by consistency in rdbms?

what do you mean by consistency in rdbms?

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