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

Describe five main functions of a database administrator, Describe five mai...

Describe five main functions of a database administrator. Ans: A database administrator (DBA) is a person who is accountable for the environmental aspects of a database. Genera

Referential integrity, It can be easily defined as: The database must no...

It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe

Support by adding indexes, Support by Adding Indexes Multiple indexes c...

Support by Adding Indexes Multiple indexes can be used to access a data file by multiple access paths. In such a scheme only single copy of the data is consider, only the numbe

Compare three clustering algorithms in weka, Compare three clustering algor...

Compare three clustering algorithms in Weka. For this comparison, you will need to use at least two different datasets. Run the algorithms on the datasets, and use the visual

Non-redundant cover and canonical cover, Given the following set of functio...

Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.

List the drawbacks of relational database system, List the drawbacks of rel...

List the drawbacks of relational database system A) Repetition of data B) Inability to s certain information.

Briefly explain the state diagram by taking one example, Briefly explain th...

Briefly explain the state diagram by taking one example. State Diagram - An object can be given a sequence of input instructions. The state of the object can vary depending u

Define views in relational algebra, Views in relational algebra:   1. B...

Views in relational algebra:   1. Basic expression contains either  a) A relation in the database. b) A constant relation. 2.  General expressions are madde out of sma

Unrepeatable reads-problems of concurrent transactions, Unrepeatable reads ...

Unrepeatable reads : Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. B

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