Rabin Hash Functions - FAST Implementation in Java

Question

I am looking for an implementation of the Rabin Hash Function in Java, Can anyone recommend a fast library?

Update: I've just tested the library here.

It takes ~2200ms to hash 1mm random urls on my 2GHz processor.

This is certainly good enough for my needs, however I will test another library when I get a monent and post the results here.

If there are some libraries that you've already tried, but they aren't fast enough, you might want to list them to avoid them being suggested to you again. — Bill the Lizard, Oct 17 '09 at 12:53
I've not tried any yet myself. But if i do any comparisons I'll post the results here. — Joel, Oct 17 '09 at 12:54
It would be nice if you could elaborate your questions a bit more or provide links. I suppose you want to compute *Rabin fingerprints* (http://en.wikipedia.org/wiki/Rabin_fingerprint)? — starblue, Oct 18 '09 at 10:01
Pretty much yes. THe Rabin hash function allows you to produce hash functions with provably small co-incidence of collision between any two strings, proportional to 1/2^numkeydigits. There are few libraries that pop up when you do a google, i was simply wondering if anyone could recomend any of them from previous experience. — Joel, Oct 18 '09 at 12:52

score 4 · Answer 1 · answered Oct 17 '09 at 12:50

4

I've not used it myself, but you can try the Rabin Hash Function project on Source Forge.

answered Oct 17 '09 at 12:50

Bill the Lizard

What do you know, the same project I recommended in my answer, which got deleted. – Jonathan Feinberg Oct 17 '09 at 13:05
2

A LMGTFY link isn't a project recommendation. It isn't an answer either, and it will always get deleted. – Bill the Lizard Oct 17 '09 at 13:12
It's an excellent answer. It's certainly better than this one. – Jonathan Feinberg Oct 17 '09 at 14:50
1

The majority of the SO community seems to disagree. http://meta.stackexchange.com/questions/15650/ban-lmgtfy-let-me-google-that-for-you-links – Bill the Lizard Oct 17 '09 at 14:56
I don't see a lot of agreement with your position at the link you provide. – Jonathan Feinberg Oct 17 '09 at 15:36
@JF - the original question was a request for a "recommendation" for a "fast" library. – Joel Oct 17 '09 at 15:46

score 4 · Accepted Answer · answered Sep 17 '10 at 22:39

4

Here's my Java implementation.

It also includes arbitrarily large irreducible polynomials (using BigIntegers).

answered Sep 17 '10 at 22:39

Bill Dwyer

Is there any c++ implementation/library for Robin Hash Function? - Thank you – kranti sairam Mar 03 '19 at 15:27

2 Answers2