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. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Bacula-devel mailing list Bacula-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bacula-devel
