A Design for Problem Decomposition Models In The Development Of Software Intensive System
Saravana Moorthy R, Ashish Kumar Sharma · 2014
Decomposition in computer science is also known as factoring, refers to the process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program, and maintain. We formally define the problem of data model decomposition as follows: The initial system (or problem state) is a data model (D), consisting of a set of entities (E) and a set of relationships (R). Each relationship in R defines an association between two entities in E, although the entities may not be distinct (i.e. recursive relationships are allowed). The terminal system (or solution state) is a hierarchy of n subject areas (S), organized into a finite number of levels (L1, L2, …). Successive levels in the hierarchy represent increasing levels of abstraction from the original data model.