Indexing Strategies For Optimizing Queries On MySQL
AbstractThis 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by University of Petrosani, Romania in its journal Annals of the University of Petrosani - Economics.
Volume (Year): 10 (2010)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.upet.ro/
Optimizing database structure; Database performance; Optimizing queries; Indexes; B-tree Index; Hash Index; Bitmap Index; Storage engines;
Find related papers by JEL classification:
- M15 - Business Administration and Business Economics; Marketing; Accounting - - Business Administration - - - IT Management
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Imola Driga).
If references are entirely missing, you can add them using this form.