memgraph/tests/integration/hardcoded_query/clique.hpp

#include <algorithm>
#include <bitset>
#include <iostream>
#include <string>

#include "query/backend/cpp/typed_value.hpp"
#include "query/plan_interface.hpp"
#include "storage/edge_accessor.hpp"
#include "storage/vertex_accessor.hpp"
#include "using.hpp"
#include "utils/assert.hpp"

using std::cout;
using std::endl;

// General Query: MATCH
//  (a:garment)-[:default_outfit]-(b:garment)-[:default_outfit]-(c:garment)-[:default_outfit]-(d:garment)-[:default_outfit]-(a:garment)-[:default_outfit]-(c:garment),
//  (b:garment)-[:default_outfit]-(d:garment), (e:profile {profile_id: 112,
//  partner_id: 55})-[s1:score]-(a:garment),(e:profile {profile_id: 112,
//  partner_id: 55})-[s2:score]-(b:garment), (e:profile {profile_id: 112,
//  partner_id: 55})-[s3:score]-(c:garment), (e:profile {profile_id: 112,
//  partner_id: 55})-[s4:score]-(d:garment) WHERE a.garment_id=1234 RETURN
//  a.garment_id,b.garment_id,c.garment_id,d.garment_id,
//  s1.score+s2.score+s3.score+s4.score ORDER BY
//  s1.score+s2.score+s3.score+s4.score DESC LIMIT 10

template <typename TStore>
/**
 * Bitset data structure with a number of bits provided in constructor.
 * @tparam type of underlying bit storage: int32, int64, char, etc.
 */
class Bitset {
 public:
  /**
   *  Create bitset.
   *  @param sz size of bitset
   */
  Bitset(size_t sz) : block_size_(8 * sizeof(TStore)) {
    if (sz % block_size_ != 0) sz += block_size_;
    blocks_.resize(sz / block_size_);
  }
  /**
   *  Set bit to one.
   *  @param idx position of bit.
   */
  void Set(int idx) {
    debug_assert(idx < static_cast<int64_t>(blocks_.size()) * block_size_,
                 "Invalid bit location.");
    int bucket = idx / block_size_;
    blocks_[bucket] |= TStore(1) << idx % block_size_;
  }
  /**
   *  Return bit at position.
   *  @param idx position of bit.
   *  @return 1/0.
   */
  bool At(int idx) const {
    debug_assert(idx < static_cast<int64_t>(blocks_.size()) * block_size_,
                 "Invalid bit location.");
    int bucket = idx / block_size_;
    return (blocks_[bucket] >> (idx % block_size_)) & 1;
  }
  /**
   *  Intersect two bitsets
   *  @param other bitset.
   *  @return intersection.
   */
  Bitset<TStore> Intersect(const Bitset<TStore> &other) {
    debug_assert(this->blocks_.size() == other.blocks_.size(),
                 "Bitsets are not of equal size.");
    Bitset<TStore> ret(this->blocks_.size() * this->block_size_);
    for (int i = 0; i < (int)this->blocks_.size(); ++i) {
      ret.blocks_[i] = this->blocks_[i] & other.blocks_[i];
      continue;
    }
    return ret;
  }
  /**
   *  Positions of bits set to 1.
   *  @return positions of bits set to 1.
   */
  std::vector<int> Ones() const {
    std::vector<int> ret;
    int ret_idx = 0;
    for (auto x : blocks_) {
      while (x) {
        auto pos = CountTrailingZeroes(x & -x);
        x -= x & -x;
        ret.push_back(ret_idx + pos);
      }
      ret_idx += block_size_;
    }
    return ret;
  }

 private:
  /**
   * Calculate number of trailing zeroes in a binary number, usually a power
   * of two.
   * @return number of trailing zeroes.
   */
  size_t CountTrailingZeroes(TStore v) const {
    size_t ret = 0;
    while (v >> 32) ret += 32, v >>= 32;
    if (v >> 16) ret += 16, v >>= 16;
    if (v >> 8) ret += 8, v >>= 8;
    if (v >> 4) ret += 4, v >>= 4;
    if (v >> 2) ret += 2, v >>= 2;
    if (v >> 1) ret += 1, v >>= 1;
    return ret;
  }
  std::vector<TStore> blocks_;
  const size_t block_size_;
};

