kostas test case

Cleaning up
Solution with rebalance
2021-10-22 11:39:50 +00:00 · 2021-10-22 11:05:43 +02:00 · 2021-10-22 10:50:02 +02:00 · 2021-10-21 14:12:56 +02:00 · 2021-10-21 14:10:34 +02:00 · 2021-10-21 07:54:34 +00:00
272 changed files with 275 additions and 3421 deletions
--- a/.github/workflows/daily_banchmark.yaml
+++ b/.github/workflows/daily_banchmark.yaml
@@ -42,16 +42,6 @@ jobs:
            --groups aggregation 1000_create unwind_create dense_expand match \
            --no-strict

-      - name: Get branch name (merge)
-        if: github.event_name != 'pull_request'
-        shell: bash
-        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
-
-      - name: Get branch name (pull request)
-        if: github.event_name == 'pull_request'
-        shell: bash
-        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
-
      - name: Upload macro benchmark results
        run: |
          cd tools/bench-graph-client
@@ -61,8 +51,7 @@ jobs:
          ./main.py --benchmark-name "macro_benchmark" \
                    --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
                    --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}" \
-                    --head-branch-name "${{ env.BRANCH_NAME }}"
+                    --github-run-number "${{ github.run_number }}"

      - name: Run mgbench
        run: |
@@ -78,5 +67,4 @@ jobs:
          ./main.py --benchmark-name "mgbench" \
                    --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
                    --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}" \
-                    --head-branch-name "${{ env.BRANCH_NAME }}"
+                    --github-run-number "${{ github.run_number }}"
--- a/.github/workflows/diff.yaml
+++ b/.github/workflows/diff.yaml
@@ -377,16 +377,6 @@ jobs:
            --groups aggregation 1000_create unwind_create dense_expand match \
            --no-strict

-      - name: Get branch name (merge)
-        if: github.event_name != 'pull_request'
-        shell: bash
-        run: echo "BRANCH_NAME=$(echo ${GITHUB_REF#refs/heads/} | tr / -)" >> $GITHUB_ENV
-
-      - name: Get branch name (pull request)
-        if: github.event_name == 'pull_request'
-        shell: bash
-        run: echo "BRANCH_NAME=$(echo ${GITHUB_HEAD_REF} | tr / -)" >> $GITHUB_ENV
-
      - name: Upload macro benchmark results
        run: |
          cd tools/bench-graph-client
@@ -396,8 +386,7 @@ jobs:
          ./main.py --benchmark-name "macro_benchmark" \
                    --benchmark-results-path "../../tests/macro_benchmark/.harness_summary" \
                    --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}" \
-                    --head-branch-name "${{ env.BRANCH_NAME }}"
+                    --github-run-number "${{ github.run_number }}"

      - name: Run mgbench
        run: |
@@ -413,5 +402,4 @@ jobs:
          ./main.py --benchmark-name "mgbench" \
                    --benchmark-results-path "../../tests/mgbench/benchmark_result.json" \
                    --github-run-id "${{ github.run_id }}" \
