Query OK, 24918 rows affected (0.90 sec)
records:24918 duplicates:0 warnings:0
Query OK, 24923 rows affected (2.26 sec)
records:24923 duplicates:0 warnings:0
Query OK, 24924 rows affected (2.74 sec)
records:24924 duplicates:0 warnings:0
Query OK, 24920 rows affected (0.94 sec)
records:24920 duplicates:0 warnings:0
Query OK, 24920 rows affected (2.03 sec)
records:24920 duplicates:0 warnings:0
Query OK, 24919 rows Affected (1.19 sec)
records:24919 duplicates:0 warnings:0
Query OK, 7671 rows Affected (0.67 sec)
records:7671 duplicates:0 warnings:0
Import 24919 Records, time only need 1.19s, fast, what is the reason?
MySQL Tech Insider high performance MySQL
http://wangqiaowqo.iteye.com/blog/1137589
Http://www.cnblogs.com/hustcat/archive/2009/10/28/1591648.html
Http://www.2cto.com/database/201201/117456.html
Http://www.php100.com/html/webkaifa/database/Mysql/2010/0409/4279.html
http://laozhao.blog.51cto.com/blog/25213/7644
http://blog.csdn.net/turkeyzhou/article/details/8182636
http://blog.csdn.net/fullsail/article/details/8945449
http://he-wen.iteye.com/blog/1244221
Http://www.51cto.com/specbook/52/12911.htm
http://opq149766320.iteye.com/blog/561183
Http://www.cnblogs.com/rollenholt/articles/2424531.html
'%j% ' cannot use the index because it does not know which element to look for and cannot use the B-tree index. I do not know what is in front of J, only the full-text scan, cannot find which, which elements.
But ' jq% ' can match and can compare the size of the key value. Compare size by JQ.
http://blog.csdn.net/hguisu/article/details/7786014
http://blog.csdn.net/weege/article/details/6526512
http://www.jb51.net/article/36184.htm Introduction to the lookup and principle of B-tree and B + trees
Http://www.cnblogs.com/mailingfeng/archive/2012/09/26/2704344.html
At present, most database systems and file systems use B-tree or its variant B+tree as the index structure.