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!
One-to-one relationship:
For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participation and add primary key attribute of one more entity E2 as a foreign key attribute in the table of entity (E1). We will also have all the simple attributes of relationship type R in E1 if any.
For instance, the DEPARTMENT relationship has been extended to contain head-Id and attribute of the relationship. Please note we will maintain information in this table of only present head and Date from which s/he is the head.
There is one Head_of 1:1 relationship among FACULTY and DEPARTMENT. We select DEPARTMENT entity having total participation and add primary key attribute ID of FACULTY entity as a foreign key in DEPARTMENT entity named as Head_ID. Now the DEPARTMENT table will be as follows:
DEPARTMENT
D_NO
D_NAME
Head_ID
Date-from
How do you find the final model after iterative analysis? Why is iterative analysis of any of the problem needed? The final model serves as the base for system architectur
under what condition log based recovery is feasible?
An orchestra database consists of the following relations: CONDUCTS (conductor, composition) REQUIRES (composition, Instrument) PLAYS (Player, Instrument) Give the relational
Need for Multiple Access Paths In practice, most of the online information systems need the support of multi-key files. For example, consider a banking database application hav
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 relatio
Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient. Figure:
brief history,definition,current trends and future trends if any of data fragmentation
Objectives After Reading this part, you should be able to: Explain the term CONCURRENCY; Describe the term transaction and concurrent transactions; Talk about co
Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent
Improved performance: As the data is located near the site of its demand, and given the inherent parallelism because of multiple copies, speed of database access may be good for di
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