Completeness of the dynamics of the attributes values of data in the database DIM

This paper is devoted to justifying the possibility of DBMS DIM usage and its interaction mechanism as an algorithmically complete implementation of an object-dynamic model. An extension for a static $OD$-model by including sets of algorithmic procedures which modify values of object attributes and also create, remove and modify objects themselves is considered. To ensure the possibility of modifying DIM DB data in a way equivalent to $OD$-model modifications, interaction and history relations between DIM objects are considered. To minimize the dependence from concrete language constructions, which describe $OD$-model algorithmic procedures, the reduction to the universal form — Turing machine is performed. A way to create a Turing machine equivalent to $OD.MT$ in terms of DIM, where a special set of PL/ODQL procedures is used as a control unit and a functional table is proposed. Later, a mechanism to form a memory tape of such $DIM.MT$ by encoding information about DIM object, and their subsequent decoding back to DIM objects is described. The process of work of such a machine is modelled by using an endless cycle of executing some PL/ODQL procedures of reading and writing objects from/to the memory tape. Basing on the earlier proved theorem about the static completeness of data representation in DIM, at the end of the paper the proof on the completeness of representation of the Objects attributes values dynamics is considered.
The article is published in the author's wording.