Hi, Joel. Thanks for your input! On Mon, Jun 14, 2010 at 4:17 PM, Joel Pitt <j...@netempathy.com> wrote:
> [re bitcask and in-memory data] > I'm sure it's probably already been considered, but just in case... > bloom filters could be an alternative to the requirement of keeping > *all* the keys in memory. I don't know if this would necessarily fit > with the usage of this in-memory key/metadata data structure though. We are exploring ways to keep bitcask's overall performance profile while relaxing the memory requirement a bit, though we have not yet determined how to do so. Bloom filters can be incredibly handy, but wouldn't (alone) solve this problem as we use the in-memory hash table to tell bitcask the location of the stored value in terms of file and offset. -Justin _______________________________________________ riak-users mailing list riak-users@lists.basho.com http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
