实验RK算法，即利用Hash方法和素数理论，首先定义一个Hash函数（hash (r) = r mod q），然后将模式串P和文本串T中长度为m的子串利用Hash函数转换成数值。显然只需比较那些与模式串具有相同Hash函数值的子串。

当然因为Hash冲突的存在，还要进一步进行字符串比较，但只要选择适当的素数q, Hash冲突的概率就会很小

-Experimental RK algorithm, namely the use of Hash methods and prime number theory, first of all define a Hash Function (hash (r) = r mod q), then the pattern string P and text string T of length m substring using Hash function to convert values . Clearly only those with the pattern string comparison Hash function values ??with the same substring. Of course, the existence of the conflict because of Hash, but also further string comparison, but as long as selecting the appropriate prime q, Hash is very small the probability of conflict