A MEMETIC ALGORITHM FOR OPTIMIZING THE ASSIGNMENT OF TABLES ON RELATIONAL DATABASE STORAGE UNITS

Lucas A.; Cueva R.; Tupia M. · 16th International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing, CGVCVIP 2022, 8th International Conference on Connected Smart Cities, CSC 2022, 7th International Conference on Big Data Analytics, Data Mining and Computational Intelligence, BigDaCI 2022, and 11th International Conference on Theory and Practice in Modern Computing, TPMC 2022 - Held at the 16t (2022)

Resumen

Optimizing the storage of large volumes of information in relational databases has become an increasingly common need in modern organizations. Database management systems and load balancers aim to accomplish this and employ often inefficient or empirical table mapping protocols. Artificial Intelligence, through bio-inspired algorithms, has come to the aid of this optimization process and the present paper seeks to propose a memetic algorithm to perform the best allocations to tables in relational database storage units, seeking best configurations and accelerating the access to such data. This paper proposes the use of a Memetic Algorithm in the table assignment problem that works on two levels. First, optimizing the result of the best local search algorithm found in the literature, such as the Taboo Search Algorithm; and, secondly, the minimization of exchange processes between tables was achieved, as no other algorithm in the reviewed literature presents. © MCCSIS 2022.All rights reserved.

Instituciones: Pontificia Universidad Católica del Perú