Tag: databases
MySQL Compare – compare two database structures and get the differences between them
MySQL Compare – compare two database structures and get the differences between them
On Amazon EC2 instances
I am staring at the t2.micro (the smallest available instance type) server running MySQL 5.5.40 (using the my-huge.cnf example configuration shipped with MySQL, which ironically matches t2.micro specs). Here’s why (as reported by Nagios for the last few hours):
Queries per second avg: 12888.839
The number is fluctuating between about 12,500 and 13,500. Server load is moving between 0.05 and 0.08.
I think this answers the question of whether or not I am happy with the Amazon EC2 instance performance with a “hell yeah!” bang.
MySQL view processing algorithms
I had a last work session last night, troubleshooting one of the project’s database performance issues. Without giving more details (at least for now), I want to save the link to MySQL view processing algorithms for future me.
For
UNDEFINED
, MySQL chooses which algorithm to use. It prefersMERGE
overTEMPTABLE
if possible, becauseMERGE
is usually more efficient and because a view cannot be updatable if a temporary table is used.A reason to choose
TEMPTABLE
explicitly is that locks can be released on underlying tables after the temporary table has been created and before it is used to finish processing the statement. This might result in quicker lock release than theMERGE
algorithm so that other clients that use the view are not blocked as long.
A particular heavy query, using views, kept going into “Copying to tmp table” state, locking up the server and slowing everything to a crawl. Upon closer examination, the view was created without specifying the algorithm (UNDEFINED). Changing the view to use TEMPTABLE made everything so much faster.
I knew there were reasons for me being against using views in MySQL, but I could never remember them. This is one. Views not supporting indexes is another.