Implements an algorithm to calculate the Levenshtein distance and the longest common substring ration (LCSR, Melamed 1995)
Requirements
JAVA 1.6
Acknowledgements
The software is part of the software developed within the PRESEMT project.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001584s ]
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.088830s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000937s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001386s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001052s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003342s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001065s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004229s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.017605s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001122s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 98308 [ RunTime:0.018038s ]
