What is the object-oriented decompositions, Database Management System

Assignment Help:

Object-oriented decompositions

Object-oriented decompositions of systems better are able to cope with change. Each subsystem has a well-defined interface which communicates with remaining system.  All of these interfaces define all form of interaction which is required for proper functioning of whole system, but internal implementations are left to sub-system itself. This is since they manage to encapsulate those items which are likely to change (for example functionality, sequence of behaviour and attributes) within an object and hide them from outside world. The benefit is that the outside cannot see them, and thus cannot be dependent on them and does not need to get changed if these items change. Also, object-oriented decompositions are nearer to the problem domain, because they directly represent real-world entities in their structure and behaviour. The abstraction primitives built into reuse have a massive potential of reuse as commonalities among similar objects can be factored out and then, the solutions can be reused.

1784_obejct oriented decomposition.png

                                   Figure: OO Decomposition (OOD)


Related Discussions:- What is the object-oriented decompositions

Key, Q.   Explain the terms key constraints participation constraints and m...

Q.   Explain the terms key constraints participation constraints and mapping caradinalities in ER model.  Participation Constraints :   The participation of an entity set E i

Er digrams, what is er digram given that example of hospital,bank and libra...

what is er digram given that example of hospital,bank and library er digram.

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

What is system catalog or catalog relation, What is system catalog or catal...

What is system catalog or catalog relation? How is better known as? A RDBMS maintains a explanation of all the data that it contains, information about every relation and index

Update anomaly-data redundancy, Update Anomaly : This anomaly is occurred d...

Update Anomaly : This anomaly is occurred due to data redundancy. Redundant information makes updates more complex since, for example, varying the name of the instructor of MCS-014

Process to find the non-concurrent objects, Process to find the non-concurr...

Process to find the non-concurrent objects Once we find out non-concurrent (mutually exclusive) objects, we can fold all objects together in one thread of process or control. O

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