Entity set that does not have sufficient attributes known as, Database Management System

Assignment Help:

An entity set that does not have sufficient attributes to form a primary key is called?

An entity set that doesn't have sufficient attribute to form a primary key is known as weak entity set.


Related Discussions:- Entity set that does not have sufficient attributes known as

Mapping, external and internal mapping with examples

external and internal mapping with examples

Give the general form of sql query, Give the general form of SQL query? ...

Give the general form of SQL query? Select  A1, A2............., An From  R1, R2..............., Rm Where  P

Explain alternate key, Explain Alternate key? Alternate Key - All the...

Explain Alternate key? Alternate Key - All the candidate keys except primary key are known as alternate keys.

What is authorization graph, What is authorization graph? Passing of au...

What is authorization graph? Passing of authorization from single user to another can be shown by an authorization graph.

Describe object relational model, Describe Object Relational model ? O...

Describe Object Relational model ? Object Relational Model - This model combines the characteristics of both relational model and object oriented model. It extends the tradit

Function module and a normal abap/4 subroutine, What is the difference betw...

What is the difference between the function module and a normal ABAP/4 subroutine? In contrast to normal subroutines function modules have uniquely exact interface.  Declaring da

Determine the statement- state as location within a program, State as Locat...

State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem

Discuss the different layers of ansi sparc architecture, Q.1 Briefly discus...

Q.1 Briefly discuss the different layers of ANSI SPARC architecture. Ans: The three layers of ANSI SPARC architecture are like this: 1. Internal view is at the lowest leve

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

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,

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