An Optimized Algorithm for Enhancing Complex Database Query Performance

المؤلفون

  • 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

الكلمات المفتاحية:

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

الملخص

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.

التنزيلات

بيانات التنزيل غير متوفرة بعد.

التنزيلات

منشور

2024-12-31

كيفية الاقتباس

[1]
E. M. . Aboudoumat, Ashraf Elburki, S. S. S. . Albaseer, و A. . A. G. . . Mohamed, "An Optimized Algorithm for Enhancing Complex Database Query Performance", AJST, م 1, عدد 2, ص 85–92, 2024.