cursor traverse order of hash based database

sub.apache@gmail.com · *nix forums beginner Joined: 11 Jul 2006 Posts: 3

Hi, I am trying to read key/data pairs within a range of buckets from
hash based berkeley db. I would like to avoid creating a secondary
index of bucket number for this purpose if possible.

Is there a fixed order of the cursor traverser in hash db (considering
the linear hash of bdb can be extented ) ?

If I use DBcursor->c_get() with DB_NEXT_NODUP and finish reading all
key/data paires in current bucket, will the cursor move to record in
next bucket (current bucket+1 or greater) of the hash db ? or it will
just pick a page that's physically next to current page ?

I think the cursor traverse order is obvious for b-tree based db. But
for hash bashed db,
I can't find a answer from
http://www.sleepycat.com/docs/api_c/dbc_get.html

Any suggestion will be appreciated. Thanks.

Google