1875be1e34
Summary: Count labels in DGP Add worker_id getter Replace current_worker_id with worker_id Add spinner Add rpc calls for worker counts Check worker capacity Migrate to new worker Fix moving two connected vertices Token sharing algorithm Reviewers: msantl, buda Reviewed By: buda Subscribers: msantl, pullbot Differential Revision: https://phabricator.memgraph.io/D1392
133 lines
4.1 KiB
C++
133 lines
4.1 KiB
C++
#include <unordered_map>
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
#include "database/graph_db_accessor.hpp"
|
|
#include "storage/edge_accessor.hpp"
|
|
#include "storage/vertex_accessor.hpp"
|
|
|
|
#include "distributed_common.hpp"
|
|
|
|
using namespace database;
|
|
|
|
TEST_F(DistributedGraphDbTest, RemoteDataGetting) {
|
|
// Only old data is visible remotely, so create and commit some data.
|
|
gid::Gid v1_id, v2_id, e1_id;
|
|
|
|
{
|
|
GraphDbAccessor dba{master()};
|
|
auto v1 = dba.InsertVertex();
|
|
auto v2 = dba.InsertVertex();
|
|
auto e1 = dba.InsertEdge(v1, v2, dba.EdgeType("et"));
|
|
|
|
// Set some data so we see we're getting the right stuff.
|
|
v1.PropsSet(dba.Property("p1"), 42);
|
|
v1.add_label(dba.Label("label"));
|
|
v2.PropsSet(dba.Property("p2"), "value");
|
|
e1.PropsSet(dba.Property("p3"), true);
|
|
|
|
v1_id = v1.gid();
|
|
v2_id = v2.gid();
|
|
e1_id = e1.gid();
|
|
|
|
dba.Commit();
|
|
}
|
|
|
|
// The master must start a transaction before workers can work in it.
|
|
GraphDbAccessor master_dba{master()};
|
|
|
|
{
|
|
GraphDbAccessor w1_dba{worker(1), master_dba.transaction_id()};
|
|
VertexAccessor v1_in_w1{{v1_id, 0}, w1_dba};
|
|
EXPECT_NE(v1_in_w1.GetOld(), nullptr);
|
|
EXPECT_EQ(v1_in_w1.GetNew(), nullptr);
|
|
EXPECT_EQ(v1_in_w1.PropsAt(w1_dba.Property("p1")).Value<int64_t>(), 42);
|
|
EXPECT_TRUE(v1_in_w1.has_label(w1_dba.Label("label")));
|
|
}
|
|
|
|
{
|
|
GraphDbAccessor w2_dba{worker(2), master_dba.transaction_id()};
|
|
VertexAccessor v2_in_w2{{v2_id, 0}, w2_dba};
|
|
EXPECT_NE(v2_in_w2.GetOld(), nullptr);
|
|
EXPECT_EQ(v2_in_w2.GetNew(), nullptr);
|
|
EXPECT_EQ(v2_in_w2.PropsAt(w2_dba.Property("p2")).Value<std::string>(),
|
|
"value");
|
|
EXPECT_FALSE(v2_in_w2.has_label(w2_dba.Label("label")));
|
|
|
|
VertexAccessor v1_in_w2{{v1_id, 0}, w2_dba};
|
|
EdgeAccessor e1_in_w2{{e1_id, 0}, w2_dba};
|
|
EXPECT_EQ(e1_in_w2.from(), v1_in_w2);
|
|
EXPECT_EQ(e1_in_w2.to(), v2_in_w2);
|
|
EXPECT_EQ(e1_in_w2.EdgeType(), w2_dba.EdgeType("et"));
|
|
EXPECT_EQ(e1_in_w2.PropsAt(w2_dba.Property("p3")).Value<bool>(), true);
|
|
}
|
|
}
|
|
|
|
TEST_F(DistributedGraphDbTest, RemoteExpansion) {
|
|
// Model (v1)-->(v2), where each vertex is on one worker.
|
|
auto from = InsertVertex(worker(1));
|
|
auto to = InsertVertex(worker(2));
|
|
InsertEdge(from, to, "et");
|
|
{
|
|
// Expand on the master for three hops. Collect vertex gids.
|
|
GraphDbAccessor dba{master()};
|
|
std::vector<VertexAccessor> visited;
|
|
|
|
auto expand = [](auto &v) {
|
|
for (auto e : v.out()) return e.to();
|
|
for (auto e : v.in()) return e.from();
|
|
CHECK(false) << "No edge in vertex";
|
|
};
|
|
|
|
// Do a few hops back and forth, all on the master.
|
|
VertexAccessor v{from, dba};
|
|
for (int i = 0; i < 5; ++i) {
|
|
v = expand(v);
|
|
EXPECT_FALSE(v.address().is_local());
|
|
EXPECT_EQ(v.address(), i % 2 ? from : to);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(DistributedGraphDbTest, VertexCountsEqual) {
|
|
for (int i = 0; i < 5; ++i) InsertVertex(master());
|
|
for (int i = 0; i < 7; ++i) InsertVertex(worker(1));
|
|
for (int i = 0; i < 9; ++i) InsertVertex(worker(2));
|
|
|
|
{
|
|
GraphDbAccessor accessor(master());
|
|
auto m_cnt =
|
|
master().data_clients().VertexCounts(accessor.transaction().id_);
|
|
auto w1_cnt =
|
|
worker(1).data_clients().VertexCounts(accessor.transaction().id_);
|
|
auto w2_cnt =
|
|
worker(2).data_clients().VertexCounts(accessor.transaction().id_);
|
|
|
|
auto check = [&m_cnt, &w1_cnt, &w2_cnt](int key, int value) {
|
|
return m_cnt[key] == w1_cnt[key] && w1_cnt[key] == w2_cnt[key] &&
|
|
m_cnt[key] == value;
|
|
};
|
|
|
|
EXPECT_TRUE(check(master().WorkerId(), 5));
|
|
EXPECT_TRUE(check(worker(1).WorkerId(), 7));
|
|
EXPECT_TRUE(check(worker(2).WorkerId(), 9));
|
|
}
|
|
}
|
|
|
|
TEST_F(DistributedGraphDbTest, VertexCountsTransactional) {
|
|
{
|
|
GraphDbAccessor accessor(master());
|
|
InsertVertex(master());
|
|
EXPECT_EQ(master().data_clients().VertexCounts(
|
|
accessor.transaction().id_)[master().WorkerId()],
|
|
0);
|
|
}
|
|
// Transaction after insert which should now see the insertion
|
|
{
|
|
GraphDbAccessor accessor(master());
|
|
EXPECT_EQ(master().data_clients().VertexCounts(
|
|
accessor.transaction().id_)[master().WorkerId()],
|
|
1);
|
|
}
|
|
}
|