-                    --github-run-number "${{ github.run_number }}" \
-                    --head-branch-name "${{ env.BRANCH_NAME }}"
+                    --github-run-number "${{ github.run_number }}"
--- a/src/integrations/kafka/consumer.cpp
+++ b/src/integrations/kafka/consumer.cpp
@@ -35,9 +35,9 @@ constexpr std::chrono::milliseconds kMinimumInterval{1};
 constexpr int64_t kMinimumSize{1};

 namespace {
-utils::BasicResult<std::string, std::vector<Message>> GetBatch(RdKafka::KafkaConsumer &consumer,
-                                                               const ConsumerInfo &info,
-                                                               std::atomic<bool> &is_running) {
+utils::BasicResult<std::string, std::pair<int64_t, std::vector<Message>>> GetBatch(RdKafka::KafkaConsumer &consumer,
+                                                                                   const ConsumerInfo &info,
+                                                                                   std::atomic<bool> &is_running) {
  std::vector<Message> batch{};

  int64_t batch_size = info.batch_size.value_or(kDefaultBatchSize);
@@ -47,6 +47,7 @@ utils::BasicResult<std::string, std::vector<Message>> GetBatch(RdKafka::KafkaCon
  auto start = std::chrono::steady_clock::now();

  bool run_batch = true;
+  int64_t offset = 0;
  for (int64_t i = 0; remaining_timeout_in_ms > 0 && i < batch_size && is_running.load(); ++i) {
    std::unique_ptr<RdKafka::Message> msg(consumer.consume(remaining_timeout_in_ms));
    switch (msg->err()) {
@@ -55,6 +56,7 @@ utils::BasicResult<std::string, std::vector<Message>> GetBatch(RdKafka::KafkaCon
        break;

      case RdKafka::ERR_NO_ERROR:
+        offset = msg->offset();
        batch.emplace_back(std::move(msg));
        break;
      case RdKafka::ERR__MAX_POLL_EXCEEDED:
@@ -78,7 +80,7 @@ utils::BasicResult<std::string, std::vector<Message>> GetBatch(RdKafka::KafkaCon
    start = now;
  }

-  return {std::move(batch)};
+  return std::make_pair(offset, std::move(batch));
 }
 }  // namespace

@@ -131,6 +133,10 @@ Consumer::Consumer(const std::string &bootstrap_servers, ConsumerInfo info, Cons
    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
  }

+  if (conf->set("rebalance_cb", &cb_, error) != RdKafka::Conf::CONF_OK) {
+    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
+  }
+
  if (conf->set("enable.partition.eof", "false", error) != RdKafka::Conf::CONF_OK) {
    throw ConsumerFailedToInitializeException(info_.consumer_name, error);
  }
@@ -269,13 +275,13 @@ void Consumer::Check(std::optional<std::chrono::milliseconds> timeout, std::opti

    const auto &batch = maybe_batch.GetValue();

-    if (batch.empty()) {
+    if (batch.second.empty()) {
      continue;
    }
    ++i;

    try {
-      check_consumer_function(batch);
+      check_consumer_function(batch.second);
    } catch (const std::exception &e) {
      spdlog::warn("Kafka consumer {} check failed with error {}", info_.consumer_name, e.what());
      throw ConsumerCheckFailedException(info_.consumer_name, e.what());
@@ -333,13 +339,25 @@ void Consumer::StartConsuming() {
      }
      const auto &batch = maybe_batch.GetValue();

-      if (batch.empty()) continue;
+      if (batch.second.empty()) continue;

      spdlog::info("Kafka consumer {} is processing a batch", info_.consumer_name);

      try {
-        consumer_function_(batch);
-        if (const auto err = consumer_->commitSync(); err != RdKafka::ERR_NO_ERROR) {
+        consumer_function_(batch.second);
+        std::vector<RdKafka::TopicPartition *> partitions;
+        if (const auto err = consumer_->assignment(partitions); err != RdKafka::ERR_NO_ERROR) {
+          spdlog::warn("Saving the commited offset of consumer {} failed: {}", info_.consumer_name,
+                       RdKafka::err2str(err));
+          throw ConsumerCheckFailedException(
+              info_.consumer_name, fmt::format("Couldn't save commited offsets: '{}'", RdKafka::err2str(err)));
+        }
+
+        for (auto *partition : partitions) {
+          partition->set_offset(batch.first + 1);
+        }
+
+        if (const auto err = consumer_->commitSync(partitions); err != RdKafka::ERR_NO_ERROR) {
          spdlog::warn("Committing offset of consumer {} failed: {}", info_.consumer_name, RdKafka::err2str(err));
          break;
        }
@@ -358,4 +376,21 @@ void Consumer::StopConsuming() {
  if (thread_.joinable()) thread_.join();
 }

+std::string Consumer::SetConsumerOffsets(const std::string_view stream_name, int64_t offset) {
+  std::vector<RdKafka::TopicPartition *> partitions;
+  auto maybe_error = consumer_->assignment(partitions);
+  if (maybe_error != RdKafka::ErrorCode::ERR_NO_ERROR) {
+    return fmt::format("Can't access assigned topic partitions to the consumer: {}", maybe_error);
+  }
+
+  std::vector<std::unique_ptr<RdKafka::TopicPartition>> owners(partitions.begin(), partitions.end());
+  if (offset == -1) {
+    offset = RD_KAFKA_OFFSET_BEGINNING;
+  }
+
+  cb_.set_offset(offset);
+  consumer_->subscribe(info_.topics);
+
+  return "";
+}
 }  // namespace integrations::kafka
--- a/src/integrations/kafka/consumer.hpp
+++ b/src/integrations/kafka/consumer.hpp
@@ -137,6 +137,9 @@ class Consumer final : public RdKafka::EventCb {
  /// Returns true if the consumer is actively consuming messages.
  bool IsRunning() const;

+  ///
+  std::string SetConsumerOffsets(const std::string_view stream_name, int64_t offset);
+
  const ConsumerInfo &Info() const;

 private:
@@ -153,5 +156,35 @@ class Consumer final : public RdKafka::EventCb {
  std::optional<int64_t> limit_batches_{std::nullopt};
  std::unique_ptr<RdKafka::KafkaConsumer, std::function<void(RdKafka::KafkaConsumer *)>> consumer_;
  std::thread thread_;
+  class ExampleRebalanceCb : public RdKafka::RebalanceCb {
+   public:
+    void rebalance_cb(RdKafka::KafkaConsumer *consumer, RdKafka::ErrorCode err,
+                      std::vector<RdKafka::TopicPartition *> &partitions) {
+      if (offset_) {
+        for (auto partition : partitions) {
+          partition->set_offset(*offset_);
+        }
+        offset_.reset();
+      }
+      consumer->assign(partitions);
+      consumer->commitSync(partitions);
+    }
+    void set_offset(int64_t offset) { offset_ = offset; }
+
+   private:
+    std::optional<int64_t> offset_ = -1;
+  };
+
+  ExampleRebalanceCb cb_;
+
+  class ExampleCommitCb : public RdKafka::OffsetCommitCb {
+    void offset_commit_cb(RdKafka::ErrorCode err, std::vector<RdKafka::TopicPartition *> &offsets) override {
+      for (auto *partition : offsets) {
+        spdlog::critical("Trying to commit {}", partition->offset());
+      }
+    }
+  };
+
+  ExampleCommitCb commit_cb_;
 };
 }  // namespace integrations::kafka
--- a/src/query/interpreter.cpp
+++ b/src/query/interpreter.cpp
@@ -830,14 +830,14 @@ std::optional<plan::ProfilingStatsWithTotalTime> PullPlan::Pull(AnyStream *strea
  // Also, we want to throw only when the query engine requests more memory and not the storage
  // so we add the exception to the allocator.
  // TODO (mferencevic): Tune the parameters accordingly.
-  utils::FixedSizePoolResource pool_memory(128, 1024, &monotonic_memory);
+  utils::PoolResource pool_memory(128, 1024, &monotonic_memory);
  std::optional<utils::LimitedMemoryResource> maybe_limited_resource;

  if (memory_limit_) {
-    maybe_limited_resource.emplace(utils::NewDeleteResource(), *memory_limit_);
+    maybe_limited_resource.emplace(&pool_memory, *memory_limit_);
    ctx_.evaluation_context.memory = &*maybe_limited_resource;
  } else {
-    ctx_.evaluation_context.memory = utils::NewDeleteResource();
+    ctx_.evaluation_context.memory = &pool_memory;
  }

  // Returns true if a result was pulled.
--- a/src/query/plan/operator.cpp
+++ b/src/query/plan/operator.cpp
@@ -49,7 +49,6 @@
 #include "utils/pmr/vector.hpp"
 #include "utils/readable_size.hpp"
 #include "utils/string.hpp"
-#include "utils/temporal.hpp"

 // macro for the default implementation of LogicalOperator::Accept
 // that accepts the visitor and visits it's input_ operator
@@ -1446,7 +1445,7 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
    // satisfy the "where" condition. if so, places them in the priority
    // queue.
    auto expand_pair = [this, &evaluator, &frame, &create_state](const EdgeAccessor &edge, const VertexAccessor &vertex,
-                                                                 const TypedValue &total_weight, int64_t depth) {
+                                                                 double weight, int64_t depth) {
      auto *memory = evaluator.GetMemoryResource();
      if (self_.filter_lambda_.expression) {
        frame[self_.filter_lambda_.inner_edge_symbol] = edge;
@@ -1458,48 +1457,27 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
      frame[self_.weight_lambda_->inner_edge_symbol] = edge;
      frame[self_.weight_lambda_->inner_node_symbol] = vertex;

-      TypedValue current_weight = self_.weight_lambda_->expression->Accept(evaluator);
+      TypedValue typed_weight = self_.weight_lambda_->expression->Accept(evaluator);

-      if (!current_weight.IsNumeric() && !current_weight.IsDuration()) {
-        throw QueryRuntimeException("Calculated weight must be numeric or a Duration, got {}.", current_weight.type());
+      if (!typed_weight.IsNumeric()) {
+        throw QueryRuntimeException("Calculated weight must be numeric, got {}.", typed_weight.type());
      }
-
-      const auto is_valid_numeric = [&] {
-        return current_weight.IsNumeric() && (current_weight >= TypedValue(0, memory)).ValueBool();
-      };
-
-      const auto is_valid_duration = [&] {
-        return current_weight.IsDuration() && (current_weight >= TypedValue(utils::Duration(0), memory)).ValueBool();
-      };
-
-      if (!is_valid_numeric() && !is_valid_duration()) {
+      if ((typed_weight < TypedValue(0, memory)).ValueBool()) {
        throw QueryRuntimeException("Calculated weight must be non-negative!");
      }

      auto next_state = create_state(vertex, depth);
-
-      TypedValue next_weight = std::invoke([&] {
-        if (total_weight.IsNull()) {
-          return current_weight;
-        }
-
-        ValidateWeightTypes(current_weight, total_weight);
-
-        return TypedValue(current_weight, memory) + total_weight;
-      });
-
+      auto next_weight = TypedValue(weight, memory) + typed_weight;
      auto found_it = total_cost_.find(next_state);
-      if (found_it != total_cost_.end() && (found_it->second.IsNull() || (found_it->second <= next_weight).ValueBool()))
-        return;
+      if (found_it != total_cost_.end() && found_it->second.ValueDouble() <= next_weight.ValueDouble()) return;

-      pq_.push({next_weight, depth + 1, vertex, edge});
+      pq_.push({next_weight.ValueDouble(), depth + 1, vertex, edge});
    };

    // Populates the priority queue structure with expansions
    // from the given vertex. skips expansions that don't satisfy
    // the "where" condition.
-    auto expand_from_vertex = [this, &expand_pair](const VertexAccessor &vertex, const TypedValue &weight,
-                                                   int64_t depth) {
+    auto expand_from_vertex = [this, &expand_pair](const VertexAccessor &vertex, double weight, int64_t depth) {
      if (self_.common_.direction != EdgeAtom::Direction::IN) {
        auto out_edges = UnwrapEdgesResult(vertex.OutEdges(storage::View::OLD, self_.common_.edge_types));
        for (const auto &edge : out_edges) {
@@ -1544,7 +1522,7 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
        total_cost_.clear();
        yielded_vertices_.clear();

-        pq_.push({TypedValue(), 0, vertex, std::nullopt});
+        pq_.push({0.0, 0, vertex, std::nullopt});
        // We are adding the starting vertex to the set of yielded vertices
        // because we don't want to yield paths that end with the starting
        // vertex.
@@ -1644,38 +1622,17 @@ class ExpandWeightedShortestPathCursor : public query::plan::Cursor {
  // Keeps track of vertices for which we yielded a path already.
  utils::pmr::unordered_set<VertexAccessor> yielded_vertices_;

-  static void ValidateWeightTypes(const TypedValue &lhs, const TypedValue &rhs) {
-    if (!((lhs.IsNumeric() && lhs.IsNumeric()) || (rhs.IsDuration() && rhs.IsDuration()))) {
-      throw QueryRuntimeException(utils::MessageWithLink(
-          "All weights should be of the same type, either numeric or a Duration. Please update the weight "
-          "expression or the filter expression.",
-          "https://memgr.ph/wsp"));
-    }
-  }
-
  // Priority queue comparator. Keep lowest weight on top of the queue.
  class PriorityQueueComparator {
   public:
-    bool operator()(const std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &lhs,
-                    const std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &rhs) {
-      const auto &lhs_weight = std::get<0>(lhs);
-      const auto &rhs_weight = std::get<0>(rhs);
-      // Null defines minimum value for all types
-      if (lhs_weight.IsNull()) {
-        return false;
-      }
-
-      if (rhs_weight.IsNull()) {
-        return true;
-      }
-
-      ValidateWeightTypes(lhs_weight, rhs_weight);
-      return (lhs_weight > rhs_weight).ValueBool();
+    bool operator()(const std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &lhs,
+                    const std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>> &rhs) {
+      return std::get<0>(lhs) > std::get<0>(rhs);
    }
  };

-  std::priority_queue<std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>>,
-                      utils::pmr::vector<std::tuple<TypedValue, int64_t, VertexAccessor, std::optional<EdgeAccessor>>>,
+  std::priority_queue<std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>>,
+                      utils::pmr::vector<std::tuple<double, int64_t, VertexAccessor, std::optional<EdgeAccessor>>>,
                      PriorityQueueComparator>
      pq_;

--- a/src/query/procedure/mg_procedure_impl.hpp
+++ b/src/query/procedure/mg_procedure_impl.hpp
@@ -676,6 +676,17 @@ struct mgp_proc {
        results(memory),
        is_write_procedure(is_write_procedure) {}

+  /// @throw std::bad_alloc
+  /// @throw std::length_error
+  mgp_proc(const std::string_view name, std::function<void(mgp_list *, mgp_graph *, mgp_result *, mgp_memory *)> cb,
+           utils::MemoryResource *memory, bool is_write_procedure)
+      : name(name, memory),
+        cb(cb),
+        args(memory),
+        opt_args(memory),
+        results(memory),
+        is_write_procedure(is_write_procedure) {}
+
  /// @throw std::bad_alloc
  /// @throw std::length_error
  mgp_proc(const mgp_proc &other, utils::MemoryResource *memory)
--- a/src/query/procedure/module.cpp
+++ b/src/query/procedure/module.cpp
@@ -326,14 +326,16 @@ bool SharedLibraryModule::Load(const std::filesystem::path &file_path) {
  handle_ = dlopen(file_path.c_str(), RTLD_NOW | RTLD_LOCAL);
  if (!handle_) {
    // NOLINTNEXTLINE(concurrency-mt-unsafe)
-    spdlog::error(utils::MessageWithLink("Unable to load module {}; {}.", file_path, dlerror(), "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Unable to load module {}; {}.", file_path, dlerror(), "https://memgr.ph/modules"));
    return false;
  }
  // Get required mgp_init_module
  init_fn_ = reinterpret_cast<int (*)(mgp_module *, mgp_memory *)>(dlsym(handle_, "mgp_init_module"));
  char *dl_errored = dlerror();
  if (!init_fn_ || dl_errored) {
-    spdlog::error(utils::MessageWithLink("Unable to load module {}; {}.", file_path, dl_errored, "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Unable to load module {}; {}.", file_path, dl_errored, "https://memgr.ph/modules"));
    dlclose(handle_);
    handle_ = nullptr;
    return false;
@@ -385,7 +387,8 @@ bool SharedLibraryModule::Close() {
  }
  if (dlclose(handle_) != 0) {
    // NOLINTNEXTLINE(concurrency-mt-unsafe)
-    spdlog::error(utils::MessageWithLink("Failed to close module {}; {}.", file_path_, dlerror(), "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Failed to close module {}; {}.", file_path_, dlerror(), "https://memgr.ph/modules"));
    return false;
  }
  spdlog::info("Closed module {}", file_path_);
@@ -444,7 +447,8 @@ bool PythonModule::Load(const std::filesystem::path &file_path) {
  auto gil = py::EnsureGIL();
  auto maybe_exc = py::AppendToSysPath(file_path.parent_path().c_str());
  if (maybe_exc) {
-    spdlog::error(utils::MessageWithLink("Unable to load module {}; {}.", file_path, *maybe_exc, "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Unable to load module {}; {}.", file_path, *maybe_exc, "https://memgr.ph/modules"));
    return false;
  }
  bool succ = true;
@@ -469,7 +473,8 @@ bool PythonModule::Load(const std::filesystem::path &file_path) {
    return true;
  }
  auto exc_info = py::FetchError().value();
-  spdlog::error(utils::MessageWithLink("Unable to load module {}; {}.", file_path, exc_info, "https://memgr.ph/modules"));
+  spdlog::error(
+      utils::MessageWithLink("Unable to load module {}; {}.", file_path, exc_info, "https://memgr.ph/modules"));
  return false;
 }

@@ -534,7 +539,8 @@ bool ModuleRegistry::RegisterModule(const std::string_view &name, std::unique_pt
  MG_ASSERT(!name.empty(), "Module name cannot be empty");
  MG_ASSERT(module, "Tried to register an invalid module");
  if (modules_.find(name) != modules_.end()) {
-    spdlog::error(utils::MessageWithLink("Unable to overwrite an already loaded module {}.", name, "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Unable to overwrite an already loaded module {}.", name, "https://memgr.ph/modules"));
    return false;
  }
  modules_.emplace(name, std::move(module));
@@ -564,7 +570,8 @@ void ModuleRegistry::SetModulesDirectory(std::vector<std::filesystem::path> modu

 bool ModuleRegistry::LoadModuleIfFound(const std::filesystem::path &modules_dir, const std::string_view name) {
  if (!utils::DirExists(modules_dir)) {
-    spdlog::error(utils::MessageWithLink("Module directory {} doesn't exist.", modules_dir, "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Module directory {} doesn't exist.", modules_dir, "https://memgr.ph/modules"));
    return false;
  }
  for (const auto &entry : std::filesystem::directory_iterator(modules_dir)) {
@@ -601,7 +608,8 @@ bool ModuleRegistry::LoadOrReloadModuleFromName(const std::string_view name) {
 void ModuleRegistry::LoadModulesFromDirectory(const std::filesystem::path &modules_dir) {
  if (modules_dir.empty()) return;
  if (!utils::DirExists(modules_dir)) {
-    spdlog::error(utils::MessageWithLink("Module directory {} doesn't exist.", modules_dir, "https://memgr.ph/modules"));
+    spdlog::error(
+        utils::MessageWithLink("Module directory {} doesn't exist.", modules_dir, "https://memgr.ph/modules"));
    return;
  }
  for (const auto &entry : std::filesystem::directory_iterator(modules_dir)) {
@@ -638,6 +646,19 @@ void ModuleRegistry::UnloadAllModules() {

 utils::MemoryResource &ModuleRegistry::GetSharedMemoryResource() noexcept { return *shared_; }

+bool ModuleRegistry::RegisterProcedure(const std::string_view name,
+                                       std::function<void(mgp_list *, mgp_graph *, mgp_result *, mgp_memory *)> f) {
+  std::unique_lock<utils::RWLock> guard(lock_);
+  auto module = modules_.find("mg");
+  if (module != modules_.end()) {
+    auto *builtin_module = dynamic_cast<BuiltinModule *>(module->second.get());
+    mgp_proc proc(name, std::move(f), utils::NewDeleteResource(), false);
+    builtin_module->AddProcedure(name, std::move(proc));
+    return true;
+  }
+  return false;
+}
+
 namespace {

 /// This function returns a pair of either
--- a/src/query/procedure/module.hpp
+++ b/src/query/procedure/module.hpp
@@ -117,6 +117,9 @@ class ModuleRegistry final {
  /// Returns the shared memory allocator used by modules
  utils::MemoryResource &GetSharedMemoryResource() noexcept;

+  bool RegisterProcedure(const std::string_view name,
+                         std::function<void(mgp_list *, mgp_graph *, mgp_result *, mgp_memory *)> f);
+
 private:
  std::vector<std::filesystem::path> modules_dirs_;
 };
--- a/src/query/streams.cpp
+++ b/src/query/streams.cpp
@@ -20,6 +20,7 @@
 #include "query/db_accessor.hpp"
 #include "query/discard_value_stream.hpp"
 #include "query/interpreter.hpp"
+#include "query/procedure//mg_procedure_helpers.hpp"
 #include "query/procedure/mg_procedure_impl.hpp"
 #include "query/procedure/module.hpp"
 #include "query/typed_value.hpp"
@@ -185,7 +186,28 @@ Streams::Streams(InterpreterContext *interpreter_context, std::string bootstrap_
                 std::filesystem::path directory)
    : interpreter_context_(interpreter_context),
      bootstrap_servers_(std::move(bootstrap_servers)),
-      storage_(std::move(directory)) {}
+      storage_(std::move(directory)) {
+  auto set_stream_offset_procedure = [ictx = interpreter_context](mgp_list *args, mgp_graph * /*graph*/,
+                                                                  mgp_result *result, mgp_memory * /*memory*/) {
+    MG_ASSERT(procedure::Call<size_t>(mgp_list_size, args) == 2U, "Should have been type checked already");
+    auto *arg = procedure::Call<mgp_value *>(mgp_list_at, args, 0);
+    MG_ASSERT(procedure::CallBool(mgp_value_is_string, arg), "Should have been type checked already");
+    bool succ = false;
+    const char *arg_as_string{nullptr};
+    if (const auto err = mgp_value_get_string(arg, &arg_as_string); err != MGP_ERROR_NO_ERROR) {
+      succ = false;
+    }
+    auto *offset_value = procedure::Call<mgp_value *>(mgp_list_at, args, 1);
+    int64_t offset{0};
+    auto res = mgp_value_get_int(offset_value, &offset);
+    std::string error = ictx->streams.SetStreamOffset(arg_as_string, offset);
+    if (!error.empty()) {
+      MG_ASSERT(mgp_result_set_error_msg(result, "something") == MGP_ERROR_NO_ERROR);
+    }
+  };
+
+  procedure::gModuleRegistry.RegisterProcedure("set_stream_offset", set_stream_offset_procedure);
+}

 void Streams::RestoreStreams() {
  spdlog::info("Loading streams...");
@@ -434,4 +456,14 @@ void Streams::Persist(StreamStatus &&status) {
 }

 std::string_view Streams::BootstrapServers() const { return bootstrap_servers_; }
+
+std::string Streams::SetStreamOffset(const std::string_view stream_name, int64_t offset) {
+  auto lock_ptr = streams_.Lock();
+  if (auto it = lock_ptr->find(std::string(stream_name)); it != lock_ptr->end()) {
+    auto consumer_lock_ptr = it->second.consumer->Lock();
+    return consumer_lock_ptr->SetConsumerOffsets(stream_name, offset);
+  }
+  return fmt::format("Stream: {} not found", stream_name);
+}
+
 }  // namespace query
--- a/src/query/streams.hpp
+++ b/src/query/streams.hpp
@@ -143,6 +143,8 @@ class Streams final {
  /// Return the configuration value passed to memgraph.
  std::string_view BootstrapServers() const;

+  std::string SetStreamOffset(const std::string_view stream_name, int64_t offset);
+
 private:
  using StreamsMap = std::unordered_map<std::string, StreamData>;
  using SynchronizedStreamsMap = utils::Synchronized<StreamsMap, utils::WritePrioritizedRWLock>;
--- a/src/utils/memory.cpp
+++ b/src/utils/memory.cpp
@@ -13,7 +13,6 @@

 #include <algorithm>
 #include <cmath>
-#include <cstddef>
 #include <cstdint>
 #include <limits>
 #include <type_traits>
@@ -165,9 +164,8 @@ void *Pool::Allocate() {
    --chunk->blocks_available;
    return available_block;
  };
-  if (last_alloc_chunk_ && last_alloc_chunk_->blocks_available > 0U) {
+  if (last_alloc_chunk_ && last_alloc_chunk_->blocks_available > 0U)
    return allocate_block_from_chunk(last_alloc_chunk_);
-  }
  // Find a Chunk with available memory.
  for (auto &chunk : chunks_) {
    if (chunk.blocks_available > 0U) {
@@ -349,141 +347,4 @@ void PoolResource::Release() {

 // PoolResource END

-namespace impl {
-namespace {
-constexpr size_t kInitialChunkSize = 1;
-}  // namespace
-FixedSizePool::FixedSizePool(const size_t block_size, const size_t max_blocks_per_chunk_,
-                             utils::MemoryResource *upstream)
-    : block_size_{block_size},
-      max_blocks_per_chunk_{max_blocks_per_chunk_},
-      chunk_size_{kInitialChunkSize},
-      upstream_{upstream} {
-  internal_block_size_ = RoundUp(block_size, alignof(std::max_align_t));
-}
-
-void *FixedSizePool::Allocate() {
-  if (begin_ == end_) {
-    if (free_list_) {
-      Link *p = free_list_;
-      free_list_ = p->next;
-      return p;
-    }
-
-    Replenish();
-  }
-
-  auto *p = begin_;
-  begin_ += internal_block_size_;
-  return p;
-}
-
-void FixedSizePool::Deallocate(void *p) {
-  static_cast<Link *>(p)->next = free_list_;
-  free_list_ = static_cast<Link *>(p);
-}
-
-void FixedSizePool::Release() {
-  chunk_list_.Release(upstream_);
-
-  chunk_size_ = kInitialChunkSize;
-  begin_ = nullptr;
-  end_ = nullptr;
-  free_list_ = nullptr;
-}
-
-FixedSizePool::~FixedSizePool() { Release(); }
-
-void FixedSizePool::Replenish() {
-  begin_ = static_cast<std::byte *>(chunk_list_.Allocate(chunk_size_ * internal_block_size_, upstream_));
-  end_ = begin_ + chunk_size_ * internal_block_size_;
-
-  // TODO (antonio2368): Add more growth strategies
-  const auto next_chunk_size = chunk_size_ * 2;
-  if (next_chunk_size <= max_blocks_per_chunk_) {
-    chunk_size_ = next_chunk_size;
-  }
-}
-
-}  // namespace impl
-
-namespace {
-inline uint64_t CeilLog2(const uint64_t x) { return utils::Log2(x) + !utils::IsPow2(x); }
-}  // namespace
-
-FixedSizePoolResource::FixedSizePoolResource(const size_t max_blocks_per_chunk, const size_t max_block_size,
-                                             utils::MemoryResource *upstream)
-    : upstream_{upstream} {
-  max_block_size_ = min_block_size_;
-
-  num_pools_ = CeilLog2(max_block_size) - CeilLog2(min_block_size_) + 1;
-  MG_ASSERT(num_pools_ > 0, "Invalid max size of the block.");
-
-  auto allocator = Allocator<impl::FixedSizePool>(upstream_);
-  pools_ = allocator.allocate(num_pools_);
-
-  for (size_t i = 0; i < num_pools_; ++i) {
-    allocator.construct(pools_ + i, max_block_size_, max_blocks_per_chunk, upstream);
-    MG_ASSERT(max_block_size_ <= std::numeric_limits<size_t>::max() / 2);
-    max_block_size_ *= 2;
-  }
-
-  max_block_size_ /= 2;
-}
-
-void *FixedSizePoolResource::DoAllocate(const size_t bytes, const size_t alignment) {
-  MG_ASSERT(bytes > 0);
-  void *ret{nullptr};
-  if (bytes <= max_block_size_) {
-    auto *pool = FindPool(bytes);
-    ret = pool->Allocate();
-  } else {
-    // add to the list of allocated chunks
-    ret = large_blocks_.Allocate(bytes, upstream_);
-  }
-
-  return ret;
-}
-
-void FixedSizePoolResource::DoDeallocate(void *p, const size_t bytes, const size_t alignment) {
-  auto *pool = FindPool(bytes);
-
-  if (pool == nullptr) {
-    large_blocks_.Deallocate(p, upstream_);
-  } else {
-    pool->Deallocate(p);
-  }
-}
-
-impl::FixedSizePool *FixedSizePoolResource::FindPool(const size_t size) const {
-  if (size > max_block_size_) {
-    return nullptr;
-  }
-
-  auto *pool = pools_;
-  while (size > pool->BlockSize()) {
-    ++pool;
-  }
-
-  return pool;
-}
-
-void FixedSizePoolResource::Release() {
-  for (size_t i = 0; i < num_pools_; ++i) {
-    pools_[i].Release();
-  }
-
-  large_blocks_.Release(upstream_);
-}
-
-FixedSizePoolResource::~FixedSizePoolResource() {
-  Release();
-
-  for (size_t i = 0; i < num_pools_; ++i) {
-    pools_[i].~FixedSizePool();
-  }
-
-  upstream_->Deallocate(pools_, sizeof(impl::FixedSizePool) * num_pools_, alignof(impl::FixedSizePool));
-}
-
 }  // namespace utils
--- a/src/utils/memory.hpp
+++ b/src/utils/memory.hpp
@@ -16,7 +16,6 @@
 #pragma once

 #include <cstddef>
-#include <list>
 #include <memory>
 #include <mutex>
 #include <new>
@@ -24,9 +23,6 @@
 #include <type_traits>
 #include <utility>
 #include <vector>
-#ifndef NDEBUG
-#include <iostream>
-#endif
 // Although <memory_resource> is in C++17, gcc libstdc++ still needs to
 // implement it fully. It should be available in the next major release
 // version, i.e. gcc 9.x.
@@ -568,217 +564,6 @@ class LimitedMemoryResource final : public utils::MemoryResource {
  bool DoIsEqual(const MemoryResource &other) const noexcept override { return this == &other; }
 };

-namespace impl {
-
-// https://stackoverflow.com/a/9194117
-// if y is power 2 we can do (x + y - 1) & ~(y - 1);
-// https://stackoverflow.com/a/14561794
-constexpr size_t RoundUp(const size_t x, const size_t y) {
-  MG_ASSERT(y >= 1);
-  return (x + y - 1) / y * y;
-}
-
-struct LinkedListNode {
-  LinkedListNode *next;
-  LinkedListNode *previous;
-};
-
-struct BlockLinkedListHeaderBase : public LinkedListNode {
-  size_t size;
-
-  using NodeType = LinkedListNode;
-};
-
-struct SingleLinkedListNode {
-  SingleLinkedListNode *next;
-};
-
-struct BlockSingleLinkedListHeaderBase : public SingleLinkedListNode {
-  size_t size;
-
-  using NodeType = SingleLinkedListNode;
-};
-
-template <typename T>
-concept BlockLinkedListHeader = std::is_base_of_v<BlockLinkedListHeaderBase, T>;
-
-template <typename T>
-concept BlockSingleLinkedListHeader = std::is_base_of_v<BlockSingleLinkedListHeaderBase, T>;
-
-template <typename T>
-concept BlockListHeader = BlockLinkedListHeader<T> || BlockSingleLinkedListHeader<T>;
-
-template <BlockListHeader THeader>
-class BlockList {
-  using NodeType = typename THeader::NodeType;
-
- public:
-  static const size_t header_size = RoundUp(sizeof(THeader), alignof(std::max_align_t));
-
-  explicit BlockList() {
-    // create a circular linked list
-    list_.next = &list_;
-
-    if constexpr (BlockLinkedListHeader<THeader>) {
-      list_.previous = &list_;
-    }
-  }
-
-  void *Allocate(const size_t bytes, utils::MemoryResource *rsrc) {
-    if (bytes > static_cast<size_t>(-1) - header_size) {
-      throw utils::BadAlloc("Requested too many bytes to allocate");
-    }
-
-    void *p = rsrc->Allocate(bytes + header_size);
-    auto *node = new (p) THeader;
-    node->size = bytes + header_size;
-
-    auto *next = list_.next;
-    node->next = next;
-    list_.next = node;
-
-    if constexpr (BlockLinkedListHeader<THeader>) {
-      node->previous = &list_;
-      next->previous = node;
-    }
-
-    return static_cast<std::byte *>(p) + header_size;
-  }
-
-  template <typename T = THeader>
-  requires BlockLinkedListHeader<T> void Deallocate(void *p, utils::MemoryResource *rsrc) {
-    auto *header = static_cast<THeader *>(static_cast<void *>(static_cast<std::byte *>(p) - header_size));
-    auto *next = header->next;
-    auto *previous = header->previous;
-    previous->next = next;
-    next->previous = previous;
-
-    const size_t size = header->size;
-    header->~THeader();
-    rsrc->Deallocate(header, size, alignof(std::max_align_t));
-  }
-
-  void Release(utils::MemoryResource *rsrc) {
-    NodeType *node = list_.next;
-    while (node != &list_) {
-      auto *header = static_cast<THeader *>(node);
-      node = node->next;
-      const size_t size = header->size;
-      header->~THeader();
-      rsrc->Deallocate(header, size, alignof(std::max_align_t));
-    }
-
-    // create a circular linked list
-    list_.next = &list_;
-
-    if constexpr (BlockLinkedListHeader<THeader>) {
-      list_.previous = &list_;
-    }
-  }
-
- private:
-  NodeType list_;
-};
-
-// https://github.com/bloomberg/bde/blob/master/groups/bdl/bdlma/bdlma_pool.h
-class FixedSizePool final {
- public:
-  FixedSizePool(size_t block_size, size_t max_blocks_per_chunk, utils::MemoryResource *upstream);
-
-  FixedSizePool(const FixedSizePool &) = delete;
-  FixedSizePool &operator=(const FixedSizePool &) = delete;
-
-  FixedSizePool(FixedSizePool &&) = default;
-  FixedSizePool &operator=(FixedSizePool &&) = default;
-
-  void *Allocate();
-  void Deallocate(void *p);
-
-  void Release();
-
-  auto BlockSize() const { return block_size_; }
-
-  ~FixedSizePool();
-
- private:
-  struct Link {
-    Link *next;
-  };
-
-  std::byte *begin_{nullptr};
-  std::byte *end_{nullptr};
-
-  Link *free_list_{nullptr};
-
-  size_t internal_block_size_;
-  size_t block_size_;
-  size_t max_blocks_per_chunk_;
-  size_t chunk_size_;
-
-  BlockList<BlockSingleLinkedListHeaderBase> chunk_list_;
-
-  utils::MemoryResource *upstream_;
-
-  void Replenish();
-};
-}  // namespace impl
-
-// https://github.com/bloomberg/bde/blob/master/groups/bdl/bdlma/bdlma_multipool.h
-class FixedSizePoolResource : public MemoryResource {
- public:
-  explicit FixedSizePoolResource(size_t max_blocks_per_chunk, size_t max_block_size,
-                                 utils::MemoryResource *upstream = utils::NewDeleteResource());
-
-  void Release();
-
-  FixedSizePoolResource(const FixedSizePoolResource &) = delete;
-  FixedSizePoolResource &operator=(const FixedSizePoolResource &) = delete;
-
-  FixedSizePoolResource(FixedSizePoolResource &&) = default;
-  FixedSizePoolResource &operator=(FixedSizePoolResource &&) = default;
-
-  ~FixedSizePoolResource() override;
-
- private:
-  impl::FixedSizePool *FindPool(size_t size) const;
-
-  void *DoAllocate(size_t bytes, size_t alignment) override;
-  void DoDeallocate(void *p, size_t bytes, size_t alignment) override;
-
-  bool DoIsEqual(const MemoryResource &other) const noexcept override { return this == &other; }
-
-  impl::FixedSizePool *pools_{nullptr};
-  size_t max_block_size_;
-  size_t min_block_size_{8};
-  size_t num_pools_{0};
-
-  impl::BlockList<impl::BlockLinkedListHeaderBase> large_blocks_;
-
-  utils::MemoryResource *upstream_;
-};
-
-#ifndef NDEBUG
-class PrintMemoryResource : public MemoryResource {
- public:
-  explicit PrintMemoryResource(utils::MemoryResource *memory) : memory_(memory) {}
-
- private:
-  void *DoAllocate(size_t bytes, size_t alignment) override {
-    std::cout << "Allocating " << bytes << std::endl;
-    return memory_->Allocate(bytes, alignment);
-  }
-
-  void DoDeallocate(void *p, size_t bytes, size_t alignment) override {
-    std::cout << "Deallocating " << bytes << std::endl;
-    return memory_->Deallocate(p, bytes, alignment);
-  }
-
-  bool DoIsEqual(const utils::MemoryResource &other) const noexcept override { return memory_->IsEqual(other); }
-
-  utils::MemoryResource *memory_;
-};
-#endif
-
 // Allocate memory with the OutOfMemoryException enabled if the requested size
 // puts total allocated amount over the limit.
 class ResourceWithOutOfMemoryException : public MemoryResource {
--- a/tests/benchmark/data_structures/ring_buffer.cpp
+++ b/tests/benchmark/data_structures/ring_buffer.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <benchmark/benchmark.h>
 #include <benchmark/benchmark_api.h>
 #include <iostream>
--- a/tests/benchmark/expansion.cpp
+++ b/tests/benchmark/expansion.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <benchmark/benchmark.h>
 #include <benchmark/benchmark_api.h>

--- a/tests/benchmark/query/eval.cpp
+++ b/tests/benchmark/query/eval.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <benchmark/benchmark.h>

 #include "query/db_accessor.hpp"
--- a/tests/benchmark/query/execution.cpp
+++ b/tests/benchmark/query/execution.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <random>
 #include <string>

--- a/tests/benchmark/query/planner.cpp
+++ b/tests/benchmark/query/planner.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <benchmark/benchmark_api.h>
 #include <string>
 #include <variant>
--- a/tests/benchmark/query/profile.cpp
+++ b/tests/benchmark/query/profile.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <memory>
 #include <vector>

--- a/tests/benchmark/query/stripped.cpp
+++ b/tests/benchmark/query/stripped.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #define LOG_NO_INFO 1

 #include <fstream>
--- a/tests/benchmark/rpc.cpp
+++ b/tests/benchmark/rpc.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <optional>
 #include <thread>

--- a/tests/benchmark/skip_list_common.hpp
+++ b/tests/benchmark/skip_list_common.hpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #pragma once

 #include <atomic>
--- a/tests/benchmark/skip_list_random.cpp
+++ b/tests/benchmark/skip_list_random.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include "skip_list_common.hpp"

 #include "utils/skip_list.hpp"
--- a/tests/benchmark/skip_list_real_world.cpp
+++ b/tests/benchmark/skip_list_real_world.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include "skip_list_common.hpp"

 #include "utils/skip_list.hpp"
--- a/tests/benchmark/skip_list_same_item.cpp
+++ b/tests/benchmark/skip_list_same_item.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include "skip_list_common.hpp"

 #include "utils/skip_list.hpp"
--- a/tests/benchmark/skip_list_vs_stl.cpp
+++ b/tests/benchmark/skip_list_vs_stl.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <iostream>
 #include <map>
--- a/tests/benchmark/storage_v2_gc.cpp
+++ b/tests/benchmark/storage_v2_gc.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <iostream>

 #include <gflags/gflags.h>
--- a/tests/benchmark/storage_v2_property_store.cpp
+++ b/tests/benchmark/storage_v2_property_store.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <iostream>
 #include <map>
--- a/tests/concurrent/common.hpp
+++ b/tests/concurrent/common.hpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <future>
 #include <iostream>
--- a/tests/concurrent/network_common.hpp
+++ b/tests/concurrent/network_common.hpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #pragma once

 #include <array>
--- a/tests/concurrent/network_read_hang.cpp
+++ b/tests/concurrent/network_read_hang.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #ifndef NDEBUG
 #define NDEBUG
 #endif
--- a/tests/concurrent/network_server.cpp
+++ b/tests/concurrent/network_server.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #ifndef NDEBUG
 #define NDEBUG
 #endif
--- a/tests/concurrent/network_session_leak.cpp
+++ b/tests/concurrent/network_session_leak.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #ifndef NDEBUG
 #define NDEBUG
 #endif
--- a/tests/concurrent/skip_list_insert.cpp
+++ b/tests/concurrent/skip_list_insert.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <thread>
 #include <vector>

--- a/tests/concurrent/skip_list_insert_competitive.cpp
+++ b/tests/concurrent/skip_list_insert_competitive.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>
 #include <thread>
 #include <vector>
--- a/tests/concurrent/skip_list_mixed.cpp
+++ b/tests/concurrent/skip_list_mixed.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>
 #include <chrono>
 #include <random>
--- a/tests/concurrent/skip_list_remove.cpp
+++ b/tests/concurrent/skip_list_remove.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <thread>
 #include <vector>

--- a/tests/concurrent/skip_list_remove_competitive.cpp
+++ b/tests/concurrent/skip_list_remove_competitive.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>
 #include <thread>
 #include <vector>
--- a/tests/concurrent/spin_lock.cpp
+++ b/tests/concurrent/spin_lock.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>
 #include <chrono>
 #include <mutex>
--- a/tests/concurrent/stack.cpp
+++ b/tests/concurrent/stack.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>
 #include <chrono>
 #include <cstring>
--- a/tests/concurrent/storage_indices.cpp
+++ b/tests/concurrent/storage_indices.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <thread>
 #include <unordered_map>

--- a/tests/concurrent/storage_unique_constraints.cpp
+++ b/tests/concurrent/storage_unique_constraints.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <thread>

 #include <gtest/gtest.h>
--- a/tests/drivers/python/v4_1/docs_how_to_query.py
+++ b/tests/drivers/python/v4_1/docs_how_to_query.py
@@ -1,17 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-

-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import sys
 from neo4j import GraphDatabase, basic_auth

--- a/tests/drivers/python/v4_1/max_query_length.py
+++ b/tests/drivers/python/v4_1/max_query_length.py
@@ -1,17 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-

-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 from neo4j import GraphDatabase, basic_auth

 driver = GraphDatabase.driver("bolt://localhost:7687",
--- a/tests/drivers/python/v4_1/transactions.py
+++ b/tests/drivers/python/v4_1/transactions.py
@@ -1,17 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-

-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 from neo4j import GraphDatabase, basic_auth
 from neo4j.exceptions import ClientError, TransientError

--- a/tests/e2e/isolation_levels/isolation_levels.cpp
+++ b/tests/e2e/isolation_levels/isolation_levels.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>
 #include <mgclient.hpp>

--- a/tests/e2e/memgraph.py
+++ b/tests/e2e/memgraph.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import copy
 import os
 import subprocess
--- a/tests/e2e/memory/memory_control.cpp
+++ b/tests/e2e/memory/memory_control.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>
 #include <mgclient.hpp>

--- a/tests/e2e/memory/memory_limit_global_alloc.cpp
+++ b/tests/e2e/memory/memory_limit_global_alloc.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>
 #include <mgclient.hpp>

--- a/tests/e2e/memory/memory_limit_global_alloc_proc.cpp
+++ b/tests/e2e/memory/memory_limit_global_alloc_proc.cpp
@@ -1,16 +1,6 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>
 #include <mgclient.hpp>
+#include <algorithm>

 #include "utils/logging.hpp"
 #include "utils/timer.hpp"
--- a/tests/e2e/replication/common.hpp
+++ b/tests/e2e/replication/common.hpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <random>

--- a/tests/e2e/replication/constraints.cpp
+++ b/tests/e2e/replication/constraints.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <random>
 #include <thread>
--- a/tests/e2e/replication/read_write_benchmark.cpp
+++ b/tests/e2e/replication/read_write_benchmark.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <chrono>
 #include <fstream>
 #include <random>
--- a/tests/e2e/runner.py
+++ b/tests/e2e/runner.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 from argparse import ArgumentParser
 import atexit
 import logging
--- a/tests/e2e/streams/common.py
+++ b/tests/e2e/streams/common.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgclient
 import time

--- a/tests/e2e/streams/conftest.py
+++ b/tests/e2e/streams/conftest.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import pytest
 from kafka import KafkaProducer
 from kafka.admin import KafkaAdminClient, NewTopic
--- a/tests/e2e/streams/streams_owner_tests.py
+++ b/tests/e2e/streams/streams_owner_tests.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import sys
 import pytest
 import time
--- a/tests/e2e/streams/streams_tests.py
+++ b/tests/e2e/streams/streams_tests.py
@@ -1,16 +1,5 @@
 #!/usr/bin/python3

-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import sys
 import pytest
 import mgclient
--- a/tests/e2e/streams/transformations/transform.py
+++ b/tests/e2e/streams/transformations/transform.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgp


--- a/tests/e2e/temporal_types/roundtrip.cpp
+++ b/tests/e2e/temporal_types/roundtrip.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <variant>

 #include <gflags/gflags.h>
--- a/tests/e2e/triggers/common.cpp
+++ b/tests/e2e/triggers/common.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include "common.hpp"

 #include <chrono>
--- a/tests/e2e/triggers/common.hpp
+++ b/tests/e2e/triggers/common.hpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #pragma once

 #include <memory>
--- a/tests/e2e/triggers/on_create_triggers.cpp
+++ b/tests/e2e/triggers/on_create_triggers.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <string>
 #include <string_view>

--- a/tests/e2e/triggers/on_delete_triggers.cpp
+++ b/tests/e2e/triggers/on_delete_triggers.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <string>
 #include <string_view>
 #include <unordered_set>
--- a/tests/e2e/triggers/on_update_triggers.cpp
+++ b/tests/e2e/triggers/on_update_triggers.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <string>
 #include <string_view>

--- a/tests/e2e/triggers/privilige_check.cpp
+++ b/tests/e2e/triggers/privilige_check.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <string>
 #include <string_view>

--- a/tests/e2e/triggers/procedures/write.py
+++ b/tests/e2e/triggers/procedures/write.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgp

@mgp.write_proc
--- a/tests/e2e/write_procedures/common.py
+++ b/tests/e2e/write_procedures/common.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgclient
 import typing

--- a/tests/e2e/write_procedures/conftest.py
+++ b/tests/e2e/write_procedures/conftest.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import pytest

 from common import execute_and_fetch_all, connect
--- a/tests/e2e/write_procedures/procedures/read.py
+++ b/tests/e2e/write_procedures/procedures/read.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgp


--- a/tests/e2e/write_procedures/procedures/write.py
+++ b/tests/e2e/write_procedures/procedures/write.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import mgp


--- a/tests/e2e/write_procedures/simple_write.py
+++ b/tests/e2e/write_procedures/simple_write.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import typing
 import mgclient
 import sys
--- a/tests/gql_behave/environment.py
+++ b/tests/gql_behave/environment.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 import json
--- a/tests/gql_behave/run.py
+++ b/tests/gql_behave/run.py
@@ -1,17 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-

-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import os
 import sys
--- a/tests/gql_behave/steps/binary_tree.py
+++ b/tests/gql_behave/steps/binary_tree.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 from behave import given
--- a/tests/gql_behave/steps/database.py
+++ b/tests/gql_behave/steps/database.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 def query(q, context, params={}):
--- a/tests/gql_behave/steps/errors.py
+++ b/tests/gql_behave/steps/errors.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 from behave import then
--- a/tests/gql_behave/steps/graph.py
+++ b/tests/gql_behave/steps/graph.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 import database
--- a/tests/gql_behave/steps/parser.py
+++ b/tests/gql_behave/steps/parser.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-


--- a/tests/gql_behave/steps/query.py
+++ b/tests/gql_behave/steps/query.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 import database
--- a/tests/gql_behave/steps/test_parameters.py
+++ b/tests/gql_behave/steps/test_parameters.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 # -*- coding: utf-8 -*-

 import yaml
--- a/tests/gql_behave/tests/memgraph_V1/features/memgraph_wshortest.feature
+++ b/tests/gql_behave/tests/memgraph_V1/features/memgraph_wshortest.feature
@@ -40,10 +40,10 @@ Feature: Weighted Shortest Path
          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
          """
      Then the result should be:
-          | m.a | s | w |
-          | '1' | 1 | 1 |
-          | '2' | 2 | 3 |
-          | '3' | 1 | 4 |
+          | m.a | s | w   |
+          | '1' | 1 | 1.0 |
+          | '2' | 2 | 3.0 |
+          | '3' | 1 | 4.0 |

  Scenario: Test match wShortest single edge type filtered
      Given an empty graph
@@ -116,42 +116,4 @@ Feature: Weighted Shortest Path
          """
      Then an error should be raised

-  Scenario: Test match wShortest weight duration
-      Given an empty graph
-      And having executed:
-          """
-          CREATE (n {a:'0'})-[:r {w: DURATION('PT1S')}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
-          """
-      When executing query:
-          """
-          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
-          """
-      Then the result should be:
-          | m.a | s | w    |
-          | '1' | 1 | PT1S |
-          | '2' | 2 | PT3S |
-          | '3' | 1 | PT4S |

-  Scenario: Test match wShortest weight negative duration
-      Given an empty graph
-      And having executed:
-          """
-          CREATE (n {a:'0'})-[:r {w: DURATION({seconds: -1})}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
-          """
-      When executing query:
-          """
-          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
-          """
-      Then an error should be raised
-
-  Scenario: Test match wShortest weight mixed numeric and duration as weights
-      Given an empty graph
-      And having executed:
-          """
-          CREATE (n {a:'0'})-[:r {w: 2}]->({a:'1'})-[:r {w: DURATION('PT2S')}]->({a:'2'}), (n)-[:r {w: DURATION('PT4S')}]->({a:'3'})
-          """
-      When executing query:
-          """
-          MATCH (n {a:'0'})-[le *wShortest 10 (e, n | e.w ) w]->(m) RETURN m.a, size(le) as s, w
-          """
-      Then an error should be raised
--- a/tests/gql_behave/tests/stackoverflow_answers/features/wsp.feature
+++ b/tests/gql_behave/tests/stackoverflow_answers/features/wsp.feature
@@ -26,5 +26,5 @@ Feature: Queries related to all Stackoverflow questions related to WSP
      """
    Then the result should be:
      | hops        | total_weight |
-      |'1 -> 3 -> 4'| 17           |
+      |'1 -> 3 -> 4'| 17.0         |

--- a/tests/integration/audit/runner.py
+++ b/tests/integration/audit/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import atexit
 import csv
--- a/tests/integration/audit/tester.cpp
+++ b/tests/integration/audit/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>

 #include <json/json.hpp>
--- a/tests/integration/auth/checker.cpp
+++ b/tests/integration/auth/checker.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>

 #include "communication/bolt/client.hpp"
--- a/tests/integration/auth/runner.py
+++ b/tests/integration/auth/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import atexit
 import os
--- a/tests/integration/auth/tester.cpp
+++ b/tests/integration/auth/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>

 #include "communication/bolt/client.hpp"
--- a/tests/integration/durability/runner.py
+++ b/tests/integration/durability/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import atexit
 import os
--- a/tests/integration/ldap/runner.py
+++ b/tests/integration/ldap/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import atexit
 import os
--- a/tests/integration/ldap/tester.cpp
+++ b/tests/integration/ldap/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>
 #include <json/json.hpp>

--- a/tests/integration/mg_import_csv/runner.py
+++ b/tests/integration/mg_import_csv/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import atexit
 import os
--- a/tests/integration/mg_import_csv/tester.cpp
+++ b/tests/integration/mg_import_csv/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>

 #include "communication/bolt/client.hpp"
--- a/tests/integration/ssl/tester.cpp
+++ b/tests/integration/ssl/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <atomic>

 #include <gflags/gflags.h>
--- a/tests/integration/telemetry/client.cpp
+++ b/tests/integration/telemetry/client.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <gflags/gflags.h>

 #include "requests/requests.hpp"
--- a/tests/integration/telemetry/runner.py
+++ b/tests/integration/telemetry/runner.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import json
 import os
--- a/tests/integration/telemetry/server.py
+++ b/tests/integration/telemetry/server.py
@@ -1,16 +1,4 @@
 #!/usr/bin/python3 -u
-
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import argparse
 import json
 import os
--- a/tests/integration/transactions/tester.cpp
+++ b/tests/integration/transactions/tester.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <iostream>

 #include <gflags/gflags.h>
--- a/tests/macro_benchmark/clients.py
+++ b/tests/macro_benchmark/clients.py
@@ -1,14 +1,3 @@
-# Copyright 2021 Memgraph Ltd.
-#
-# Use of this software is governed by the Business Source License
-# included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-# License, and you may not use this file except in compliance with the Business Source License.
-#
-# As of the Change Date specified in that file, in accordance with
-# the Business Source License, use of this software will be governed
-# by the Apache License, Version 2.0, included in the file
-# licenses/APL.txt.
-
 import logging
 import os
 import time
--- a/tests/macro_benchmark/clients/bfs_pokec_client.cpp
+++ b/tests/macro_benchmark/clients/bfs_pokec_client.cpp
@@ -1,14 +1,3 @@
-// Copyright 2021 Memgraph Ltd.
-//
-// Use of this software is governed by the Business Source License
-// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
-// License, and you may not use this file except in compliance with the Business Source License.
-//
-// As of the Change Date specified in that file, in accordance with
-// the Business Source License, use of this software will be governed
-// by the Apache License, Version 2.0, included in the file
-// licenses/APL.txt.
-
 #include <array>
 #include <chrono>
 #include <fstream>
--- a/Show More
+++ b/Show More
Author	SHA1	Message	Date
kostas kyrimis	138dcd5978	kostas test case	2021-10-22 11:39:50 +00:00
Antonio Andelic	9a7d4ce9bc	Cleaning up	2021-10-22 11:05:43 +02:00
Antonio Andelic	f25eeb0edf	Solution with rebalance	2021-10-22 10:50:02 +02:00
Antonio Andelic	a793bc2a7f	Remove manually settings offset	2021-10-21 14:12:56 +02:00
Antonio Andelic	63bf7f90f3	Use seek for going back in time	2021-10-21 14:10:34 +02:00
kostas kyrimis	bf83ede252	wip	2021-10-21 07:54:34 +00:00
kostas kyrimis	540188e643	wip	2021-10-19 19:26:26 +00:00