-
Notifications
You must be signed in to change notification settings - Fork 21
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
benchmark results #5
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Updated Results March 2021
Old Results Sep 2019
Machine information:
Intel(R) Xeon(R) CPU E5-2697A v4 @ 2.60GHz (two sockets)
256GB (32GBx8) DDR4 Synchronous Registered (Buffered) 2400 MT/s
workloads
addr-*:
all addresses in the U.S, Mexico, and Brazil
source: https://openaddresses.io/
az*:
amazon comments. a:productID(asin); r:reviewerID; t:unixReviewTime.
source: https://nijianmo.github.io/amazon/index.html
2014 version. 142 millions keys
dblp-*:
dblp database dump in early 2018.
4-million keys each. Small datasets compared to the others.
m9urls:
memetracker urls dump.
http:https://www.memetracker.org/data.html
Lots of urls; some URLs are thousands of bytes long.
zero-16m:
16 million randomly generated keys with a lot of zeroes.
HOT vs Wormhole https://github.com/speedskater/hot
The HOT implementation we obtained has several limitations:
(1) char * string key. It does not handle keys that contain zeroes.
(2) key length has a small maximum length (255). We increased it to 2047 to accommodate a few very-long keys in the url keysets.
(3) The multi-threaded version does not support deletion. We only compare the single-threaded HOT with a single-threaded wormhole.
Throughput (mops, Million Operations Per Second) On a Skylake server (updated 2021)
The text was updated successfully, but these errors were encountered: