The aggregation of relational sets and the algorithmic dependencies of data
Abstract
This article an extension of the relational model with a new method is presented; i.e., the system in two stages of data aggregation and algorithmic dependencies is defined. In the first stage, the data identification model defined guarantees the selection of relational sets needed for solving a particular applied problem in the order and the quantity required. In the second stage, that problem is solved as the data realisation of certain algorithmic dependencies. To put it differently, new relational sets are formed out of the selected relational sets through transformation on the level of the combinations of attribute values. Therefore, data aggregation is performed twice forming relational sets as the primary data for solving a particular problem.
