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 the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them?
Generalization: Consider extending the entity set account through classifying accounts as being either savings-account or chequing-account. Each of these is described through the attributes of account plus additional attributes. (Savings has interest-rate and cheque has overdraft-amount.) We can express the similarities among the entity sets through generalization. This is the procedure of forming containment relationships among a higher-level entity set and one or more lower-level entity sets.
Aggregation: The E-R model cannot express relationships between relationships. When would we require such a thing?
Consider a DB along with information about employees who work on a particular project and use a number of machines doing in which work. We get the E-R diagram shown in Figure.
Figure: E-R diagram with redundant relationships
Relationship sets work and uses could be combined into a single set. Therefore, they shouldn't be, as this would obscure the logical structure of this scheme. The solution is to use aggregation.• An abstraction by those relationships is treated as higher-level entities.• For our instance, we treat the relationship set work and the entity sets employee and project as a higher-level entity set called work.• Another figure shows the E-R diagram with aggregation.
What disadvantage of ODBC does OLE DB overcome? By breaking the features and the methods of a DBMS into COM objects, OLE DB characteristic overcomes a main disadvantage of ODBC
MOSS VALE is a town with 15000 inhabitants. The fire department wishes to develop a system that automates the despatch of fire engines to attend fires. The ERD below describes the
Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))
Using the questions found at the end of Chapter 9 in your textbook, complete this homework activity. Students will submit a Word document answering questions 2, 3, and 4.
Determine the concept of Process Process: A process transforms the data values. It is represented as ellipse containing a description of transformation. Each procedure has a
Two-way Associations Mostly, associations are travel in both directions, although not usually with same frequency. There are three approaches for the implementation. In
What is normalization? It is a method of analysing the given relation schemas based on their Functional Dependencies (FDs) and primary key to attain the properties (1).Minim
Define Sequence A sequence is a set of integers 1, 2, 3 that are generated in order on demand. Sequences are regularly used in databases because lots of applications require ev
What was the method in which records are physically stored in a specified order according to a key field in each record ? A method in which records are physically stored within
client server architeutre
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