[Mono-list] Tree data storage on BerkeleyDB

[Seun Osewa]

Hi!

ANother option would be to create an equivalent of a
(relational?) table linked unto itself in berkeleydb. 
each "node" would contain a value and would contain a
pointer to its parent "node".  This approach would
probably save space for large keys.  But some
secondary indices on the table would be needed. 
Latest bdb versions support these.  It would be like
creating a table in MySQL only embedded this time:

Nodes
---------
 id	name	parent
 0	LOCAL	-1(?)
 1	Admin	0
 2	Progs	0
 3	Root	1

Values:
-----------
node_id  Value
----------------------

The general idea is obvious, I guess... just a
possible alternative, though its slower as someone
mentioned... depends on what the registry is used most
often for.

bye!

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