15
幾周前，我對Stackoverflow提出了一個問題，即創建一個有效的算法來搜索大塊文本中的模式。現在我正在使用String函數indexOf來執行搜索。一個建議是使用拉賓卡普作爲替代。我按照以下方法編寫了一個小測試程序來測試Rabin-Karp的實現。Java indexOf函數比Rabin-Karp更高效嗎？搜索文本的效率
public static void main(String[] args) {
String test = "Mary had a little lamb whose fleece was white as snow";
String p = "was";
long start = Calendar.getInstance().getTimeInMillis();
for (int x = 0; x < 200000; x++)
test.indexOf(p);
long end = Calendar.getInstance().getTimeInMillis();
end = end -start;
System.out.println("Standard Java Time->"+end);
RabinKarp searcher = new RabinKarp("was");
start = Calendar.getInstance().getTimeInMillis();
for (int x = 0; x < 200000; x++)
searcher.search(test);
end = Calendar.getInstance().getTimeInMillis();
end = end -start;
System.out.println("Rabin Karp time->"+end);
}
這裏是拉賓，卡普的實現，我使用：
import java.math.BigInteger;
import java.util.Random;
public class RabinKarp {
private String pat; // the pattern // needed only for Las Vegas
private long patHash; // pattern hash value
private int M; // pattern length
private long Q; // a large prime, small enough to avoid long overflow
private int R; // radix
private long RM; // R^(M-1) % Q
static private long dochash = -1L;
public RabinKarp(int R, char[] pattern) {
throw new RuntimeException("Operation not supported yet");
}
public RabinKarp(String pat) {
this.pat = pat; // save pattern (needed only for Las Vegas)
R = 256;
M = pat.length();
Q = longRandomPrime();
// precompute R^(M-1) % Q for use in removing leading digit
RM = 1;
for (int i = 1; i <= M - 1; i++)
RM = (R * RM) % Q;
patHash = hash(pat, M);
}
// Compute hash for key[0..M-1].
private long hash(String key, int M) {
long h = 0;
for (int j = 0; j < M; j++)
h = (R * h + key.charAt(j)) % Q;
return h;
}
// Las Vegas version: does pat[] match txt[i..i-M+1] ?
private boolean check(String txt, int i) {
for (int j = 0; j < M; j++)
if (pat.charAt(j) != txt.charAt(i + j))
return false;
return true;
}
// check for exact match
public int search(String txt) {
int N = txt.length();
if (N < M)
return -1;
long txtHash;
if (dochash == -1L) {
txtHash = hash(txt, M);
dochash = txtHash;
} else
txtHash = dochash;
// check for match at offset 0
if ((patHash == txtHash) && check(txt, 0))
return 0;
// check for hash match; if hash match, check for exact match
for (int i = M; i < N; i++) {
// Remove leading digit, add trailing digit, check for match.
txtHash = (txtHash + Q - RM * txt.charAt(i - M) % Q) % Q;
txtHash = (txtHash * R + txt.charAt(i)) % Q;
// match
int offset = i - M + 1;
if ((patHash == txtHash) && check(txt, offset))
return offset;
}
// no match
return -1; // was N
}
// a random 31-bit prime
private static long longRandomPrime() {
BigInteger prime = new BigInteger(31, new Random());
return prime.longValue();
}
// test client
}
拉賓，卡普的實施工作，它返回正確的我正在尋找字符串的偏移量。然而，令我驚訝的是，當我運行測試程序時發生的時間統計。他們是：
Standard Java Time->39
Rabin Karp time->409
這真是令人驚訝。不僅Rabin-Karp（至少在這裏實現）不比標準的java indexOf字符串函數更快，而且速度更慢一個數量級。我不知道什麼是錯的（如果有的話）。任何人都有這個想法？
感謝，
埃利奧特
btw，BigInteger（31，new Random（））'不會返回素數（至少有時） – 2012-03-16 16:46:07
首先，您正在尋找一個非常短的字符串... – 2012-03-16 16:46:10
我沒有徹底查看該代碼也不知道Rabin-Karb算法，但「在大量文本中」暗示該算法針對大文本進行了優化，對於較小的文本可能會較慢。你是否嘗試過大幅度的文字呢？ – Thomas 2012-03-16 16:46:16