enum CliqueQuery { SCORE_AND_LIMIT, FIND_ALL };

bool run_general_query(GraphDbAccessor &db_accessor,
                       const PropertyValueStore<> &args, Stream &stream,
                       enum CliqueQuery query_type) {
  if (query_type == CliqueQuery::FIND_ALL)
    stream.write_fields(
        {"a.garment_id", "b.garment_id", "c.garment_id", "d.garment_id"});
  else
    stream.write_fields({"a.garment_id", "b.garment_id", "c.garment_id",
                         "d.garment_id", "score"});
  std::vector<VertexAccessor> vertices = db_accessor.vertices();
  std::vector<EdgeAccessor> edges = db_accessor.edges();

  std::vector<VertexAccessor *> vertices_indexed;
  std::vector<EdgeAccessor *> edges_indexed;

  int profile_index = -1;
  for (int i = 0; i < (int)vertices.size(); ++i) {
    if (vertices[i].has_label(db_accessor.label("garment")))
      vertices_indexed.push_back(&vertices[i]);
    if (query_type == CliqueQuery::SCORE_AND_LIMIT &&
        vertices[i].has_label(db_accessor.label("profile"))) {
      auto has_prop =
          vertices[i].PropsAt(db_accessor.property("profile_id")) == args.at(0);
      if (has_prop.type() == TypedValue::Type::Null) continue;
      if (has_prop.Value<bool>() == false) continue;
      has_prop =
          vertices[i].PropsAt(db_accessor.property("partner_id")) == args.at(1);
      if (has_prop.type() == TypedValue::Type::Null) continue;
      if (has_prop.Value<bool>() == false) continue;
      profile_index = i;
    }
  }
  for (int i = 0; i < (int)edges.size(); ++i) {
    if (edges[i].edge_type() == db_accessor.edge_type("default_outfit") ||
        edges[i].edge_type() == db_accessor.edge_type("score"))
      edges_indexed.push_back(&edges[i]);
  }
  const int n = vertices_indexed.size();
  auto cmp_vertex = [](const VertexAccessor *a, const VertexAccessor *b)
                        -> bool { return *a < *b; };
  auto cmp_edge = [](const EdgeAccessor *a, const EdgeAccessor *b) -> bool {
    if (a->from() != b->from()) return a->from() < b->from();
    return a->to() < b->to();
  };
  /**
   * Index of vertex in a list of vertices_indexed.
   * @param v VertexAccessor to a vertex.
   * @return position of vertex or -1 if it doesn't exist.
   */
  auto query =
      [&vertices_indexed, &cmp_vertex](const VertexAccessor &v) -> int {
        int pos = lower_bound(vertices_indexed.begin(), vertices_indexed.end(),
                              &v, cmp_vertex) -
                  vertices_indexed.begin();
        if (pos == (int)vertices_indexed.size() || *vertices_indexed[pos] != v)
          return -1;
        return pos;
      };
  /**
   * Update bitset of neighbours. Set bit to 1 for index of every vertex
   * endpoint of edges with type default_outfit.
   * @param bitset bitset to update.
   * @param edges edges from which to update bitset.
   */
  auto update = [&db_accessor, &query](Bitset<int64_t> &bitset,
                                       const std::vector<EdgeAccessor> &edges) {
    for (auto e : edges) {
      if (e.edge_type() != db_accessor.edge_type("default_outfit")) continue;
      const int from = query(e.from());
      const int to = query(e.to());
      if (from == -1 || to == -1) continue;
      bitset.Set(from);
      bitset.Set(to);
    }
  };
  std::sort(vertices_indexed.begin(), vertices_indexed.end(), cmp_vertex);
  std::sort(edges_indexed.begin(), edges_indexed.end(), cmp_edge);
  std::vector<Bitset<int64_t>> connected;
  for (int i = 0; i < n; ++i) {
    Bitset<int64_t> connected_to(n);
    update(connected_to, vertices_indexed[i]->in());
    update(connected_to, vertices_indexed[i]->out());
    connected.push_back(connected_to);
  }
  std::vector<std::vector<int>> results;
  for (int i = 0; i < n; ++i) {
    const VertexAccessor v = *vertices_indexed[i];
    auto cmp_res = v.PropsAt(db_accessor.property("garment_id")) ==
                   args.at(query_type == CliqueQuery::SCORE_AND_LIMIT ? 8 : 0);
    if (cmp_res.type() != TypedValue::Type::Bool) continue;
    if (cmp_res.Value<bool>() != true) continue;
    auto neigh = connected[i].Ones();
    for (int j : neigh) {
      if (j == i) continue;
      for (int k : connected[j].Intersect(connected[i]).Ones()) {
        if (k == i) continue;
        if (k == j) continue;
        Bitset<int64_t> intersection = connected[j].Intersect(connected[k]);
        for (int l : intersection.Ones()) {
          if (l == i) continue;
          if (l == j) continue;
          if (l == k) continue;
          if (connected[l].At(i) == false) continue;
          results.push_back({i, j, k, l});
        }
      }
    }
  }
  /**
   * Get edge index of edge associated with two vertices.
   * @param first one vertex endpoint
   * @param second other vertex endpoint
   * @return EdgeAccessor* if it exists, nullptr otherwise.
   */
  auto get_edge = [&edges_indexed](
                      const VertexAccessor &first,
                      const VertexAccessor &second) -> EdgeAccessor *{
    auto cmp_edge_to_pair =
        [](const EdgeAccessor *edge,
           const pair<const VertexAccessor *, const VertexAccessor *> &e)
            -> bool {
              if (edge->from() != *e.first) return edge->from() < *e.first;
              if (edge->to() != *e.second) return edge->to() < *e.second;
              return false;
            };
    auto pos = lower_bound(edges_indexed.begin(), edges_indexed.end(),
                           std::make_pair(&first, &second), cmp_edge_to_pair) -
               edges_indexed.begin();
    if (pos != (int)edges_indexed.size() &&
        edges_indexed[pos]->from() == first &&
        edges_indexed[pos]->to() == second)
      return edges_indexed[pos];
    pos = lower_bound(edges_indexed.begin(), edges_indexed.end(),
                      std::make_pair(&second, &first), cmp_edge_to_pair) -
          edges_indexed.begin();
    if (pos != (int)edges_indexed.size() &&
        edges_indexed[pos]->from() == second &&
        edges_indexed[pos]->to() == first)
      return edges_indexed[pos];
    debug_assert(false, "Edge doesn't exist.");
    return nullptr;
  };

  /**
   * Calculate score of clique by profile_index if it exists.
   * @param V index of clique vertices in vertices_indexed.
   * @return score if profile_index exists, else 0.
   */
  auto calc_score =
      [&db_accessor, &vertices, &profile_index, &vertices_indexed, &get_edge](
          const std::vector<int> &V) -> int {
        int res = 0;
        if (profile_index == -1) return 0;
        for (auto x : V) {
          auto edge = get_edge(vertices[profile_index], *vertices_indexed[x]);
          if (edge == nullptr) continue;
          auto prop = TypedValue(edge->PropsAt(db_accessor.property("score")));
          if (prop.type() == TypedValue::Type::Int) res += prop.Value<int>();
        }
        return res;
      };
  if (query_type == CliqueQuery::SCORE_AND_LIMIT) {
    auto cmp_results = [&calc_score](const std::vector<int> &first,
                                     const std::vector<int> &second) {
      return calc_score(first) < calc_score(second);
    };
    sort(results.begin(), results.end(), cmp_results);
    reverse(results.begin(), results.end());
  }
  const int limit = query_type == CliqueQuery::SCORE_AND_LIMIT
                        ? args.at((int)args.size() - 1).Value<int>()
                        : (int)results.size();
  for (int i = 0; i < std::min(limit, (int)results.size()); ++i) {
    stream.write_record();
    stream.write_list_header(query_type == CliqueQuery::SCORE_AND_LIMIT ? 5
                                                                        : 4);
    for (auto x : results[i]) {
      stream.write(vertices_indexed[x]
                       ->PropsAt(db_accessor.property("garment_id"))
                       .Value<int>());
    }
    if (query_type == CliqueQuery::SCORE_AND_LIMIT)
      stream.write(calc_score(results[i]));
  }
  stream.write_meta("r");
  db_accessor.transaction_.commit();
  return true;
}