INDEXING STRATEGIES FOR OPTIMIZING QUERIES ON MYSQL

Abstract

This article investigates MySQL's index capabilities. It begins by reviewing how indexes work, as well as their structure. Next, it reviews indexing features specific to each of the major MySQL data storage engines. This article then examines a broad range of situations in which indexes might help speed up your application. In addition to examining how indexes can be of assistance. In this article we present index usage type: B-trees, hash and bitmap, in order to optimize queries, although MySQL has implemented and indexes spacious R-trees. The index type corresponds to the particular kinds of internal algorithms and datastructures used to implement the index. In MySQL, support for a particular index type is dependent upon the storage engine.

Keywords

• Optimizing database structure
• Database performance
• Optimizing queries
• Indexes
• B-tree Index
• Hash Index
• Bitmap Index
• Storage engines