Just for completeness, Nick noted that a reason BSDDB could be faster with large trees is because SQLite has a smaller cache.
Could/should the cache be made adaptive to the Tree size?
And there’s an outstanding addition for the wiki article:
Just for completeness, Nick noted that a reason BSDDB could be faster with large trees is because SQLite has a smaller cache.
Could/should the cache be made adaptive to the Tree size?
And there’s an outstanding addition for the wiki article: