Explain weak and strong entity sets, Database Management System

Assignment Help:

Explain weak and strong entity sets?

Weak and Strong entity sets: A physically powerful entity set has a primary key. All tuples in the group are distinguishable through that key. A weak entity set has no primary key unless attributes of the tough entity set on which it depends are included. Tuples in a weak entity grouped are partition according to their relationship along with tuples within a strong entity set. Tuples inside each partition are discernible by a discriminator, that is a set of attributes. A strong entity set has a primary key. All tuples within the set are distinguishable through that key. A weak entity set has no primary key unless attributes of the strong entity set on that it depends are included. Tuples in a weak entity set are partitioned according to their relationship along with tuples in a strong entity set. Tuples within each partition are discernible through a discriminator that is a set of attributes.


Related Discussions:- Explain weak and strong entity sets

Php optimization on iis 8, Project Description: We have purchased facebo...

Project Description: We have purchased facebook style chat software which we are using with our site. It is prepared in PHP but the rest of the site is developed asp.net. Iss

What is multilevel index, Multilevel Index The Multilevel Index is a m...

Multilevel Index The Multilevel Index is a modification of the secondary level index system. In this system we might be use even more number of levels in case the table is eve

The structured query language, The Structured Query Language INTRODUCT...

The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

Multilevel indexing scheme, Multilevel Indexing Scheme Consider the ind...

Multilevel Indexing Scheme Consider the indexing scheme where the address of the block is consider in the index for each record, for a little file, this index would be little a

Explain interblock gap, Explain Interblock gap? Interblock Gap - A trac...

Explain Interblock gap? Interblock Gap - A track of a disk is separated into equal-sized disk blocks. Blocks are separated through fixed-size gaps, called as interblock gaps th

Why dml is used for, Why DML is used for? DML is used to Manipulation and...

Why DML is used for? DML is used to Manipulation and processing of database. DML is provided for manipulation & processing of database. (Data stored in the database is processed

Availability-data replication, Availability: A site having the copy of a r...

Availability: A site having the copy of a replicated relation fails, even then the relation may be found in another site. Therefore, the system may carry on to process at least th

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Need for multiple access paths, Need for Multiple Access Paths In pract...

Need for Multiple Access Paths In practice, most of the online information systems need the support of multi-key files. For example, consider a banking database application hav

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