EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Performance evaluation of B-Tree and hash indexing under varying data sizes in relational database systems

Hassan Bediar Hashim

Computing and Artificial Intelligence · 19.03.2026 · 4 (1)

DOI: 10.59400/cai4104 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computing and Artificial Intelligence, online erschienen am 19.03.2026. Verfasst von Hassan Bediar Hashim. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study investigates query performance optimization in relational database management systems (RDBMSs) by evaluating two common indexing techniques, B-Tree and Hash indexing, under varying dataset sizes. With the rapid growth of data generated by IoT systems, enterprise applications, and digital services, efficient query execution has become essential for maintaining scalability and system performance. The research compares three database configurations: no indexing, B-Tree indexing, and Hash indexing, while applying a Cost-Based Optimization (CBO) strategy to improve query plan selection. Experimental results reveal that query response time increases significantly with larger datasets, especially when no indexing is used. Both indexing methods substantially enhance performance compared to full-table scans, achieving improvements ranging from 35% to 60% depending on dataset size and query workload. The measured speedup factors reached up to 2.60×, confirming the effectiveness of indexing in reducing execution time. Further analysis indicates that B-Tree indexing consistently performs better than Hash indexing in large-scale and mixed-query environments due to its logarithmic search efficiency and support for range queries. B-Tree indexing reduced execution time to nearly 40–45% of the baseline, whereas Hash indexing achieved approximately 55–60% under similar conditions. The findings emphasize that selecting an appropriate indexing strategy is critical for optimizing database query performance, and that the effectiveness of each method depends largely on workload characteristics and dataset scale.

Zitieren

APA

Hashim, H. B. (2026). Performance evaluation of B-Tree and hash indexing under varying data sizes in relational database systems. Computing and Artificial Intelligence, 4(1). https://doi.org/10.59400/cai4104

Vancouver

Hashim HB. Performance evaluation of B-Tree and hash indexing under varying data sizes in relational database systems. Computing and Artificial Intelligence. 2026;4(1). doi:10.59400/cai4104

BibTeX
@article{Hashim2026,
  author = {Hashim, Hassan Bediar},
  title = {Performance evaluation of B-Tree and hash indexing under varying data sizes in relational database systems},
  journal = {Computing and Artificial Intelligence},
  year = {2026},
  volume = {4},
  number = {1},
  doi = {10.59400/cai4104}
}
Kostenlos starten →