|
|
@ -5677,12 +5677,12 @@ class Benchmark { |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
// The social graph wokrload mixed with Get, Put, Iterator queries.
|
|
|
|
// The social graph workload mixed with Get, Put, Iterator queries.
|
|
|
|
// The value size and iterator length follow Pareto distribution.
|
|
|
|
// The value size and iterator length follow Pareto distribution.
|
|
|
|
// The overall key access follow power distribution. If user models the
|
|
|
|
// The overall key access follow power distribution. If user models the
|
|
|
|
// workload based on different key-ranges (or different prefixes), user
|
|
|
|
// workload based on different key-ranges (or different prefixes), user
|
|
|
|
// can use two-term-exponential distribution to fit the workload. User
|
|
|
|
// can use two-term-exponential distribution to fit the workload. User
|
|
|
|
// needs to decides the ratio between Get, Put, Iterator queries before
|
|
|
|
// needs to decide the ratio between Get, Put, Iterator queries before
|
|
|
|
// starting the benchmark.
|
|
|
|
// starting the benchmark.
|
|
|
|
void MixGraph(ThreadState* thread) { |
|
|
|
void MixGraph(ThreadState* thread) { |
|
|
|
int64_t read = 0; // including single gets and Next of iterators
|
|
|
|
int64_t read = 0; // including single gets and Next of iterators
|
|
|
|