FastADC is a solution for approximate Denial Constraint (DC) discovery. Given an instance of a relational schema and an error threshold, FastADC efficiently computes the set of all minimal approximate DCs.
- Java 11 or later
- Maven 3.1.0 or later
After building the project with maven, it is already runnable with a simple example. This example takes as input the dataset airport.csv with error threshold 0.01, computes its approximate DCs, and outputs relevant information including the number of approximate DCs and running time.
Most parameters and configures related to our experiment are in Main.java. Some of the most pertinent ones are listed here, and please refer to the code and comments for further detail.
fp: file path of input datasetthreshold: error threshold of approximate DCs, within [0,1]rowLimit: limit the number of tuples from the input dataset, -1 means no limitshardLenght: the shard length during evidence set construction
For experiments concerning the number of threads, it is recommended to disable/enable available processors from system level.
FastADC are compared to other two approximate DC discovery methods, DCFinder and ADCMiner. The source code of DCFinder can be found here. And we implement ADCMiner with our best effort here.
FastADC is released under the Apache 2.0 license. Some source code is imported from DCFinder, which is also under Apache 2.0 license.