801bdb3a91
Summary: Unfortunately, the written micro benchmark only reports minor improvements compared to default allocator. The results are in some cases even a tiny bit worse. Reviewers: mtomic, mferencevic, llugovic Reviewed By: mtomic Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D2039
203 lines
8.1 KiB
C++
203 lines
8.1 KiB
C++
#include <string>
|
|
|
|
#include <benchmark/benchmark.h>
|
|
|
|
#include "communication/result_stream_faker.hpp"
|
|
#include "database/graph_db.hpp"
|
|
#include "database/graph_db_accessor.hpp"
|
|
#include "query/frontend/opencypher/parser.hpp"
|
|
#include "query/frontend/semantic/required_privileges.hpp"
|
|
#include "query/frontend/semantic/symbol_generator.hpp"
|
|
#include "query/interpreter.hpp"
|
|
#include "query/plan/planner.hpp"
|
|
|
|
static void AddVertices(database::GraphDb *db, int vertex_count) {
|
|
auto dba = db->Access();
|
|
for (int i = 0; i < vertex_count; i++) dba.InsertVertex();
|
|
dba.Commit();
|
|
}
|
|
|
|
static const char *kStartLabel = "start";
|
|
|
|
static void AddStarGraph(database::GraphDb *db, int spoke_count, int depth) {
|
|
auto dba = db->Access();
|
|
VertexAccessor center_vertex = dba.InsertVertex();
|
|
center_vertex.add_label(dba.Label(kStartLabel));
|
|
for (int i = 0; i < spoke_count; ++i) {
|
|
VertexAccessor prev_vertex = center_vertex;
|
|
for (int j = 0; j < depth; ++j) {
|
|
auto dest = dba.InsertVertex();
|
|
dba.InsertEdge(prev_vertex, dest, dba.EdgeType("Type"));
|
|
prev_vertex = dest;
|
|
}
|
|
}
|
|
dba.Commit();
|
|
}
|
|
|
|
static query::CypherQuery *ParseCypherQuery(const std::string &query_string,
|
|
query::AstStorage *ast) {
|
|
query::frontend::ParsingContext parsing_context;
|
|
parsing_context.is_query_cached = false;
|
|
query::frontend::opencypher::Parser parser(query_string);
|
|
// Convert antlr4 AST into Memgraph AST.
|
|
query::frontend::CypherMainVisitor cypher_visitor(parsing_context, ast);
|
|
cypher_visitor.visit(parser.tree());
|
|
query::Interpreter::ParsedQuery parsed_query{
|
|
cypher_visitor.query(),
|
|
query::GetRequiredPrivileges(cypher_visitor.query())};
|
|
return utils::Downcast<query::CypherQuery>(parsed_query.query);
|
|
};
|
|
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void DistinctDefaultAllocator(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::Parameters parameters;
|
|
database::GraphDb db;
|
|
AddVertices(&db, state.range(0));
|
|
auto dba = db.Access();
|
|
auto query_string = "MATCH (s) RETURN DISTINCT s";
|
|
auto *cypher_query = ParseCypherQuery(query_string, &ast);
|
|
auto symbol_table = query::MakeSymbolTable(cypher_query);
|
|
auto context =
|
|
query::plan::MakePlanningContext(&ast, &symbol_table, cypher_query, &dba);
|
|
auto plan_and_cost =
|
|
query::plan::MakeLogicalPlan(&context, parameters, false);
|
|
ResultStreamFaker<query::TypedValue> results;
|
|
query::Frame frame(symbol_table.max_position());
|
|
// Nothing should be used from the EvaluationContext, so leave it empty.
|
|
query::EvaluationContext evaluation_context;
|
|
while (state.KeepRunning()) {
|
|
query::ExecutionContext execution_context{&dba, symbol_table,
|
|
evaluation_context};
|
|
auto cursor =
|
|
plan_and_cost.first->MakeCursor(&dba, utils::NewDeleteResource());
|
|
while (cursor->Pull(frame, execution_context))
|
|
;
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK(DistinctDefaultAllocator)
|
|
->Range(1024, 1U << 21U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void DistinctLinearAllocator(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::Parameters parameters;
|
|
database::GraphDb db;
|
|
AddVertices(&db, state.range(0));
|
|
auto dba = db.Access();
|
|
auto query_string = "MATCH (s) RETURN DISTINCT s";
|
|
auto *cypher_query = ParseCypherQuery(query_string, &ast);
|
|
auto symbol_table = query::MakeSymbolTable(cypher_query);
|
|
auto context =
|
|
query::plan::MakePlanningContext(&ast, &symbol_table, cypher_query, &dba);
|
|
auto plan_and_cost =
|
|
query::plan::MakeLogicalPlan(&context, parameters, false);
|
|
ResultStreamFaker<query::TypedValue> results;
|
|
query::Frame frame(symbol_table.max_position());
|
|
// Nothing should be used from the EvaluationContext, so leave it empty.
|
|
query::EvaluationContext evaluation_context;
|
|
while (state.KeepRunning()) {
|
|
query::ExecutionContext execution_context{&dba, symbol_table,
|
|
evaluation_context};
|
|
utils::MonotonicBufferResource memory(1 * 1024 * 1024);
|
|
auto cursor = plan_and_cost.first->MakeCursor(&dba, &memory);
|
|
while (cursor->Pull(frame, execution_context))
|
|
;
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK(DistinctLinearAllocator)
|
|
->Range(1024, 1U << 21U)
|
|
->Unit(benchmark::kMicrosecond);
|
|
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void ExpandVariableDefaultAllocator(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::Parameters parameters;
|
|
database::GraphDb db;
|
|
AddStarGraph(&db, state.range(0), state.range(1));
|
|
query::SymbolTable symbol_table;
|
|
auto input_symbol = symbol_table.CreateSymbol("input", false);
|
|
auto dest_symbol = symbol_table.CreateSymbol("dest", false);
|
|
auto edge_symbol = symbol_table.CreateSymbol("edge", false);
|
|
auto lambda_node_symbol = symbol_table.CreateSymbol("n", false);
|
|
auto lambda_edge_symbol = symbol_table.CreateSymbol("e", false);
|
|
auto dba = db.Access();
|
|
query::Frame frame(symbol_table.max_position());
|
|
query::plan::ExpansionLambda filter_lambda;
|
|
filter_lambda.inner_node_symbol = lambda_node_symbol;
|
|
filter_lambda.inner_edge_symbol = lambda_edge_symbol;
|
|
filter_lambda.expression = nullptr;
|
|
query::plan::ExpandVariable expand_variable(
|
|
nullptr, input_symbol, dest_symbol, edge_symbol,
|
|
query::EdgeAtom::Type::DEPTH_FIRST, query::EdgeAtom::Direction::OUT, {},
|
|
false, nullptr, nullptr, false, filter_lambda, std::nullopt,
|
|
std::nullopt);
|
|
// Nothing should be used from the EvaluationContext, so leave it empty.
|
|
query::EvaluationContext evaluation_context;
|
|
while (state.KeepRunning()) {
|
|
query::ExecutionContext execution_context{&dba, symbol_table,
|
|
evaluation_context};
|
|
auto cursor = expand_variable.MakeCursor(&dba, utils::NewDeleteResource());
|
|
for (const auto &v : dba.Vertices(dba.Label(kStartLabel), false)) {
|
|
frame[input_symbol] = v;
|
|
while (cursor->Pull(frame, execution_context))
|
|
;
|
|
}
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK(ExpandVariableDefaultAllocator)
|
|
->Ranges({{1, 1U << 7U}, {512, 1U << 13U}})
|
|
->Unit(benchmark::kMillisecond);
|
|
|
|
// NOLINTNEXTLINE(google-runtime-references)
|
|
static void ExpandVariableLinearAllocator(benchmark::State &state) {
|
|
query::AstStorage ast;
|
|
query::Parameters parameters;
|
|
database::GraphDb db;
|
|
AddStarGraph(&db, state.range(0), state.range(1));
|
|
query::SymbolTable symbol_table;
|
|
auto input_symbol = symbol_table.CreateSymbol("input", false);
|
|
auto dest_symbol = symbol_table.CreateSymbol("dest", false);
|
|
auto edge_symbol = symbol_table.CreateSymbol("edge", false);
|
|
auto lambda_node_symbol = symbol_table.CreateSymbol("n", false);
|
|
auto lambda_edge_symbol = symbol_table.CreateSymbol("e", false);
|
|
auto dba = db.Access();
|
|
query::Frame frame(symbol_table.max_position());
|
|
query::plan::ExpansionLambda filter_lambda;
|
|
filter_lambda.inner_node_symbol = lambda_node_symbol;
|
|
filter_lambda.inner_edge_symbol = lambda_edge_symbol;
|
|
filter_lambda.expression = nullptr;
|
|
query::plan::ExpandVariable expand_variable(
|
|
nullptr, input_symbol, dest_symbol, edge_symbol,
|
|
query::EdgeAtom::Type::DEPTH_FIRST, query::EdgeAtom::Direction::OUT, {},
|
|
false, nullptr, nullptr, false, filter_lambda, std::nullopt,
|
|
std::nullopt);
|
|
// Nothing should be used from the EvaluationContext, so leave it empty.
|
|
query::EvaluationContext evaluation_context;
|
|
while (state.KeepRunning()) {
|
|
query::ExecutionContext execution_context{&dba, symbol_table,
|
|
evaluation_context};
|
|
utils::MonotonicBufferResource memory(query::kExecutionMemoryBlockSize);
|
|
auto cursor = expand_variable.MakeCursor(&dba, &memory);
|
|
for (const auto &v : dba.Vertices(dba.Label(kStartLabel), false)) {
|
|
frame[input_symbol] = v;
|
|
while (cursor->Pull(frame, execution_context))
|
|
;
|
|
}
|
|
}
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
BENCHMARK(ExpandVariableLinearAllocator)
|
|
->Ranges({{1, 1U << 7U}, {512, 1U << 13U}})
|
|
->Unit(benchmark::kMillisecond);
|
|
|
|
BENCHMARK_MAIN();
|