Application of the dynamical relational data storing method

The Dynamical Relational Data Storing Method [1], [2], [3] gives one of possible approaches to building applications for computer-supported management of large data systems. It is based on a well proven relational technology and makes a compromise between a fully object-like approach characterized by a great flexibility and poor runtime performance on one side and between a fixed-data-structure approach with excellent runtime performance but very poor flexibility. The DRD method combines both extreme,methods preserving their good and avoiding their poor characteristics focussing to: center dot Minimize costs of development of an initial functionality of the application, center dot Minimize costs of maintenance and of expanding functionality of the application, center dot Maximize a runtime efficiency of the developed application. Three above-mentioned aspects have a fundamental influence on a business success of a created application. The first two aspects represent direct economic factors of development and the third aspect has a principal influence at practical usability or un-usability of the created application. These aspects axe vital in certain types of applications for computer-supported management of large data systems. In this paper we will not focus at description of the DRD method itself (which was first mentioned in [1] and elaborated in greater detail in [2]), but at description of some fundamental areas where the DRD method can be advantageously applied. This paper further extends material of [3].