一种很实用的扫描算法，主要功能是通过两次扫描找出正方形区域内集聚中心。-a very practical scanning algorithm, the main function is to scan through to find two square region Gathering centers.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001333s ]
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.090841s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001271s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.003127s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001296s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003621s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001040s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006391s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016399s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001421s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 315163 [ RunTime:0.001527s ]
