Prof. Dr. Felix Naumann

Repeatability - DCs

This is a repeatability page for DC discovery algorithms. The algorithms are provided in the state their results have been published, but they may not represent the most recent version of their implementations.

DC Algorithms

The efficient discovery of denial constraints in tables is a challenging task. So far, our group has developed two DC discovey algorithms:

  • We have released a hybrid DC discovery algorithm Hydra, which is available as part of the metanome-algorithms respository.
  • Our most recent addition to the family of DC discovery algorithm is a new approximate DC discovery algorithm DCFinder, which is also available as part of the metanome-algorithms respository.

The data profiling tool Metanome provides standardized interfaces to facilitate the comparison of different DC discovery methods.



Our DC algorithms have been exhaustively tested on the following datasets (please also see here for some of the files):

Adultuci1532,5613.5 MB
AirportAirport1855,1137.3 MB
Flightbts.gov20500.00071 MB
Hospitalhttps://data.medicare.gov/15114,91930.6 MB
Inspectionhttps://data.cityofchicago.org/19170,000192.6 MB
ncvoterncsbe.gov22938.085191.4 MB
Stockhttp://pages.swcp.com/stocks/7122,4965.3 MB
Taxhttp://da.qcri.org/15100,0007.5 MB
TaxTax generator by Xu Chu151,000,00073 MB