memgraph/tests/benchmark/data_structures_find.cpp

// Copyright 2022 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 <concepts>
#include <cstddef>
#include <cstdint>
#include <exception>
#include <map>
#include <set>
#include <stdexcept>
#include <type_traits>
#include <vector>

#include <benchmark/benchmark.h>
#include <gflags/gflags.h>

#include "btree_map.hpp"
#include "skip_list_common.hpp"
#include "storage/v3/key_store.hpp"
#include "storage/v3/lexicographically_ordered_vertex.hpp"
#include "storage/v3/mvcc.hpp"
#include "storage/v3/property_value.hpp"
#include "storage/v3/transaction.hpp"
#include "storage/v3/vertex.hpp"
#include "utils/skip_list.hpp"

namespace memgraph::benchmark {

///////////////////////////////////////////////////////////////////////////////
// Testing Find Operation
///////////////////////////////////////////////////////////////////////////////
static void BM_BenchmarkFindSkipList(::benchmark::State &state) {
  utils::SkipList<storage::v3::LexicographicallyOrderedVertex> skip_list;
  coordinator::Hlc start_timestamp;
  storage::v3::IsolationLevel isolation_level{storage::v3::IsolationLevel::SNAPSHOT_ISOLATION};
  storage::v3::Transaction transaction{start_timestamp, isolation_level};
  auto *delta = storage::v3::CreateDeleteObjectDelta(&transaction);
  for (auto i{0}; i < state.range(0); ++i) {
    auto acc = skip_list.access();
    acc.insert({storage::v3::Vertex(delta, std::vector<storage::v3::PropertyValue>{storage::v3::PropertyValue{i}})});
  }
  // So we can also have elements that does don't exist
  std::mt19937 i_generator(std::random_device{}());
  std::uniform_int_distribution<int64_t> i_distribution(0, state.range(0) * 2);
  int64_t found_elems{0};
  for (auto _ : state) {
    for (auto i{0}; i < state.range(0); ++i) {
      int64_t value = i_distribution(i_generator);
      auto acc = skip_list.access();
      if (acc.find(storage::v3::PrimaryKey{{storage::v3::PropertyValue(value)}}) != acc.end()) {
        found_elems++;
      }
    }
  }
  state.SetItemsProcessed(found_elems);
}

static void BM_BenchmarkFindStdMap(::benchmark::State &state) {
  std::map<storage::v3::PrimaryKey, storage::v3::LexicographicallyOrderedVertex> std_map;
  coordinator::Hlc start_timestamp;
  storage::v3::IsolationLevel isolation_level{storage::v3::IsolationLevel::SNAPSHOT_ISOLATION};
  storage::v3::Transaction transaction{start_timestamp, isolation_level};
  auto *delta = storage::v3::CreateDeleteObjectDelta(&transaction);
  for (auto i{0}; i < state.range(0); ++i) {
    std_map.insert({storage::v3::PrimaryKey{storage::v3::PropertyValue{i}},
                    storage::v3::LexicographicallyOrderedVertex{storage::v3::Vertex{
                        delta, std::vector<storage::v3::PropertyValue>{storage::v3::PropertyValue{i}}}}});
  }
  // So we can also have elements that does don't exist
  std::mt19937 i_generator(std::random_device{}());
  std::uniform_int_distribution<int64_t> i_distribution(0, state.range(0) * 2);
  int64_t found_elems{0};
  for (auto _ : state) {
    for (auto i{0}; i < state.range(0); ++i) {
      int64_t value = i_distribution(i_generator);
      if (std_map.find(storage::v3::PrimaryKey{{storage::v3::PropertyValue(value)}}) != std_map.end()) {
        found_elems++;
      }
    }
  }
  state.SetItemsProcessed(found_elems);
}

static void BM_BenchmarkFindStdSet(::benchmark::State &state) {
  std::set<storage::v3::LexicographicallyOrderedVertex> std_set;
  coordinator::Hlc start_timestamp;
  storage::v3::IsolationLevel isolation_level{storage::v3::IsolationLevel::SNAPSHOT_ISOLATION};
  storage::v3::Transaction transaction{start_timestamp, isolation_level};
  auto *delta = storage::v3::CreateDeleteObjectDelta(&transaction);
  for (auto i{0}; i < state.range(0); ++i) {
    std_set.insert(storage::v3::LexicographicallyOrderedVertex{
        storage::v3::Vertex{delta, std::vector<storage::v3::PropertyValue>{storage::v3::PropertyValue{i}}}});
  }
  // So we can also have elements that does don't exist
  std::mt19937 i_generator(std::random_device{}());
  std::uniform_int_distribution<int64_t> i_distribution(0, state.range(0) * 2);
  int64_t found_elems{0};
  for (auto _ : state) {
    for (auto i{0}; i < state.range(0); ++i) {
      int64_t value = i_distribution(i_generator);
      if (std_set.find(storage::v3::LexicographicallyOrderedVertex{storage::v3::Vertex{
              delta, storage::v3::PrimaryKey{storage::v3::PropertyValue{value}}}}) != std_set.end()) {
        found_elems++;
      }
    }
  }
  state.SetItemsProcessed(found_elems);
}

static void BM_BenchmarkFindBppTree(::benchmark::State &state) {
  tlx::btree_map<storage::v3::PrimaryKey, storage::v3::LexicographicallyOrderedVertex> bpp_tree;
  coordinator::Hlc start_timestamp;
  storage::v3::IsolationLevel isolation_level{storage::v3::IsolationLevel::SNAPSHOT_ISOLATION};
  storage::v3::Transaction transaction{start_timestamp, isolation_level};
  auto *delta = storage::v3::CreateDeleteObjectDelta(&transaction);
  for (auto i{0}; i < state.range(0); ++i) {
    bpp_tree.insert({storage::v3::PrimaryKey{storage::v3::PropertyValue{i}},
                     storage::v3::LexicographicallyOrderedVertex{storage::v3::Vertex{
                         delta, std::vector<storage::v3::PropertyValue>{storage::v3::PropertyValue{i}}}}});
  }
  // So we can also have elements that does don't exist
  std::mt19937 i_generator(std::random_device{}());
  std::uniform_int_distribution<int64_t> i_distribution(0, state.range(0) * 2);
  int64_t found_elems{0};
  for (auto _ : state) {
    for (auto i{0}; i < state.range(0); ++i) {
      int64_t value = i_distribution(i_generator);
      if (bpp_tree.find(storage::v3::PrimaryKey{{storage::v3::PropertyValue(value)}}) != bpp_tree.end()) {
        found_elems++;
      }
    }
  }
  state.SetItemsProcessed(found_elems);
}

BENCHMARK(BM_BenchmarkFindSkipList)->Arg(1000);

BENCHMARK(BM_BenchmarkFindStdMap)->Arg(1000);

BENCHMARK(BM_BenchmarkFindStdSet)->Arg(1000);

BENCHMARK(BM_BenchmarkFindBppTree)->Arg(1000);

}  // namespace memgraph::benchmark

BENCHMARK_MAIN();