赫夫曼编码，实现压缩编码，字符码长 察看权值，以此构建二叉树-Huffman coding, achieving compression coding, characters yards long to see the right value, this Binary Tree Construction
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.003617s ]
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.088712s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001077s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001165s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000998s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003140s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000902s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003683s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.021519s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001099s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 70108 [ RunTime:0.035812s ]
