Date: Thu, 27 Dec 2007 16:34:32 -0800 From: Garrett Cooper <youshi10@u.washington.edu> To: Garrett Cooper <youshi10@u.washington.edu> Cc: hackers@freebsd.org Subject: Re: BSD license compatible hash algorithm? Message-ID: <7F9D2F63-B5E6-41DE-843A-8D673C2DC88E@u.washington.edu> In-Reply-To: <5950EE0C-383D-4D6B-9991-A0DEABD2ADE4@u.washington.edu> References: <5950EE0C-383D-4D6B-9991-A0DEABD2ADE4@u.washington.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On Dec 27, 2007, at 4:30 PM, Garrett Cooper wrote: > Hi all, > Just wondering if anyone knew of a good BSD license compatible key- > based hash placement / retrieval algorithm that was available > anywhere. > I'm looking for a reliable way to lookup objects to see if a given > action would be performed in my revised pkg_install(1), to thus > efficiently pre-plan out the installation dependencies and fully > utilize multiprocessing capabilities of contemporary machines / > eliminate duplicate dependency install requirements. > I know I can use tree structures or hash(3), but I want to avoid > trees (inefficient with large data sets of course) and I was > looking for a non-BDB based solution (for right now, with this > given structure as I don't want to write everything to disk). Later > on it might be a good idea to cache the results using BDB on disk, > but for now I was just wondering if there were any non-BDB based > hashing solutions that anyone knew of. > Thanks, > -Garrett A few clarifications. 1. It needs to be in C, not C++. 2. I meant hash table / bucket when I said "hash" in the subject. Thanks, -Garrett
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?7F9D2F63-B5E6-41DE-843A-8D673C2DC88E>