You answer not my analysis, but your idea of my analysis. The decrease of reading time for complex structure was 16%-19% for A WHOLE SERVER OPERATION, where BDB

You answer not my analysis, but your idea of my analysis. The decrease of reading time for complex structure was 16%-19% for A WHOLE SERVER OPERATION, where BDB never amounted more than 20% in profile. So I achieved speedup of 5-20 times over BDB (albeit not quite recent one, I admit). Scale-free 1M nodes graph write does not even ends with BDB in reasonable time (and produces HUGE log). The difference between BDB and my LSM implementation for smaller graph size writes was in order of 200-300 times, LSM is faster. Finally, I admit your code is here to test and use, mine's closed source and there are only my words. So I have to shut myself up and try to recreate that wonderful thing for everyone to use.