…sort%”; +——————-+——-+ | Variable_name | Value | +——————-+——-+ | Sort_merge_passes | 321 | | Sort_range | 0 | | Sort_rows | 10 | | Sort_scan | 1 | +——————-+——-+ 4 rows in set (0.00 sec) As you can…
Comment: Impact of the sort buffer size in MySQL
October 25, 2010 By 8 Comments
…/18/how-fast-can-you-sort-data-with-mysql/ My guess though is it is CPU cache related not memory allocation as if we’re sorting 100000… things – whenever sorting by short columns (say INT) is same and whenever the sorting with storing the data (instead of data pointer) is same…
Comment: How fast can you sort data with MySQL ?
August 6, 2009 By 26 Comments
…½ä¼šæ¯”è¾ƒæ…¢ï¼Œå¢žåŠ Sort_buffer_size 会å‡å°‘ Sort_merge_passes å’Œ 创建临慛®çš„å¢žåŠ Sort_buffer_size 并ä¸ä¸€å®šèƒ½æé«˜é€Ÿåº¦ï¼Œè§ How fast can you sort data with MySQL?（引自http://qroom.blogspot.com/2007/09/mysql-select-sort.html，貌似è…
Comment: How fast can you sort data with MySQL ?
March 25, 2009 By 26 Comments
…½ä¼šæ¯”è¾ƒæ…¢ï¼Œå¢žåŠ Sort_buffer_size 会å‡å°‘ Sort_merge_passes å’Œ 创建临慛®çš„å¢žåŠ Sort_buffer_size 并ä¸ä¸€å®šèƒ½æé«˜é€Ÿåº¦ï¼Œè§ How fast can you sort data with MySQL?（引自http://qroom.blogspot.com/2007/09/mysql-select-sort.html，貌似è…
Comment: How fast can you sort data with MySQL ?
May 7, 2008 By 26 Comments
[...] MySQL Performance Blog: How fast can you sort data with MySQL? [...]
Post: How Percona does a MySQL Performance Audit
November 24, 2008 By 17 Comments
… to know how many physical spindles are under the box, and how fast they are. I can also get …sorts of dirty tricks and neat ideas with each other. Nothing is off the table. Queries can be rewritten. Indexes and data…are the way they are, means you can know when and how to break them for the client’s…
Post: Improved InnoDB fast index creation
November 6, 2011 By 4 Comments
…data, and then recreating them later, ALTER TABLE can take advantage of the fast… see how performance is affected when turning expand_fast_…fast storage is essential for expand_fast_index_creation, because temporary files for merge-sorting… fast index creation chapter in the MySQL manual: “… you can …
Post: Predicting how long data load would take
May 24, 2007 By 12 Comments
… example MyISAM can build non-unique indexes by sort which is very fast and Innodb can use insert buffer for them. Data Insert Order It is well known it is important to load data in… database data directory to see how much data is loaded per hour (assuming your Innodb tablespace did not have free space or you‘re…
Post: High-Performance Click Analysis with MySQL
December 22, 2008 By 13 Comments
…data sets are very expensive. If MySQL supported sort-merge or hash joins, you…data types you can, the simplest character sets you can, and watch out for NULLable columns. Use smallint unsigned or tinyint unsigned if you can. You can…
Post: ORDER BY ... LIMIT Performance Optimization
September 1, 2006 By 93 Comments
…interactive applications with large data sets being sorted. On many web sites you will fine top tags,…(date_created) to get result set very fast. Now what if I have something like SELECT…you do not have full where clause resolved by index is how many rows you need to scan to resolve order by (this can…
