Define an abstraction, Database Management System

Assignment Help:

Define an abstraction by which relationships are treated as higher level entities

Ans: Aggregation. 

It is an abstraction by which relationships are treated as higher level entities Aggregation. (In ER diagram, aggregation is utilized to denote a relationship as an entity set.)


Related Discussions:- Define an abstraction

What are composite attributes, What are composite attributes? Composite...

What are composite attributes? Composite attributes can be separated in to sub parts.

Define network dbms, Define Network DBMS The NDBMS is built primarily o...

Define Network DBMS The NDBMS is built primarily on a one-to-many relationship, but where a parent-child representation between the data items cannot be ensured. This may occur

Views, what is view?explain

what is view?explain

Explain the term- inheritance, What is inheritance? Inheritance is an ...

What is inheritance? Inheritance is an object orientation concept that allows reusability of code / design. Basic sense of inheritance is that if one class is predefined than a

Construct an er diagram for a hospital, Construct an ER diagram for a hospi...

Construct an ER diagram for a hospital along with a set of patients and a set of medical doctors Associate with every patient a log of the several tests and examinations conducted.

File organization, what is file organization? what are file organization te...

what is file organization? what are file organization techniques.explain in detail? explain random file organization technique, multikey file organization technique?what is indexin

Define lock, Define lock? Lock is the most common used to execute the r...

Define lock? Lock is the most common used to execute the requirement is to permit a transaction to access a data item only if it is currently holding a lock on that item.

Sql, find the name of supplier who supply some red part

find the name of supplier who supply some red part

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Erd, Table_Name( attribute_1, attribute_2, attribute_3, ….. ,attribute_x) ...

Table_Name( attribute_1, attribute_2, attribute_3, ….. ,attribute_x) Primary Key ( attribute_1, attribute_2) Foreign Key attribute_4 References Table_Name_2 (repeat for each fore

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd