Skip to content

Commit

Permalink
Implement efficient GFD validation algorithm
Browse files Browse the repository at this point in the history
The algorithm checking the satisfiability of GFD.
Uses CPI algorithm as a subgraph search.
  • Loading branch information
AntonChern committed Jan 21, 2024
1 parent 0430367 commit 8880e8c
Show file tree
Hide file tree
Showing 4 changed files with 1,073 additions and 4 deletions.
14 changes: 10 additions & 4 deletions src/core/algorithms/algorithm_types.h
Original file line number Diff line number Diff line change
Expand Up @@ -6,10 +6,11 @@

namespace algos {

using AlgorithmTypes =
std::tuple<Depminer, DFD, FastFDs, FDep, Fd_mine, Pyro, Tane, FUN, hyfd::HyFD, Aid, Apriori,
metric::MetricVerifier, DataStats, fd_verifier::FDVerifier, HyUCC, PyroUCC,
cfd::FDFirstAlgorithm, ACAlgorithm, UCCVerifier, Faida, GfdValidation>;
using AlgorithmTypes = std::tuple<Depminer, DFD, FastFDs, FDep, Fd_mine, Pyro, Tane, FUN,
hyfd::HyFD, Aid, Apriori, metric::MetricVerifier, DataStats,
fd_verifier::FDVerifier, HyUCC, PyroUCC, cfd::FDFirstAlgorithm,
ACAlgorithm, UCCVerifier, Faida, GfdValidation, EGfdValidation>;

// clang-format off
/* Enumeration of all supported non-pipeline algorithms. If you implement a new
* algorithm please add its corresponding value to this enum and to the type
Expand Down Expand Up @@ -61,8 +62,13 @@ BETTER_ENUM(AlgorithmType, char,
=======

/* Graph functional dependency mining algorithms */
<<<<<<< HEAD
gfdvalid
>>>>>>> Implement baseline GFD validation algorithm
=======
gfdvalid,
egfdvalid
>>>>>>> Implement efficient GFD validation algorithm
)
// clang-format on

Expand Down
1 change: 1 addition & 0 deletions src/core/algorithms/algorithms.h
Original file line number Diff line number Diff line change
Expand Up @@ -39,4 +39,5 @@
#include "algorithms/ind/faida/faida.h"

/* Graph functional dependency mining algorithms */
#include "algorithms/gfd/egfd_validation.h"
#include "algorithms/gfd/gfd_validation.h"
Loading

0 comments on commit 8880e8c

Please sign in to comment.