Research about the novel Denial Constraint mathematical formalism for database integrity constraint representation, which generalizes a vast set of previous rules like Uniqueness constraints or Functional Dependencies.My contributions are divided in three yet to be published papers:-A first one detailing how the current state of the art algorithms yield invalid results due to an erroneous definition of Denial Constraint validity. A qualitative and quantitative approach is taken to show how these algorithms are both theoretically and practically unsuccessful in only generating valid constraints of the data.-A second one proposing a solution to the presented theoretical issues by generalizing the concept of DC triviality, and defining new validity metrics that use this theoretical foundation to solve the practical erros in DC discovery.-A third paper showcasing how this new definition of DC Validity may be used to significantly speed up the process of DC Discovery and Validation, reducing the number of tuple pairs required to scan to accept a DC as Valid from potentially trillions to only thousands, all while presenting practical results showcasing how this algorithm only accepts valid Denial Constraints.

Private tutoring of Maths, Industrial Technology, Chemistry, Physics and Biology for adolescents and young adults between the ages 15-20.