后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C* O (n) the complexity
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001381s ]
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.100076s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001321s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002019s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001356s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003605s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001151s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003253s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014650s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001378s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 122413 [ RunTime:0.001257s ]
