[Mono-list] Tree data storage on BerkeleyDB

[Seun Osewa]

I wish you were on the mono irc channel ...

I think bdb has a function so search for keys within a
particular range.

If you have key entries like
/LOCAL/Administrators/Kenobi
/LOCAL/Administrators/Yoda
/LOCAL/Project/name
/LOCAL/Project/age
/LOCAL/Project/date
/LOCAL/Project/registration_num
/TARGET/install

to find all /LOCAL/Project keys, you search for al
keys between '/LOCAL/Project/' and '/LOCAL/Project0'
excluding entries beginning with '/LOCAL/Project0'
('0' comes after '/'). these are the values under the
'/LOCAL/Project' portion of the tree.

To descend within the tree its a similar process.

What do you think of this?

--- Everaldo Canuto <everaldo.canuto@bol.com.br>
wrote:
> >
> >
> >A single call to retrieve every
> '/LOCAL_SOFTWARE/MegaCoolProject/*' will
> >give you all your keys.
> >
> Theres no function to retrive multiple key. A
> alternative is create that 
> function, that function position on first key and
> retrieve data while 
> key like '/LOCAL_SOFTWARE/MegaCoolProject/' but
> BerkeleyDB not organize 
> key in order.
> I did not find functions to make this. 
> 
> Everaldo Canuto
> 
> 
> 
> _______________________________________________
> Mono-list maillist  -  Mono-list@ximian.com
> http://lists.ximian.com/mailman/listinfo/mono-list

__________________________________________________
Do you Yahoo!?
New DSL Internet Access from SBC & Yahoo!
http://sbc.yahoo.com