Optimizing Security and Response Time of Relational Database Using Moth-Flame Algorithm Article Swipe

View

Murtada Mohammed Hasan Alsayyad , Pedram Salehpour ·

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.24996/ijs.2025.66.10.40

Query optimization in relational databases is a costly process, and the number of different permutations of link operations for a query grows exponentially as the number of tables in the query increases. Current query optimization techniques are unsuitable for use in cases where the number of database tables and the number of rows in each table are large. On the other hand, the key to the success of a database system is the efficiency of its query model. Therefore, this research proposes a method for optimizing query execution by rearranging query structures. Due to the increasing importance of reducing the execution time of the optimal design in the connection operation with a large number of tables and minimizing the execution time of the algorithm to find the optimal design and not getting stuck in local optimizations, the use of new metaheuristics and efficient algorithms has received much attention. In this research, we used the Genetic algorithm and the Moth Flame Optimization algorithm. Finally, we test our proposed method on the employee database with 200 random queries. In comparison to random and GA runs, our method gets 22.5% and 4.2% better response time, respectively.

Related Topics

Reader-Response Criticism

United Nations Security Council Resolution 1973

International Security

United Nations Security Council Resolution 338

United Nations Security Council Resolution 1701

Nuclear Safety And Security

United Nations Security Council Resolution 1325

National Security Council

National Security Agency

United Nations Security Council Resolution 1929

World Health Organization Response To The Covid-19 Pandemic

United Nations Security Council

Concepts

No concepts available.

Metadata

Type: article
Landing Page: https://doi.org/10.24996/ijs.2025.66.10.40
OA Status: diamond
OpenAlex ID: https://openalex.org/W4415724986

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4415724986

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.24996/ijs.2025.66.10.40

Digital Object Identifier
Title: Optimizing Security and Response Time of Relational Database Using Moth-Flame Algorithm

Work title
Type: article

OpenAlex work type
Publication year: 2025

Year of publication
Publication date: 2025-10-30

Full publication date if available
Authors: Murtada Mohammed Hasan Alsayyad, Pedram Salehpour

List of authors in order
Landing page: https://doi.org/10.24996/ijs.2025.66.10.40

Publisher landing page
Open access: Yes

Whether a free full text is available
OA status: diamond

