MATHEMATICAL SUPPORT THE PROCESS OF MANAGING DIAGRAM OF RELATIONAL DATABASES IN HORIZONTAL SCALING TASKS

The article proposes an approach to the development of mathematical support system for the relational database (database control system) schematic control process, allowing to take into account the statistics of competitive access to the data query flow in the memory used by the database control system engine by hierarchy. The articles notes shortcomings of existing approaches based on the conditional costs of the query plan and the issue of ignoring the costs related to cooperative access to the data contained in a shared computer memory. There is a set-theoretic presentation of the query flow processing, which also takes into consideration the shortcomings of the existing set-theoretic models. The proposed approach ensures the actual time costs calculations for the flow of concurrently executed queries. High-level query language operations are provided through a variety of typical access operations to the In-Memory Data. The article presents a classification of the memory access operations, which allows to calculate the degree of competition during the cooperative query execution. This study also introduces a formal presentation of competitive queries and the conditions for choosing the optimal data distribution method during the database operation in a given period of time. The proposed settheoretic model allows us to calculate the memory segments, access to which leads to a competitive query. The results obtained in this paper can be used in the development of mathematical support systems and other software for the Autonomous database control systems that automate the management of the physical database scheme.

1. Digo, S. M. Bazy dannyh: proektirovanie i ispol'zovanie. Uchebnik / S. M. Digo. – M.: Finansy i statistika, 2005. – 171 s.

2. Dejt, K. Dzh. Vvedenie v sistemy baz dannyh, 8–e izdanie / K. Dzh. Dejt: per. s angl. – M.: Izdatel'skij dom «Vil'yams», 2005. – 1327 s.

3. Velichko, S. V. Sovremennye SUBD dlya sozdaniya edinoj informacionnoj sredy v bol'shih informacionnyh sistemah. / S.V. Velichko, Е.V. Mezhov // Vestnik voronezhskogo gosudarstvennogo tekhnicheskogo universiteta. – 2003. – № 3. – S.68–73.

4. Millsap, K. Oracle. Optimizaciya proizvoditel'nosti / K. Millsap, D. Hol't: per. s angl. – SPb.: Simvol-Plyus, 2006. – 464 s.

5. Whalen, E. Oracle Performance Tuning and Optimization / Whalen E. – Sams Publishing, 2003. – 670 p.

6. Murali, V. Oracle RAC Perfomance Diagnostics and Tuning / Murali Vallath – Apress, 2014. – 712 p.

7. Lohman, G.M. Daniels, D. Haas, L.M. Kistler, R. Selinger, P.G. Optimization of Nested Queries in a Distributed Relational Database // Proc. 10th Int. Conf Very Large Data Bases, Singapore, Aug. 27–31, 1984. – New York. – 1984. – pp.403–415.

8. Kajt, T. Oracle dlya professionalov: arhitektura, metodiki programmirovaniya i osobennosti versij 9i, 10g i 11g. 2–e izdanie / Tom Kajt, per. s angl. – M.: Vil'yams, 2013. – 848 s.

9. Henderson, K. Microsoft SQL Server: struktura i realizaciya. Professional'noe rukovodstvo. / Ken Henderson – per. s angl. // M.: Vil'yams, 2005. – 1056 s.

10. Hasler, T. Oracle SQL. Optimization, Deployment, and Statistics / Tony Hasler // Apress; 2014. – 571 c

11. Voevodin, V.V. Parallel'nye vychisleniya / V.V. Voevodin, Vl.V. Voevodin. – SPb.: BHV–Peterburg, 2002. – 520 s

12. Borchuk, L.Е. Asimptoticheskaya model' zatrat resursov vychislitel'noj sistemy na vypolnenie relyacionnogo zaprosa v RSUBD System R / L.Е. Borchuk // Kibernetika i vysokie tekhnologii XXI veka S&T 2006: Materialy 7–oj mezhdunarodnoj nauchno–tekhnicheskoj konferencii. – Voronezh: VGU, 2006. – S. 363–373.