mihirn@haibrid-d8s:~/haibrid-algorithms$ ./out/bench-ds -t 8 -d google_btree -n 25000000 -k string -v string -K KEYSUNIF -V 8 -l 10000 -r 1.0
Both -n and -K specified; ignoring -n
Running workload [0, 1]
SAMPLE: {"ts": 8000, "ops": 7770, "xput": 971, "lat": 2362946, "mem": 4039128}
Total operations: 7770 on 25000000 keys  (Runtime: 8001 ms; From Operations: 7996 ms; From TSC: 8000 ms)
  Point: 0 (Missing: 0 (-nan%))
  Inserts: 0 (0%); Failures: 0; Skipped: 0
  Deletes: 0 (0%); Failures: 0; Skipped: 0
  Ranges: 7770 (100%); Average range size: 10001
	 Throughput: 972 qps
	 Avg Latency: 1029086 ns (2361642 cycles)
Maximum Memory Usage: 4039128 KB; Garbage: 0
mihirn@haibrid-d8s:~/haibrid-algorithms$ ./out/bench-ds -t 8 -d skiplist -n 25000000 -k string -v string -K KEYSUNIF -V 8 -l 10000 -r 1.0
Both -n and -K specified; ignoring -n
Running workload [0, 1]
SAMPLE: {"ts": 8000, "ops": 4292, "xput": 536, "lat": 4277731, "mem": 3939580}
Total operations: 4292 on 25000000 keys  (Runtime: 8001 ms; From Operations: 7997 ms; From TSC: 8000 ms)
  Point: 0 (Missing: 0 (-nan%))
  Inserts: 0 (0%); Failures: 0; Skipped: 0
  Deletes: 0 (0%); Failures: 0; Skipped: 0
  Ranges: 4292 (100%); Average range size: 10001
	 Throughput: 537 qps
	 Avg Latency: 1863233 ns (4276047 cycles)
Maximum Memory Usage: 3939580 KB; Garbage: 0