Open access status per OpenAlex
OA URL: https://doi.org/10.24996/ijs.2025.66.10.40

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4415724986
doi	https://doi.org/10.24996/ijs.2025.66.10.40
ids.doi	https://doi.org/10.24996/ijs.2025.66.10.40
ids.openalex	https://openalex.org/W4415724986
fwci
type	article
title	Optimizing Security and Response Time of Relational Database Using Moth-Flame Algorithm
biblio.issue
biblio.volume
biblio.last_page	4589
biblio.first_page	4566
is_xpac	False
apc_list
apc_paid
language
locations[0].id	doi:10.24996/ijs.2025.66.10.40
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S2764932332
locations[0].source.issn	0067-2904, 2312-1637
locations[0].source.type	journal
locations[0].source.is_oa	True
locations[0].source.issn_l	0067-2904
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	Iraqi Journal of Science
locations[0].source.host_organization	https://openalex.org/P4310319175
locations[0].source.host_organization_name	College of Science for Women, University of Baghdad
locations[0].source.host_organization_lineage	https://openalex.org/P4310319175
locations[0].source.host_organization_lineage_names	College of Science for Women, University of Baghdad
locations[0].license
locations[0].pdf_url
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	Iraqi Journal of Science
locations[0].landing_page_url	https://doi.org/10.24996/ijs.2025.66.10.40
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5120199468
authorships[0].author.orcid	https://orcid.org/0009-0009-8608-1043
authorships[0].author.display_name	Murtada Mohammed Hasan Alsayyad
authorships[0].author_position	first
authorships[0].raw_author_name	Murtada Mohammed Hasan Alsayyad
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5081500332
authorships[1].author.orcid	https://orcid.org/0000-0002-1300-7848
authorships[1].author.display_name	Pedram Salehpour
authorships[1].author_position	last
authorships[1].raw_author_name	Pedram Salehpour
authorships[1].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://doi.org/10.24996/ijs.2025.66.10.40
open_access.oa_status	diamond
open_access.any_repository_has_fulltext	False
created_date	2025-10-31T00:00:00
display_name	Optimizing Security and Response Time of Relational Database Using Moth-Flame Algorithm
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic
cited_by_count	0
locations_count	1
best_oa_location.id	doi:10.24996/ijs.2025.66.10.40
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S2764932332
best_oa_location.source.issn	0067-2904, 2312-1637
best_oa_location.source.type	journal
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l	0067-2904
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	Iraqi Journal of Science
best_oa_location.source.host_organization	https://openalex.org/P4310319175
best_oa_location.source.host_organization_name	College of Science for Women, University of Baghdad
best_oa_location.source.host_organization_lineage	https://openalex.org/P4310319175
best_oa_location.source.host_organization_lineage_names	College of Science for Women, University of Baghdad
best_oa_location.license
best_oa_location.pdf_url
best_oa_location.version	publishedVersion
best_oa_location.raw_type	journal-article
best_oa_location.license_id
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	Iraqi Journal of Science
best_oa_location.landing_page_url	https://doi.org/10.24996/ijs.2025.66.10.40
primary_location.id	doi:10.24996/ijs.2025.66.10.40
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S2764932332
primary_location.source.issn	0067-2904, 2312-1637
primary_location.source.type	journal
primary_location.source.is_oa	True
primary_location.source.issn_l	0067-2904
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	Iraqi Journal of Science
primary_location.source.host_organization	https://openalex.org/P4310319175
primary_location.source.host_organization_name	College of Science for Women, University of Baghdad
primary_location.source.host_organization_lineage	https://openalex.org/P4310319175
primary_location.source.host_organization_lineage_names	College of Science for Women, University of Baghdad
primary_location.license
primary_location.pdf_url
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	Iraqi Journal of Science
primary_location.landing_page_url	https://doi.org/10.24996/ijs.2025.66.10.40
publication_date	2025-10-30
publication_year	2025
referenced_works_count	0
abstract_inverted_index.a	6, 19, 68, 82, 111
abstract_inverted_index.GA	181
abstract_inverted_index.In	148, 176
abstract_inverted_index.On	58
abstract_inverted_index.as	23
abstract_inverted_index.by	88
abstract_inverted_index.in	2, 28, 40, 53, 106, 133
abstract_inverted_index.is	5, 71
abstract_inverted_index.of	12, 15, 26, 45, 51, 67, 74, 97, 102, 114, 121, 138
abstract_inverted_index.on	168
abstract_inverted_index.to	64, 93, 124, 178
abstract_inverted_index.we	151, 163
abstract_inverted_index.200	173
abstract_inverted_index.Due	92
abstract_inverted_index.and	9, 48, 116, 129, 141, 156, 180, 187
abstract_inverted_index.are	36, 56
abstract_inverted_index.for	18, 38, 84
abstract_inverted_index.has	144
abstract_inverted_index.its	75
abstract_inverted_index.key	63
abstract_inverted_index.new	139
abstract_inverted_index.not	130
abstract_inverted_index.our	165, 183
abstract_inverted_index.the	10, 24, 29, 43, 49, 59, 62, 65, 72, 94, 99, 103, 107, 118, 122, 126, 136, 153, 157, 169
abstract_inverted_index.use	39, 137
abstract_inverted_index.4.2%	188
abstract_inverted_index.Moth	158
abstract_inverted_index.each	54
abstract_inverted_index.find	125
abstract_inverted_index.gets	185
abstract_inverted_index.link	16
abstract_inverted_index.much	146
abstract_inverted_index.rows	52
abstract_inverted_index.test	164
abstract_inverted_index.this	79, 149
abstract_inverted_index.time	101, 120
abstract_inverted_index.used	152
abstract_inverted_index.with	110, 172
abstract_inverted_index.22.5%	186
abstract_inverted_index.Flame	159
abstract_inverted_index.Query	0
abstract_inverted_index.cases	41
abstract_inverted_index.grows	21
abstract_inverted_index.hand,	61
abstract_inverted_index.large	112
abstract_inverted_index.local	134
abstract_inverted_index.other	60
abstract_inverted_index.query	20, 30, 33, 76, 86, 90
abstract_inverted_index.runs,	182
abstract_inverted_index.stuck	132
abstract_inverted_index.table	55
abstract_inverted_index.time,	191
abstract_inverted_index.where	42
abstract_inverted_index.better	189
abstract_inverted_index.costly	7
abstract_inverted_index.design	105, 128
abstract_inverted_index.large.	57
abstract_inverted_index.method	83, 167, 184
abstract_inverted_index.model.	77
abstract_inverted_index.number	11, 25, 44, 50, 113
abstract_inverted_index.random	174, 179
abstract_inverted_index.system	70
abstract_inverted_index.tables	27, 47, 115
abstract_inverted_index.Current	32
abstract_inverted_index.Genetic	154
abstract_inverted_index.getting	131
abstract_inverted_index.optimal	104, 127
abstract_inverted_index.success	66
abstract_inverted_index.Finally,	162
abstract_inverted_index.database	46, 69, 171
abstract_inverted_index.employee	170
abstract_inverted_index.process,	8
abstract_inverted_index.proposed	166
abstract_inverted_index.proposes	81
abstract_inverted_index.queries.	175
abstract_inverted_index.received	145
abstract_inverted_index.reducing	98
abstract_inverted_index.research	80
abstract_inverted_index.response	190
abstract_inverted_index.algorithm	123, 155
abstract_inverted_index.databases	4
abstract_inverted_index.different	13
abstract_inverted_index.efficient	142
abstract_inverted_index.execution	87, 100, 119
abstract_inverted_index.operation	109
abstract_inverted_index.research,	150
abstract_inverted_index.Therefore,	78
abstract_inverted_index.algorithm.	161
abstract_inverted_index.algorithms	143
abstract_inverted_index.attention.	147
abstract_inverted_index.comparison	177
abstract_inverted_index.connection	108
abstract_inverted_index.efficiency	73
abstract_inverted_index.importance	96
abstract_inverted_index.increases.	31
abstract_inverted_index.increasing	95
abstract_inverted_index.minimizing	117
abstract_inverted_index.operations	17
abstract_inverted_index.optimizing	85
abstract_inverted_index.relational	3
abstract_inverted_index.techniques	35
abstract_inverted_index.unsuitable	37
abstract_inverted_index.rearranging	89
abstract_inverted_index.structures.	91
abstract_inverted_index.Optimization	160
abstract_inverted_index.optimization	1, 34
abstract_inverted_index.permutations	14
abstract_inverted_index.exponentially	22
abstract_inverted_index.respectively.	192
abstract_inverted_index.metaheuristics	140
abstract_inverted_index.optimizations,	135
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	2
citation_normalized_percentile