IJBTT

Enhancing Query Performance Through Relational Database Indexing
	© 2024 by IJCTT Journal
	Volume-72 Issue-8
	Year of Publication : 2024
	Authors : Ankit Anchlia
	DOI :  10.14445/22312803/IJCTT-V72I8P119

How to Cite?

Ankit Anchlia, "Enhancing Query Performance Through Relational Database Indexing ," International Journal of Computer Trends and Technology, vol. 72, no. 8, pp. 130-133, 2024. Crossref, https://doi.org/10.14445/22312803/IJCTT-V72I8P119

Abstract
Indexing in relational databases is a crucial technique for optimizing query performance. This paper explores various indexing methods, their implementation, and their impact on database efficiency. By examining different types of indexes, such as B-trees and hash indexes, and their applications in common relational database systems, this research provides insights into best practices for database design and maintenance. The study concludes with recommendations for database administrators and developers to maximize the benefits of indexing.

Keywords
B-tree index, Database optimization, Indexing, Query performance, Relational database.

Reference

[1] Rudolf Bayer, and Edward McCreight, “Organization and Maintenance of Large Ordered Indexes,” Acta Informatica, vol. 1, pp. 173- 189, 1972.
[CrossRef] [Google Scholar] [Publisher Link]
[2] C. J. Date, An Introduction to Database Systems, 7th ed., Addison-Wesley, pp. 1-938, 2000.
[Google Scholar] [Publisher Link]
[3] Michael Stonebraker et al., “The Design and Implementation of INGRES,” University of California, Berkeley, Technical Report, 1976.
[CrossRef] [Google Scholar] [Publisher Link]
[4] MySQL 8.0 Reference Manual: Including MySQL NDB Cluster 8.0, MySQL, 2024. [Online]. Available: https://dev.mysql.com/doc/refman/8.0/en/
[5] Joseph M. Hellerstein, Michael Stonebraker, and James Hamilton, “Architecture of a Database System,” Foundations and Trends in Databases, vol. 1, no. 2, pp. 141-259, 2007.
[CrossRef] [Google Scholar] [Publisher Link]