I looked into MPH a while ago and came across Sebastiano's work, but was even more intrigued by CMPH (http://cmph.sourceforge.net/), which claims to work on the order of a billion keys. I attempted a java port of BDZ (acyclic random 3-graphs FTW :) at one point, but gave up as I found something else a bit more suitable for my needs.
On Mon, Jul 18, 2011 at 12:32 PM, Stack <[email protected]> wrote: > On Mon, Jul 18, 2011 at 9:22 AM, Claudio Martella > <[email protected]> wrote: > > Yes, I had a look at it a while ago. For what I know perfect hashing > > doesn't work that good for many elements. With millions of items it > > should be computationally expensive and the probability of finding such > > a perfect hashing. Did you ever test this out? I think I can easily > > generate some millions of UUIDs and see how it goes. > > I never tried it. I was just citing the technique. Even if it > worked, Sebastiano's work is all LGPL so we would not be able to use > it in our Apache project (unfortunately). > > St.Ack >
