d3e00635c6
Summary:
This macro benchmark measures read throughput in HA.
The test first creates a random graph with a given number of nodes
and edges. After that, it concurently performs the following query
for 10 seconds:
```
MATCH (n {id:$random_id})-[e]->(m) RETURN e, m;
```
In other words, it randomly picks a node and returns all its neighbours.
Locally measured results are as follows:
| nodes | edges | queries per second |
| 100 | 500 | 8900 |
| 1000 | 5000 | 2700 |
| 10000 | 50000 | 1200 |
Running the same test on Memgraph single node yields very similar results
(up to a few hundred queries).
Reviewers: msantl
Reviewed By: msantl
Subscribers: pullbot
Differential Revision: https://phabricator.memgraph.io/D1916
8 lines
163 B
JSON
8 lines
163 B
JSON
{
|
|
"election_timeout_min": 350,
|
|
"election_timeout_max": 700,
|
|
"heartbeat_interval": 100,
|
|
"replication_timeout": 10000,
|
|
"log_size_snapshot_threshold": -1
|
|
}
|