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 the candidate key functions, Describe the candidate key functions ...

Describe the candidate key functions ? Candidate Key and Alternate Key: In some instances, an entity will have more than one attribute which can serve as a primary key. Any key

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

Normalization database, I need some help with my normalization database hom...

I need some help with my normalization database homework.

Explain about sql server 2000, What is the difference between SQL Server 2...

What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of

Explain equivalent relational schema, Question: (a) Use the following b...

Question: (a) Use the following business rules to produce the E-R diagram. You should clearly show all the minimum and maximum cardinality constraint on each side of the relati

Explain recursive relationship type, Explain Recursive relationship type? ...

Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

Describe the definition of a transaction in sql, Describe the definition of...

Describe the definition of a transaction in SQL  Ans: The SQL transaction starts implicitly. Transactions are finished by either Commit work that commits the transaction and st

Difference among a database schema and a database state, What is the differ...

What is the difference among a database schema and a database state? The collection of information stored in database at particular moment in time is known as database state a

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