An Optimized Algorithm for Enhancing Complex Database Query Performance

Authors

  • Esam Miftah Aboudoumat College of Science and Technology, Qumins
  • Ashraf Elburki College of Arts and Sciences Qumins, University of Benghazi
  • Safieldin Saleh Salim Albaseer College of Computer Technology – Benghazi
  • Abdelwahab A Gumma Mohamed College of Science and Technology, Qumins

Keywords:

Query Optimization, Dynamic Indexing, Execution Plans, Database Performance, Cost Analysis

Abstract

The rapid growth of data and the increasing complexity of database operations pose significant challenges to modern Database Management Systems (DBMS) in optimizing complex query performance. This paper presents a new algorithm that decomposes complex queries into sub-components, builds dynamic indexes, compares cost-based execution plans, and chooses the best plan. Real-world data validation was performed, resulting in a performance improvement of 42% over conventional methods and very substantial resources saved.

Downloads

Download data is not yet available.

Downloads

Published

2024-12-31

How to Cite

[1]
E. M. . Aboudoumat, Ashraf Elburki, S. S. S. . Albaseer, and A. . A. G. . . Mohamed, “An Optimized Algorithm for Enhancing Complex Database Query Performance”, AJST, vol. 1, no. 2, pp. 85–92, Dec. 2024.

Issue

Vol. 1 No. 2 (2024): Applied Science and Technology - (December 2024 )

Section

Articles