Explain the process-oriented decomposition, Database Management System

Assignment Help:

Breaking into Subsystems

Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the problem becomes less complex and easier to overlook and to deal with. Frequently dividing a problem will lead to sub problems which are small enough so that they can be conquered. After all sub problems have been conquered and solutions to that problem have been found, solutions need to be combine in order to obtain the solution of whole problem. The history of computing has seen two forms of decomposition: object-oriented and process-oriented decomposition.


Related Discussions:- Explain the process-oriented decomposition

Describe physical data independence, Describe Physical Data independence ? ...

Describe Physical Data independence ? Physical Data Independence - It is capacity to modify the internal schema without having to change conceptual schema. Therefore, the exter

In e-r diagram how relationship type is represented, In E-R Diagram how rel...

In E-R Diagram how relationship type is represented ? In E-R Diagram relationship type is represented as a Diamond.

How many types of users works on database, How many types of users works on...

How many types of users works on database? Users are differentiated through the way they expect to interact along with the system (i) Application programmers-interact with

Define the concept of aggregation, Define the concept of aggregation.  Give...

Define the concept of aggregation.  Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Ordering of tuples, In a relation, tuples are not inserted in any definite ...

In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later accordin

What are domain constraints, What are domain constraints?  A  domain is...

What are domain constraints?  A  domain is  a  set  of  values  that  might  be  assigned to an attribute  .all  values that appear in a  column of a relation must be taken fro

What is sql profiler, What is SQL Profiler? SQL Profiler is a graphical...

What is SQL Profiler? SQL Profiler is a graphical tool that permits system administrators to monitor events in an instance of Microsoft SQL Server. You can capture and save dat

Explain domain-oriented relational calculus?, How does Tuple-oriented relat...

How does Tuple-oriented relational calculus vary from domain-oriented relational calculus? The tuple-oriented calculus uses a tuple variables i.e., variable whose only allowed

Secondary indexes, Secondary Indexes Let consider the student database ...

Secondary Indexes Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to

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