03f1547a8d
Summary: - Remove caches on workers as a result of plan expiration or race during insertion. - Extract caching functionality into a class. - Minor refactor of Interpreter::operator() - New RPC and test for it. - Rename ConsumePlanRes to DispatchPlanRes for consistency, remove return value as it's always true and never used. - Interpreter is now constructed with a `GraphDb` reference. At the moment only for reaching the `distributed::PlanDispatcher`, but in the future we should probably use that primarily for planning. I added a function to `PlanConsumer` that is only used for testing. I prefer not doing this, but I felt this needed testing. I can remove it now if you like. Reviewers: teon.banek, msantl Reviewed By: teon.banek Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D1292
82 lines
2.5 KiB
C++
82 lines
2.5 KiB
C++
#include <benchmark/benchmark.h>
|
|
#include <benchmark/benchmark_api.h>
|
|
#include <glog/logging.h>
|
|
|
|
#include "communication/result_stream_faker.hpp"
|
|
#include "database/graph_db.hpp"
|
|
#include "database/graph_db_accessor.hpp"
|
|
#include "query/interpreter.hpp"
|
|
#include "query/typed_value.hpp"
|
|
|
|
class ExpansionBenchFixture : public benchmark::Fixture {
|
|
protected:
|
|
// GraphDb shouldn't be global constructed/destructed. See
|
|
// documentation in database/graph_db.hpp for details.
|
|
std::experimental::optional<database::SingleNode> db_;
|
|
std::experimental::optional<query::Interpreter> interpreter_;
|
|
|
|
void SetUp(const benchmark::State &state) override {
|
|
db_.emplace();
|
|
interpreter_.emplace(db_.value());
|
|
database::GraphDbAccessor dba(*db_);
|
|
for (int i = 0; i < state.range(0); i++) dba.InsertVertex();
|
|
|
|
// the fixed part is one vertex expanding to 1000 others
|
|
auto start = dba.InsertVertex();
|
|
start.add_label(dba.Label("Start"));
|
|
auto edge_type = dba.EdgeType("edge_type");
|
|
for (int i = 0; i < 1000; i++) {
|
|
auto dest = dba.InsertVertex();
|
|
dba.InsertEdge(start, dest, edge_type);
|
|
}
|
|
dba.Commit();
|
|
}
|
|
|
|
void TearDown(const benchmark::State &) override {
|
|
database::GraphDbAccessor dba(*db_);
|
|
for (auto vertex : dba.Vertices(false)) dba.DetachRemoveVertex(vertex);
|
|
dba.Commit();
|
|
interpreter_ = std::experimental::nullopt;
|
|
db_ = std::experimental::nullopt;
|
|
}
|
|
|
|
auto &interpreter() { return *interpreter_; }
|
|
};
|
|
|
|
BENCHMARK_DEFINE_F(ExpansionBenchFixture, Match)(benchmark::State &state) {
|
|
auto query = "MATCH (s:Start) return s";
|
|
database::GraphDbAccessor dba(*db_);
|
|
while (state.KeepRunning()) {
|
|
ResultStreamFaker results;
|
|
interpreter()(query, dba, {}, false).PullAll(results);
|
|
}
|
|
}
|
|
|
|
BENCHMARK_REGISTER_F(ExpansionBenchFixture, Match)
|
|
->RangeMultiplier(1024)
|
|
->Range(1, 1 << 20)
|
|
->Unit(benchmark::kMillisecond);
|
|
|
|
BENCHMARK_DEFINE_F(ExpansionBenchFixture, Expand)(benchmark::State &state) {
|
|
auto query = "MATCH (s:Start) WITH s MATCH (s)--(d) RETURN count(d)";
|
|
database::GraphDbAccessor dba(*db_);
|
|
while (state.KeepRunning()) {
|
|
ResultStreamFaker results;
|
|
interpreter()(query, dba, {}, false).PullAll(results);
|
|
}
|
|
}
|
|
|
|
BENCHMARK_REGISTER_F(ExpansionBenchFixture, Expand)
|
|
->RangeMultiplier(1024)
|
|
->Range(1, 1 << 20)
|
|
->Unit(benchmark::kMillisecond);
|
|
|
|
int main(int argc, char **argv) {
|
|
gflags::ParseCommandLineFlags(&argc, &argv, true);
|
|
google::InitGoogleLogging(argv[0]);
|
|
|
|
::benchmark::Initialize(&argc, argv);
|
|
::benchmark::RunSpecifiedBenchmarks();
|
|
return 0;
|
|
}
|