在各种各样的搜索算法中，AVL树的搜索算法可以将其最短的搜索时间做一个保证，本程序就是实现了AVL搜索算法-in a wide variety of search algorithm, AVL tree search algorithms can be the shortest time to do a search that The procedure is to achieve the AVL Search Algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.000995s ]
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.099605s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000945s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001086s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000960s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003110s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000854s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003817s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015746s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001123s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 131015 [ RunTime:0.019620s ]
