f2faf8cdd9
When keys are contiguous and monotonically increasing, this gets denser page utilization (doesn't leave padding in page splits). Can't be used for keys that are inserted in random order (e.g. hashes) In total this only saves around 1.5% of space compared to original DB code. The previous patch accounted for 0.8% savings on its own; the blocks tables just aren't that big. |
||
---|---|---|
.. | ||
berkeleydb | ||
lmdb | ||
blockchain_db.cpp | ||
blockchain_db.h | ||
CMakeLists.txt | ||
db_types.h |