On Fri, 2005-12-30 at 15:34, Christoph Steinbeck wrote: > You need some way of in-memory presreening for fast substructure searching. > And > this cannot be done efficiently with SQL functions. > In NMRShiftDB, we do this with fingerprints stored in a special buffered > MySQL > table, which is searched by a MySQL UDF, which does the bitstring comparison > on > the fingerprints. > Stefan, do I remember correctly that this can be done in a fraction of a > second? > > Of course, one can do this by reading the fingerprints from the database into > memory (at startup and then every now and then updated by a cron job) and > doing > the fingerprint screening with regular java. That should work equally well.
How long does it take to read a reasonable-sized table of fingerprints stored as bit-strings into memory? How long does the actual comparison take (in java, not UDF)? Just curious... Cheers, .../Ola ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://ads.osdn.com/?ad_id=7637&alloc_id=16865&op=click _______________________________________________ Cdk-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/cdk-user
