此代码用霍夫曼树作为压缩和解压缩的存储结构，实现了字典压缩算法，用C便已成功。-this code tree with Hoffman as the compression and decompression of the storage structure and achieve a dictionary compression algorithm has been successfully used C.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001408s ]
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.094203s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001274s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001934s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001278s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003646s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001133s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003234s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015236s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001514s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 120550 [ RunTime:0.001664s ]
