Thank you John Stanton. This has opened new doors for me, and think it would be helpful for others in the list too..
Thanks and Regards Lloyd On Thu, 2007-04-12 at 12:34 -0500, John Stanton wrote: > We use a very simple data retrieval method for smallish datasets. The > data is just stored in memory or as a memory mapped file and a > sequential search used. It sounds crude but when you use a fast search > algorithm like Boyer-Moore it outperforms index methods up to a > surprisingly large number of records. As you can imagine the code > footprint is miniscule and if you add regular expression logic you can > realize very intricate search patterns. > > We use the method in conjunction with a database to achieve an enormous > speed increase on "LIKE" type searches. Grep a few files to get a feel > for the performance. > > Another method which works well for memory resident storage is to > implement self balancing AVL trees. The code is simple and the > performance lightning fast. With a little ingenuity you can use disk > storage. Mini Sql (MSql) is a good example of how this can be effective. > > As Einstein said - "Make it as simple as possible, but not too simple". > Applying Occam's Razor can turn bloated solutions into more > effective lean ones. Typical solutions come in two sizes just like Army > boots - too big and too small. > ______________________________________ Scanned and protected by Email scanner ----------------------------------------------------------------------------- To unsubscribe, send email to [EMAIL PROTECTED] -----------------------------------------------------------------------------
