UNIT-II PART -A 1. What is Data Model?

A collection of conceptual tools for describing data, data relationships data semantics and constraints. 2. What is E-R model? This data model is based on real world that consists of basic objects called entities and of relationship among these objects. Entities are described in a database by a set of attributes. 3. Define Entity Entity An entity is an object or concept about which you want to store information. 4. Define Weak Entity Weak Entity Attributes are the properties or characteristics of an entity. 5. Define ey att!i"#te

ey att!i"#te A key attribute is the uni ue, distinguishing characteristic of the entity. !or e"ample, an employee#s social security number might be the employee#s key attribute. $. Define M#lti%al#ed att!i"#te

M#lti%al#ed att!i"#te A multi$alued attribute can ha$e more than one $alue. !or e"ample, an employee entity can ha$e multiple skill $alues. %. Define De!i%ed att!i"#te De!i%ed att!i"#te A deri$ed attribute is based on another attribute. !or e"ample, an employee#s monthly salary is based on the employee#s annual salary. &.Define Relationshi&s Relationshi&s 'elationships illustrate how two entities share information in the database structure. (.Define 'a!dinality 'a!dinality )ardinality specifies how many instances of an entity relate to one instance of another entity. (). What a!e the ti&s fo! effe*ti%e e! dia+!ams TIP, -.R E--E'TI/E ER DIA0RAM, (1 *ake sure that each entity only appears once per diagram. 21 +ame e$ery entity, relationship, and attribute on your diagram. 31 E"amine relationships between entities closely. Are they necessary, Are there any relationships missing, Eliminate any redundant relationships. -on#t connect relationships to each other.

31 .se colors to highlight important portions of your diagram. 11. Define !elationshi& A !elationshi& is an association between se$eral entities. 12. Define !elationshi& set A !elationshi& set is a set of relationships of the same type. 1/.What is meant "y Ma&&in+ 'a!dinalities Ma&&in+ 'a!dinalities4 e"press the number of entities to which another entity can be associated $ia a relationship. !or binary relationship sets between entity sets A and 0, the mapping cardinality must be one of1

14. What is ."5e*t .!iented model? This model is based on collection of objects. An object contains $alues stored in instance $ariables with in the object. An object also contains bodies of code that operate on the object. These bodies of code are called methods. 2bjects that contain same types of $alues and the same methods are grouped together into classes.

13. .What a!e the disad%anta+es of 6yte st!in+ !e&!esentation 0yte string representation has se$eral disad$antages1
o o

4t is not easy to re5use space left by a deleted record 4n general, there is no space for records to grow longer. 6*ust mo$e to e"pand, and record may be pinned.7

18..What a!e the diffe!ent 7ays of o!+ani8in+ !e*o!ds in files ?

There are se$eral ways of organi9ing records in files.

heap file organi9ation. se uential file organi9ation hashing file organi9ation. clustering file organi9ation

1%. What a!e the diffe!ent ty&es of indi*es ? There are two kinds of indices.
o

2rdered indices1 indices are based on a sorted ordering of the $alues. :ash indices1 indices are based on the $alues being distributed uniformly across a range of buckets. The buckets to which a $alue is assigned is &.-efine 0; tree

A 0 5tree inde" is a balanced tree in which e$ery path from the root to a leaf is of the same length 1&..Name the s#"-systems of a RD6M, 4<2, =ecurity, >anguage ?rocessing, ?rocess )ontrol, =torage *anagement, >ogging and 'eco$ery, -istribution )ontrol, Transaction )ontrol, *emory *anagement, >ock *anagement 1(.What a!e the diffe!ent 7ays of o!+ani8in+ !e*o!ds in files ? There are se$eral ways of organi9ing records in files.

heap file organi9ation. se uential file organi9ation hashing file organi9ation. clustering file organi9ation

2@ . What a!e &a!tial9 alte!nate99 a!tifi*ial9 *om&o#nd and nat#!al key? Pa!tial ey4 4t is a set of attributes that can uni uely identify weak entities and that are related to same owner entity. 4t is sometime called as -iscriminator. Alte!nate A!tifi*ial ey4 ey4 All )andidate Aeys e"cluding the ?rimary Aey are known as Alternate Aeys. 4f no ob$ious key, either stand alone or compound is a$ailable, then the last resort is to simply create a key, by assigning a uni ue number to each record or occurrence. Then this is known as de$eloping an artificial key. 'om&o#nd ey4 4f no single data element uni uely identifies occurrences within a construct, then combining multiple elements to create a uni ue identifier for the construct is known as creating a compound key. Nat#!al ey4 Bhen one of the data elements stored within a construct is utili9ed as the primary key, then it is called the natural key. 21. Define +ene!ali8ation. Cenerali9ation is the process of forming containment relationships between a higher5le$el entity set and one or more lower5le$el entity sets. 22. What a!e the %a!io#s Pitfalls in Relational D6 Desi+n Pitfalls in Relational D6 Desi+n A bad design may ha$e se$eral properties, including1

'epetition of information. 4nability to represent certain information. >oss of information.

2/. Define No!mali8ation +ormali9ation is the process where a database is designed in a way that remo$es redundancies, and increases the clarity in organi9ing data in a database. 24. Define (st No!mal -o!m (st No!mal -o!m o! (N-4
Each )olumn Type is .ni ue.

23. Define 2nd No!mal -o!m 2nd No!mal -o!m o! 2N-4 The entity under consideration should already be in the 1+! and all attributes within the entity should depend solely on the entity#s uni ue identifier.

28. Define 3!d No!mal -o!m

3!d No!mal -o!m o! 3N-4 The entity should already be in the 2+! and no column entry should be dependent on any other entry 6$alue7 other than the key for the table. 4f such an entity e"ists, mo$e it outside into a new table. +ow if these /+! are achie$ed, the database is considered normali9ed. 0ut there are three more #e"tended# +! for the elitist.

2:. Define 6'N- ;6oy*e < 'odd14 6'N- ;6oy*e < 'odd14 The database should be in /+! and all tables can ha$e only one primary key. 2=. Define 3N-4 3NTables cannot ha$e multi5$alued dependencies on a ?rimary Aey.

PART >6
1. -iscuss about $arious -ata models.

2. E"plain the $arious concepts in E' -iagram . /. -raw the E' diagram for 0anking =ystem . 4. E"plain the $arious concepts in normali9ation . 3. -iscuss about Ceneralation and Aggregation DDDDDDDDDDDDDDD