Heads up, BDB coming, needed to support fast configuration

[Chris Hegarty]

Hi,

A while back it was pointed out that the configuration data for modules 
with entry points is stored in a highly inefficient manner [1]. It was 
pointed out at the time that the plan has always been to replace this 
with a "fast configuration", based on a persistent b-tree implementation.

The b-tree implementation that we plan to use is a small footprint 
implementation of Berkeley DB [2], called Restricted Data Store (RDS). 
It is a minimal build of Berkeley DB that supports only b-tree access, 
and provides a simple Java interface to support the functionality 
required by the runtime (Jigsaw will also use the native interface). I'm 
currently preparing to push the BDB code to Jigsaw. It will live in its 
own repository, jigsaw/jigsaw/bdb. This mail is just a heads-up that 
this will be coming soon. Note that as BDB is provided in some 
distributions, Linux for example, the changes that are coming can use 
the installed BDB as an alternative.

-Chris.

[1] http://mail.openjdk.java.net/pipermail/jigsaw-dev/2012-March/002292.html
[2] 
http://www.oracle.com/technetwork/products/berkeleydb/overview/index.html