Abstract: Example aspects include techniques for improved constraint discovery on relational data. These techniques may include constructing a first layer of a lattice using a first plurality of candidate denial constraints (DC) each having a first number of predicates. In addition, the techniques may include performing a tree-based verification process on the first layer of the lattice to determine one or more verified DCs confirmed to be DCs and a plurality of unverified DCs that are not confirmed to be DCs. Further, the techniques may include presenting, via a graphical user interface (GUI), DC information based on the one or more verified DC, and generating, for construction of a second layer of the lattice to be evaluated via the tree-based verification process, a second plurality of candidate DCs by combining the plurality of unverified DCs.