[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Bacula-devel] Accurate file project hash tables

Use a dbm-based lookaside cache to store the values for the indexes
keyed by the hash code. That will take a minimal amount of memory
(25-30K) and the hashes make useful unique keys; also scales for large
clients and small ones. 

Dbm has been ported to just about everything you care about, and works
fairly well for this type of application. 

This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
Bacula-devel mailing list

This mailing list archive is a service of Copilotco.