I would like to work on the Bug#422 Make the registry loadable on demand.
A straight forward hybrid solution using BerkeleyDB that I think of is:
At first, map each registry key's entries and subkeys to only one Berkeley record.
If record is bigger than some amount, create new record for each of its subkey and move their contents there.
By this way we can provide very fast access for most applications assuming that if it calls for a key, more likely it will call for its subkey. As they already extracted we will achieve a good performance. If that registry key is a big (or heavy/large?) key, as it have been seperated to more than one records, the whole key will not be loaded, and memory use will be decreased.
I am a software engineer with industry experience currently continuing graduate study at Bilkent University on Computer Science for a M.S degree.
I like programming and learning new things so, mostly I spend a big part of my free time searching, reading and coding at my computer.
I have previously worked on BerkeleyDB projects and the last one was a database for a file sharing application and I have knowledge on MS Windows registry.
Editör markdown formatını desteklemektedir. Detaylı bilgi için bu adresi ziyaret edebilirsiniz.
@kullanici ile birisinden bahsedebilir veya :emoji: ile emoji kullanabilirsiniz.