BSD license compatible hash algorithm?

[Aryeh M. Friedman]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Ivan Voras wrote:
> On 28/12/2007, Aryeh M. Friedman <aryeh.friedman at gmail.com> wrote:
>
>> Depends on the size of the table... I work with a algrothem that
>> regularly has tables between 2^32 and 2^64 buckets (even though
>> the we use a slightly different terminology)
>
> This looks like an interesting project - are you using hashes not
> for speed but as a generic storage organization algorithm?
>
> And, I think at least some of the popular non-crypto hash
> algorithms could be easily extended to work with 64-bit integers -
> are you really using the "big" hashes for this?
>
Yes using it as a DB table indexing, the exact details are under an
NDA but I can give some numbers though like a table lookup on a 2^32
record table requires no more then 4 disk reads (averages out to
between 3 and 4) and 2k or RAM [namely gives O(log_k(n)) we have,
successfully used k>=256 even though k=256 is the most natural value,
time performence and O(1) when considering primary store requirements
only... in other words when the table size = 2^processor word size you
need word size/8 lookups at most to find anything])... hopefully once
the patents are in place I can give more details (I am hoping to make
the reference implementation as FOSS as possible {while not
invalidating the strength of the patent} [see my blog for details on
the business model I am planning])

- --
Aryeh M. Friedman
FloSoft Systems
http://www.flosoft-systems.com
Developer, not business, friendly
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.4 (FreeBSD)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFHdPlOzIOMjAek4JIRAgahAJ95GpzAS+e1607NcdHg6m33BokCSgCglgJG
+BVo+ZCKvA1S3p2/HsNzyds=
=MKKp
-----END PGP SIGNATURE-----