Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain algorithm of ER To Relational Mapping ?
ER-to-Relational Mapping Algorithm:
1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relation T which involves all the easy attributes of a composite attribute.
2) Step2: Mapping of weak entity types: For each weak entity type W along with owner entity type E, create relation R and involve all easy attributes (or simple components of composite attributes) of W as attributed of R. In addition, involves as foreign key attributes of R, the primary key attribute (s) of relation(s) which correspond to the owner(s) and the partial key of the weak entity type W, if any.
3) Mapping of relationship types: form a relation R, for relationship along with primary keys of participating relations A and B as foreign keys in R. Further to this, any attributes of relationship become an attribute of R also.
4) Mapping of multivalued attributes: For every multilvalued attribute A, form a new relation R. This relation R will involve an attribute corresponding to A, plus primary key attribute K-as a foreign key in R-of the relation which represents the entity category or relationship type that has A as an attribute.
What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction
Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by
Give Concurrent sub states diagram for the classroom and exam held. In Figure, simultaneous substrates have been taken. After passing Minor 1 test you could give Minor 2 test. T
Use inheritance as an implementation technique when you are going to use inheritance as an implementation technique, you can achieve same goal in a safer way by making one cla
Differentiate between Procedural and non procedural languages ? Procedural and non procedural languages - A procedural language specifies the operations to be performed on th
What are the advantages and disadvantages of merging an association into a class? Advantages: i) Less number of tables ii) Faster performance due to the fewer tables
Candidate Key: In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1) Uniqueness: N
Discuss the mechanism to read data from and write to a disk? Disk read/write heads are mechanisms in which read data from or write data to disk drives. The heads have gone by
explain thee diffrent types of data models
why older data models are being replaced by new data models.
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd