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.
as a customer service employee, explain five measures you would recommend a displeased student to patronise a school canteen
Explain Network Model in DBMS? Network Model - It was formalised within the late year of 1960s through the Database Task Group of the Conference on Data System Language (DBTG
In this exercise you will create ten records, each containing the following fields: student name, class: Freshman, Sophomore, Junior or Senior, Major: Liberal Arts or General Sci
Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside
Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the t
Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th
I need some help with my normalization database homework.
Hi I have got an assignment for making an er diagram for market management software can any budy help me?
What is a database graph? The partial ordering implies that the set D may now be viewed as a directed acyclic graph, known as a database graph.
what are the type of the database
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