… working set fits in memory, InnoDB almost always performs better, at least for this workload. Notes MySQL version used: 5.6.11, custom… used. O_DIRECT was used so, there was no caching of data at the filesystem level. The InnoDB indexes were built using ALTER TABLE fast index creation (merge sort). For the MyISAM tests I used a 10GB key buffer. I used ALTER…
Post: Percona Server 5.5.30-30.2 rerelease fixes non-restart issue
April 24, 2013 By Leave a Comment
…explicitly named foreign key constraint which implied an implicit secondary index with the same name. Fixed by detecting such cases and… cases. This significantly improves InnoDB scalability on read-only workloads, especially when the default glibc memory allocator is used. Bug fixed #1131187 (Alexey…
Post: Percona Server for MySQL 5.5.30-30.2 now available
April 10, 2013 By 10 Comments
…explicitly named foreign key constraint which implied an implicit secondary index with the same name. Fixed by detecting such cases and… cases. This significantly improves InnoDB scalability on read-only workloads, especially when the default glibc memory allocator is used. Bug fixed #1131187 (Alexey…
Post: Is Synchronous Replication right for your app?
May 14, 2013 By 18 Comments
…Innodb is a single row (well, the PRIMARY KEY index entry for that row). This means typically on a single Innodb… (innodb_flush_log_at_trx_commit != 1), or work around it with by fsyncing to memory (… needs to be modified. Generally if you use Innodb, you should be able to handle deadlock …
Post: Index Condition Pushdown in MySQL 5.6 and MariaDB 5.5 and its performance impact
March 12, 2012 By 12 Comments
… this blog post is aimed at a new optimizer enhancement Index Condition Pushdown (ICP). Its available in both MySQL 5.6… is, and what is it aimed at. Index Condition Pushdown Traditional B-Tree index lookups have some limitations in cases such as range scans, where index parts after the part on which range condition is applied cannot be used for filtering records. For…
Post: Heikki Tuuri answers to Innodb questions, Part II
November 4, 2007 By 13 Comments
… of your Innodb log files to be able to use a lot of memory for write buffering efficiently. Q30: Question about using solid state…:-). At the moment the server has around 21 GB of memory used for applications (of which Mysql is the main one with…: Seems that adaptive hash indexes are not used for primary key lookups or not showed up in “show innodb statusâ€. select * from…
Post: Choosing innodb_buffer_pool_size
November 3, 2007 By 39 Comments
… not have a good use for that memory anyway. Another thing you should keep into account is Innodb allocates more memory in structures related… Innodb is caching already. Innodb cache is more efficient compared to OS cache because there is no copying, due to adaptive hash indexes… they usually play on the safe side, having enough “free” memory used as Cache and Buffers. Kevin Burton wrote a good post…
Post: MySQL Indexing Best Practices: Webinar Questions Followup
August 16, 2012 By 4 Comments
… to add another index. Q: We have a database that has about 400GB of indexes. The indexes can’t fit in memory anymore. How… IN-ranges in some cases for better index usage. Q: Is the b+ tree innodb index a single or double linked list at the leaf nodes? your slide showed single but the fact that you can use…
Post: InnoDB memory usage
May 30, 2006 By 8 Comments
…_size innodb_log_buffer_size adaptive index hash, size= innodb_buffer_pool / 64 system dictionary hash, size = 6 * innodb_buffer_pool_size / 512 memory for sync_array, which is used…
Post: Join performance of MyISAM and Innodb
May 29, 2006 By 6 Comments
… together with index and generally highly optimized Innodb builds hash indexes which helps to speed up lookup by indexes by passing BTREE index and using hash… request next row matching index Note: This applies to CPU bound workload with all content fitting in memory. In other cases situation…
