On Wed, Mar 13, 2019 at 09:56:25AM -0700, C K Kashyap wrote: > Just to I get the reasoning right - so for small and medium volume, a list > and binary tree would suffice and for larger data volume a DB is > recommended.
I would go with an 'idx' binary tree, unless it - is bigger than available memory, and/or - needs complicated relations to other data, and/or - needs persistence and/or - needs concurrent access from multiple processes. > And perhaps combined with DB on a ramdrive, it could very well > substitute for anything traditionally thought of as hashtable worthy. Did I > get that right? Yes, but just for a single (or several indepenent) hash table(s) a DB is overkill. ☺/ A!ex -- UNSUBSCRIBE: mailto:[email protected]?subject=Unsubscribe
