Title:	A MEMETIC ALGORITHM FOR OPTIMIZING THE ASSIGNMENT OF TABLES ON RELATIONAL DATABASE STORAGE UNITS
Author(s):	Arturo Lucas, Rony Cueva and Manuel Tupia
ISBN:	978-989-8704-42-9
Editors:	Yingcai Xiao, Ajith Abraham, Guo Chao Peng and Jörg Roth
Year:	2022
Edition:	Single
Keywords:	Memetic Algorithm, Assignment Problem, Tables, Relational Databases
Type:	Full Paper
First Page:	151
Last Page:	158
Language:	English
Cover:
Full Contents:	click to dowload
Paper Abstract:	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.
	Go Back