Encode your hierarchy inside a single key. It's kind of a bummer, but it does speed up searches. For instance having
'/LOCAL_SOFTWARE/MegaCoolProject/Name' '/LOCAL_SOFTWARE/MegaCoolProject/Path' '/LOCAL_SOFTWARE/MegaCoolProject/DbString' A single call to retrieve every '/LOCAL_SOFTWARE/MegaCoolProject/*' will give you all your keys. Phil PS I might have totatlly missed your question though :) -----Original Message----- From: Everaldo Canuto [mailto:[EMAIL PROTECTED]] Sent: Friday, September 20, 2002 10:56 AM To: [EMAIL PROTECTED] Subject: [Mono-list] Tree data storage on BerkeleyDB Hello, I'm create a wrapper for GDBM (BerkeleyDB) to use on Registry classes on Linux but I have one problem: BerkeleyDB theres one key for record and I need two keys for storage a tree data (hierarquical storage). Can you help me? Everald Canuto _______________________________________________ Mono-list maillist - [EMAIL PROTECTED] http://lists.ximian.com/mailman/listinfo/mono-list _______________________________________________ Mono-list maillist - [EMAIL PROTECTED] http://lists.ximian.com/mailman/listinfo/mono-list
