K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001234s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.076466s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001071s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001194s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001076s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003474s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000952s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003972s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015862s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001273s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 212236 [ RunTime:0.012904s ]
