Both sides previous revision
Previous revision
Next revision
|
Previous revision
|
hekate:ardplus [2009/03/23 08:50] kinio |
hekate:ardplus [2019/06/27 15:49] (current) |
All attributes ''PC'' consists of have to belong to properties ''P<sub>1</sub>, ... P<sub>r</sub>''. | All attributes ''PC'' consists of have to belong to properties ''P<sub>1</sub>, ... P<sub>r</sub>''. |
No new attributes can be introduced for properties ''P<sub>1</sub> ... P<sub>r</sub>''. | No new attributes can be introduced for properties ''P<sub>1</sub> ... P<sub>r</sub>''. |
Such introduction is possible through //finalization// only (see Def. [[ardplustransformation#Finalization_Transformation|finalization]]). | Such introduction is possible through //finalization// only (see Def. [[#Finalization_Transformation|finalization]]). |
| |
=== Attribute Pool === | === Attribute Pool === |
| |
Identifying all possible properties and attributes in a system could be a very complex task. | Identifying all possible properties and attributes in a system could be a very complex task. |
Transformations (see page [[.:ardplus:ardplustransformation|transformation]]) allow to gradually refine properties, attributes and functional dependencies in the system being designed. | Transformations (see [[#transformations|transformation]]) allow to gradually refine properties, attributes and functional dependencies in the system being designed. |
This process ends when all properties are described by //physical attributes// and all functional dependencies among properties are defined. | This process ends when all properties are described by //physical attributes// and all functional dependencies among properties are defined. |
| |
* big picture of the designed system. | * big picture of the designed system. |
| |
The implementation of such hierarchical model is provided through storing the lowest available, most detailed diagram level, and, additionally, information needed to recreate all of the higher levels, so called //Transformation Process History//, TPH for short (see Def. [[.ardplus:ardplussyntax#TPH|TPH]]). | The implementation of such hierarchical model is provided through storing the lowest available, most detailed diagram level, and, additionally, information needed to recreate all of the higher levels, so called //Transformation Process History//, TPH for short (see Def. [[#TPH|TPH]]). |
| |
The TPH captures information about changes made to properties at consecutive diagram levels. | The TPH captures information about changes made to properties at consecutive diagram levels. |
These changes are carried out through the transformations: split or finalization. | These changes are carried out through the transformations: split or finalization. |
The TPH forms a tree structure then, denoting what particular properties is split into or what attributes a particular property attribute is finalized into, according to Def. [[.ardplus:ardplussyntax#TPH|TPH]]. | The TPH forms a tree structure then, denoting what particular properties is split into or what attributes a particular property attribute is finalized into, according to Def. [[#TPH|TPH]]. |
| |
An example TPH for the transformation is given in Figure: | An example TPH for the transformation is given in Figure: |
| |
| |
Having a complete TPH and the most detailed level (namely ARD+), which constitute the //DPD// (according to Def. [[.:ardplus:ardplussyntax#DPD|DPD]]) it is possible to automatically recreate any, more general, level. | Having a complete TPH and the most detailed level (namely ARD+), which constitute the //DPD// (according to Def. [[#DPD|DPD]]) it is possible to automatically recreate any, more general, level. |
| |
===== Rule Prototyping Algorithm ===== | ===== Rule Prototyping Algorithm ===== |