--Your friends at LectureNotes

Note for Database Management System - DBMS by NivethaaShree Babu

  • Database Management System - DBMS
  • Note
  • Uploaded 9 months ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-2

eg: age which can be derived from (currentdate-birthdate) experience_in_year can be calculated as (currentdate-joindate) d) NULL valued attribute: The attribute value which is unknown to user is called NULL valued attribute. Relationship sets: A relationship is an association among several entities. A relationship set is a set of relationships of the same type. Formally, it is a mathematical relation on n>=2 entity sets. If E1,E2…En are entity sets, then a relation ship set R is a subset of {(e1,e2,…en)|e1Є E1,e2 Є E2..,en Є En} where (e1,e2,…en) is a relation ship. Consider the two entity sets customer and loan. We define the relationship set borrow to denote the association between customers and the bank loans that the customers have. Mapping Cardinalities: Mapping cardinalities or cardinality ratios, express the number of entities to which another entity can be associated via a relationship set. Mapping cardinalities are most useful in describing binary relationship sets, although they can contribute to the description of relationship sets that involve more than two entity sets. For a binary relationship set R between entity sets A and B, the mapping cardinalities must be one of the following: one to one: An entity in A is associated with at most one entity in B, and an entity in B is associated with at most one entity in A. Eg: relationship between college and principal One to many: An entity in A is associated with any number of entities in B. An entity in B is associated with at the most one entity in A. Eg: Relationship between department and faculty

Text from page-3

Many to one: An entity in A is associated with at most one entity in B. An entity in B is associated with any number in A Many –to-many: Entities in A and B are associated with any number of entities from each other. More about entities and Relationship: Recursive relationships: When the same entity type participates more than once in a relationship type in different roles, the relationship types are called recursive relationships. Participation constraints: The participation constraints specify whether the existence of any entity depends on its being related to another entity via the relationship. There are two types of participation constraints Total : .When all the entities from an entity set participate in a relationship type , is called total participation. For example, the participation of the entity set student on the relationship set must ‘opts’ is said to be total because every student enrolled must opt for a course. Partial: When it is not necessary for all the entities from an entity set to particapte ion a relationship type, it is called participation. For example, the participation of the entity set student in ‘represents’ is partial, since not every student in a class is a class representative.

Text from page-4

Weak Entity: Entity types that do not contain any key attribute, and hence can not be identified independently are called weak entity types. A weak entity can be identified by uniquely only by considering some of its attributes in conjunction with the primary key attribute of another entity, which is called the identifying owner entity. Generally a partial key is attached to a weak entity type that is used for unique identification of weak entities related to a particular owner type. The following restrictions must hold: • The owner entity set and the weak entity set must participate in one to may relationship set. This relationship set is called the identifying relationship set of the weak entity set. The weak entity set must have total participation in the identifying relationship. Example: Consider the entity type dependent related to employee entity, which is used to keep track of the dependents of each employee. The attributes of dependents are : name ,birthrate, sex and relationship. Each employee entity set is said to its own the dependent entities that are related to it. How ever, not that the ‘dependent’ entity does not exist of its own., it is dependent on the employee entity. In other words we can say that in case an employee leaves the organization all dependents related to without the entity ‘employee’. Thus it is a weak entity. Keys: Super key: A super key is a set of one or more attributes that taken collectively, allow us to identify uniquely an entity in the entity set. For example , customer-id,(cname,customer-id),(cname,telno) Candidate key: In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the following properties: • Uniqueness: no two distinct tuples in R have the same values for the candidate key • Irreducible: No proper subset of the candidate key has the uniqueness property that is the candidate key. Eg: (cname,telno) Primary key: The primary key is the candidate key that is chosen by the database designer as the principal means of identifying entities with in an entity set. The remaining candidate keys if any, are called alternate key.

Text from page-5

Advanced ER-diagram: Abstraction is the simplification mechanism used to hide superfluous details of a set of objects. It allows one to concentrate on the properties that are of interest to the application. There are two main abstraction mechanism used to model information: Generalization and specialization: . Generalization is the abstracting process of viewing set of objects as a single general class by concentrating on the general characteristics of the constituent sets while suppressing or ignoring their differences. It is the union of a number of lower-level entity

Lecture Notes