Explain the structured decomposition, Database Management System

Assignment Help:

Differentiate between the object oriented decomposition and the structured decomposition?

Process-oriented (structural) decomposition divides a complex process, function or task into easier subprocesses until they are easy enough to be dealt with. The solutions of these subfunctions then require be integrating and executing in certain sequential or parallel orders in order to obtain the solution to large complex system. On the other hand object-oriented decomposition targets at identifying individual autonomous objects which encapsulate both state and certain behaviour. Each main component of system is called subsystem. Then, communication between these objects leads to desired solutions. Object-oriented decompositions of the systems tend to be better able to cope with modification. Each subsystem has well-defined interfaces that communicate with rest of system.

 


Related Discussions:- Explain the structured decomposition

Wait-die scheme -deadlock prevention, Wait-die" scheme : The idea is based ...

Wait-die" scheme : The idea is based on non-preventive method. It is based on a simple rule:                                 If Ti requests a database resource that is held by T

Why were functional methods fashionable in early days, Why were functional ...

Why were functional methods fashionable in early days? These are inspired directly by computer architecture and thus popular among computer scientist in early days. The divisio

Illustrate the term- abstracting out common behaviour, Illustrate the term-...

Illustrate the term- Abstracting Out Common Behaviour Inheritance is not every time recognised during analysis phase of development, thus it is necessary to re-evaluate object

Describe the algorithm for updating indices, Describe the algorithm for upd...

Describe the algorithm for updating indices for a single level index when a record is    (i) Inserted  (ii)  deleted What will be the modification if there are multilevel in

Equijoin, When every condition appears with equality condition (=) only. c)...

When every condition appears with equality condition (=) only. c)   Natural join (denoted by R*S) When two join attributes have the similar name in both relations. (Tha

Sparse and dense indexes, Sparse and Dense Indexes These indexes in pri...

Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

Describe database state in details, Describe Database state in details? ...

Describe Database state in details? Database state: The actual data within the database at a particular moment in time is known as a database state.

In e-r diagram how generalization is represented, In E-R diagram how genera...

In E-R diagram how generalization is represented? in E-R diagram generalization is represented by Triangle shape.

ER Diagram, A database will be made to store information about patients in ...

A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded where poss

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