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.
The definition of the classes and operation can often be adjusted to increase the amount of inheritance". Justify the above statement. Adjustment of Inheritance The def
What is a Transaction? A transaction is an event which happens on the database. Generally a transaction reads a value from the database or writes a value to the database. If y
Explain in detail about Collaboration Diagrams Collaboration diagrams are interaction diagrams which emphasize structural organisation of an object that transmit and receive m
What is an index? An index is a structure that helps to place desired records of a relation quickly, without probing all records.
The Maximum no of key fields that can be used in a header is?? 50
Explain the Object-oriented decomposition Object-oriented decomposition targets at identifying individual sovereign objects that encapsulate both a state and certain behavio
UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples
Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th
Briefly explain each of the following database terms. Use no more than 2-3 lines for each term. 1. DBMS 2. Update Anomaly 3. Alias (referring to tables in SQL queries)
Spanned and unspanned organisation? Spanned and unspanned organization: If records are not permited to cross block boundaries then the organisation is called unspanned record
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