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 transaction? Collections of operations that form a single logical unit of work are known as transactions.
Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap
What is the way a particular application views the data from the database that the application uses? Sub schema is the way a particular application views the data from the data
Question : (a) Database Management Systems (DBMS) is the foundation of business intelligence. Explain the following concepts related to DBMS: (i) Entity Relationship Diagr
Heap files (unordered file) Mostly these files are unordered files. It is the easiest and most basic type. These files having of randomly ordered records. The records will have
#questiontypes of keys examples..
Primary Key The primary key is the candidate key that is selected by the database designer as the principal denotes of identifying entities within an entity set. The left candi
E-R Model This data model is based on real world that consists of basic objects named entities and of relationship among these objects. Entities are illustrated in a database
wrie a report on whether a BSc n information systems develops the skills required by employers in Database administration
I need some help with my normalization database homework.
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