The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transformed into a matrix. girth of eight is maintained by avoiding six-cycles in the graph construction
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002380s ]
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.084647s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002422s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001928s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002101s ]
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.002056s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003277s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014521s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002636s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 253652 [ RunTime:0.001287s ]
