On Nov 3, 2016, at 9:30 PM, David Adams <dpad...@gmail.com> wrote: > >> processing large numbers of files; performing slow fuzzy search on slices > of data; > > You had me at fuzzy ;-) There are so many fantastic fuzzy algorithms that > are too slow to run in real-time or on normal gear. Any speed improvement > would be welcome. I've pitched 4D about integrating various fuzzy > algorithms into the database engine itself (not too hard), but it's not > happened.
It is slow. However, being able to utilize all 16 logical cores on the dual-processor xserve takes it from being “too slow” to “ok with a warning that this is slow”. Even still, it takes 30 seconds or so to find possible duplicates in a set of 1000 names. If 4D’s preemptive threading works well enough, it might be possible to run your fuzzy matching utilizing cpu across all currently connected clients. Jim Crate ********************************************************************** 4D Internet Users Group (4D iNUG) FAQ: http://lists.4d.com/faqnug.html Archive: http://lists.4d.com/archives.html Options: http://lists.4d.com/mailman/options/4d_tech Unsub: mailto:4d_tech-unsubscr...@lists.4d.com **********************************************************************
