哈夫曼编码(Huffman Coding)以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman coding (Huffman Coding) ─ a Huffman tree that is optimal binary tree, with the right of the path length of the smallest tree, often used in data compression.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001505s ]
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.101205s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001451s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002073s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001452s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003835s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001281s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003435s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.023481s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002067s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 183118 [ RunTime:0.001840s ]
