From owner-cvs-all  Sat Mar 17 11:59: 2 2001
Delivered-To: cvs-all@freebsd.org
Received: from khavrinen.lcs.mit.edu (khavrinen.lcs.mit.edu [18.24.4.193])
	by hub.freebsd.org (Postfix) with ESMTP
	id EE1D337B718; Sat, 17 Mar 2001 11:58:58 -0800 (PST)
	(envelope-from wollman@khavrinen.lcs.mit.edu)
Received: (from wollman@localhost)
	by khavrinen.lcs.mit.edu (8.9.3/8.9.3) id OAA75595;
	Sat, 17 Mar 2001 14:58:50 -0500 (EST)
	(envelope-from wollman)
Date: Sat, 17 Mar 2001 14:58:50 -0500 (EST)
From: Garrett Wollman <wollman@khavrinen.lcs.mit.edu>
Message-Id: <200103171958.OAA75595@khavrinen.lcs.mit.edu>
To: "Daniel C. Sobral" <dcs@newsguy.com>
Cc: cvs-committers@FreeBSD.org, cvs-all@FreeBSD.org
Subject: Re: sys/alpha/include types.h sys/i386/include types.h sys/ia64/include 
 types.h sys/powerpc/include types.h sys/kern vfs_cache.c sys/nfs nfs.h 
 nfs_node.c sys/sys fnv_hash.h
In-Reply-To: <3AB3711F.42629FB6@newsguy.com>
References: <200103171050.aa94864@salmon.maths.tcd.ie>
	<3AB3711F.42629FB6@newsguy.com>
Sender: owner-cvs-all@FreeBSD.ORG
Precedence: bulk
X-Loop: FreeBSD.ORG

<<On Sat, 17 Mar 2001 23:13:51 +0900, "Daniel C. Sobral" <dcs@newsguy.com> said:

> I'm interested on what kind of names this hash algorithm was designed to
> handle. Can you provide an url to a paper describing the algorithm?

I am not aware of one.  The FNV hash is designed to produce good
dispersion of hash values even when the keys are relatively small, and
differ by only a few bits.  It is also designed to work with arbitrary
octet-strings; some simpler well-known hashes like Chris Torek's
(h' = 33h + s[i]) work well for ASCII strings but not for binary data.

-GAWollman



To Unsubscribe: send mail to majordomo@FreeBSD.org
with "unsubscribe cvs-all" in the body of the message