Indexing Strategies For Optimizing Queries On MySQL

Anca Mehedinţu (), Cerasela Pîrvu () and Cristi Etegan ()
Additional contact information
Anca Mehedinţu: University of Craiova, Romania
Cerasela Pîrvu: University of Craiova, Romania
Cristi Etegan: University of Craiova, Romania

Annals of the University of Petrosani, Economics, 2010, vol. 10, issue 4, 201-214

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 (search for similar items in EconPapers)
JEL-codes: M15 (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://upet.ro/annals/economics/pdf/2010/20100420.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pet:annals:v:10:y:2010:i:4:p:201-214

Access Statistics for this article

More articles in Annals of the University of Petrosani, Economics from University of Petrosani, Romania
Bibliographic data for series maintained by Imola Driga ().