hash table to replace Judy

[Matthias Andree]

On Wed, 18 Sep 2002, Gyepi SAM wrote:

> > I'm not sure if I recall this correctly, but did perchance DB offer a
> > "no-file" hash mode? If so, that might be far easier, because we depend
> > on DB anyways.
> 
> It does, and would be easier, but also slower. Incrementing a word requires that
> 
> 1. Retrieve the current value, if any
> 2. Set or change the value
> 3. Write it back to the database (which also involves another search)

I'm still a BerkeleyDB ignorant, but I read about "cursors" in the docs
-- which are used at least for transactional completion. Would not this
save the second search? Or would the other search still be required
because some other location may have changed?