A weak entity set and its identifying relationship, Database Management System

Assignment Help:

Q. Define a weak entity set and its identifying relationship. List the necessary conditions for a meaningful identifying relationship set of a weak entity set.   

Entity is a thing which can be distinctly identified it then goes on to classify entities into regular entities and weak entities, a weak entity is entity whtity which existence depend on some other  entity in the sense that it cannot exist  if  that other does not exist,  According to figure an employee's dependents might be weak entities they cannot exist if the relevant employee does not exist. Properties: Entities- also relationship have properties. All entities or relationship of a given type have certain kinds of properties in common; for example, all employees have an employee number, a name, a salary and so on. Each kind of property draws its values from a corresponding value set (in other words, a type or domain ). Furthemore properties can be: Simple or Composite: For example, the composite property" employee name" might be made up of the simple properties. "First name", "Middle initial" and "Last name. Key: Unique possibly with some context; for example, a dependent's name might be unique within the context of a given employee. Single or Multi-valued: All properties shown in figure are simple valued but if, for example, a given supplier could have several distinct location, then "supplier city" might be a multivalued property. Missing:Unknown or not applicable as illustrated in figure. Bace or Derived: For example, "total quantity" for a given part might be derived as the sum of the individual shipment quantities for that part. Relationship: Relationship is an association entities. For example, there is a relationship called DEPARTMENT-EMPLOYEE between departments and employees, representing the fact that certain departments are said to be the participants in that relationship. The number of participanrs in a given relationship is called the degree of the relationship. Sol.(b) the genetalization and sdecialization diagram for a given problem is as shown in the figure below At lowest level entities become the subtype or categories to the supertype. Generalization is a form of abstraction that specifies that two or mre entities that share common attributes can be generalezed into higher level entity type called a super type or generic entity. Here in this example the lowest level entities such as motor cycle car vans and buses have several common attributes which can be generalized into the entity type VEHICLE as shown in figure. Generalization process can be viewed as inverse of specialization process. Therefore in figure we can view as a specialization of VEHICLE rather than viewing VEHICLE as a generalization of CAR, VANS, BUSES and MOTOR CYCLE. 

 


Related Discussions:- A weak entity set and its identifying relationship

Domains, Every simple attribute of an entity type have a possible set of va...

Every simple attribute of an entity type have a possible set of values that can be attached to it. This is known as the domain of an attribute. An attribute cannot have a value out

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

Briefly describe the different kinds of users of a dbms, Briefly describe t...

Briefly describe the different kinds of users of a DBMS.  Ans: Different sorts of DBMS users are: (a)  Software Engineers: These are the people accountable for developing ap

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Explain controlled redundancy, Explain controlled redundancy? Controll...

Explain controlled redundancy? Controlled redundancy : The replication of data within the data warehouse for the purposes of improved data access or understand ability.

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Explain displaying an er schema as an er diagram, Explain the conventions f...

Explain the conventions for displaying an ER schema as an ER diagram? An E-R Diagram scheme might describe certain constraints to that the contents of a database must conform.

By which techniquestransaction processing is associated, By which technique...

By which techniquesTransaction processing is associated? Transaction processing is associated by producing detail, summary, or exception reports and recording a business activi

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Importance of file organisation in database, Importance Of File Organisatio...

Importance Of File Organisation In Database To execute a database efficiently, there are various design tradeoffs needed. One of the most vital ones is the file Organisation. F

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