memgraph/tests/feature_benchmark/ha/CMakeLists.txt

# test binaries
add_subdirectory(read)
add_subdirectory(write)
Measure read throughput in HA 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 2019-03-12 21:06:14 +08:00			`# test binaries`
			`add_subdirectory(read)`
			`add_subdirectory(write)`