Navigation Menu

Skip to content

Instantly share code, notes, and snippets.

@SamiPussinen

SamiPussinen/memdb_vs_memstore_performance.md

Last active March 5, 2018 13:59
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save SamiPussinen/8a6439dff4d21568c456ecafce36b06c to your computer and use it in GitHub Desktop.
Save SamiPussinen/8a6439dff4d21568c456ecafce36b06c to your computer and use it in GitHub Desktop.
Download ZIP
Raw
memdb_vs_memstore_performance.md

Hashicorp memdb vs Jaakko's memstore performance comparison

Here are the results comparing the two different approaches for the storage and retrieval of pre-calculated valuations.

Inserting the 72 million permutations:

Hashicorp memdb (Immutable radix tree): 307GB of total allocation, runtime 561 seconds.

Jaakko's memstore (Mutable radix tree): 14GB total allocation, runtime 1894 seconds.

Reading one random valuation from a set of 7,2 million permutations (10%):

Hashicorp memdb: 3,20 microseconds.

Jaakko's memstore: 3,16 microseconds.

Reading ALL permutations from a set of 7,2 million permutations (10%):

Hashicorp memdb: 1100 nanoseconds average per single read.

Jaakko's memstore: 442 nanoseconds average per single read.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment