Menu
I need a pure .Net persistent hashtable/binarytree, functionally similar to berkeley-db Java edition.
Functionally it should opperate in a similar maner to a DHT such memcached and velocity etc but it doesn't have to be distributed. In essence I am looking for a persistent hashtable.
Does anyone have any ideas or suggestions?
A similar question is also here: Looking for a simple standalone persistent dictionary implementation in C#
Paul
951
Persistent Hash Table, (persistent transposition table) a form of long-term memory, to remember "important" nodes from earlier analyzed positions or played games with its exact score and depth, in order to avoid repeating unsuccessful book lines.
Explanation: Hashing with separate chaining has a disadvantage that it takes more space. This space is used for storing elements in case of a collision. 4.
Binary Search Trees are generally memory-efficient since they do not reserve more memory than they need to. On the other hand, Hash tables can be a bit more demanding if we don't know the exact number of elements we want to store.
If the input size is not known to you in advance, then use the Hash Table. Range Search: If you want to perform range search i.e. searching some key in between some keys, then you should go with Binary Search Tree because, in Binary Search Tree, you ignore that subtree which is impossible to have the answer.
How about this? SourceForge.net: Berkeley DB for .NET
168
You might consider the Caching Application Block or System.Web.Caching. Both have methods for connecting them to a SQL Server database as the backing store.
The other method would be to simply serialize the object using a XML or Binary Formatter. (which can be used for deep cloning by the way)
28
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
