Re: Suggestions for implementing a persistent binary tree

2010-01-11 Thread Bryan Donlan
On Sun, Jan 10, 2010 at 2:31 PM, Joel Fernandes wrote: > Actually the unbounded delays is not an issue as the lookups are > usually happening as deferred work, and most of my code is in kernel > space so I'm not sure if pushing off the hashtable lookup code to > userspace is a good idea.. > > Than

Re: Suggestions for implementing a persistent binary tree

2010-01-10 Thread Joel Fernandes
Actually the unbounded delays is not an issue as the lookups are usually happening as deferred work, and most of my code is in kernel space so I'm not sure if pushing off the hashtable lookup code to userspace is a good idea.. Thanks for pointing out that mmap wouldn't work in kernel space. But ou

Re: Suggestions for implementing a persistent binary tree

2010-01-08 Thread Bryan Donlan
On Wed, Jan 6, 2010 at 4:20 AM, Joel Fernandes wrote: > There is a certain hashtable that I am currently implementing in the > kernel using file handling for sake of persistence. It is actually a > file-based binary tree (nodes are referred to by file offsets instead > of memory addresses). The pr

Suggestions for implementing a persistent binary tree

2010-01-06 Thread Joel Fernandes
There is a certain hashtable that I am currently implementing in the kernel using file handling for sake of persistence. It is actually a file-based binary tree (nodes are referred to by file offsets instead of memory addresses). The problem is that the tree can get unbalanced quite quickly and aft