Discovering denial constraints

Xu Chu, Ihab F. Ilyas, Paolo Papotti

Research output: Chapter in Book/Report/Conference proceedingChapter

63 Citations (Scopus)

Abstract

Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, an American citizen cannot have lower salary and higher tax rate than another citizen in the same state. In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs). DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios. We lay out theoretical and practical foundations for DCs, including a set of sound inference rules and a linear algorithm for implication testing. We then develop an efficient instance-driven DC discovery algorithm and propose a novel scoring function to rank DCs for user validation. Using real-world and synthetic datasets, we experimentally evaluate scalability and effectiveness of our solution.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
Pages1498-1509
Number of pages12
Volume6
Edition13
Publication statusPublished - Aug 2013

Fingerprint

Wages
Taxation
Scalability
Semantics
Acoustic waves
Testing
Industry

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Chu, X., Ilyas, I. F., & Papotti, P. (2013). Discovering denial constraints. In Proceedings of the VLDB Endowment (13 ed., Vol. 6, pp. 1498-1509)

Discovering denial constraints. / Chu, Xu; Ilyas, Ihab F.; Papotti, Paolo.

Proceedings of the VLDB Endowment. Vol. 6 13. ed. 2013. p. 1498-1509.

Research output: Chapter in Book/Report/Conference proceedingChapter

Chu, X, Ilyas, IF & Papotti, P 2013, Discovering denial constraints. in Proceedings of the VLDB Endowment. 13 edn, vol. 6, pp. 1498-1509.
Chu X, Ilyas IF, Papotti P. Discovering denial constraints. In Proceedings of the VLDB Endowment. 13 ed. Vol. 6. 2013. p. 1498-1509
Chu, Xu ; Ilyas, Ihab F. ; Papotti, Paolo. / Discovering denial constraints. Proceedings of the VLDB Endowment. Vol. 6 13. ed. 2013. pp. 1498-1509
@inbook{708b5b6b1931408cace99ba0709dbf35,
title = "Discovering denial constraints",
abstract = "Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, an American citizen cannot have lower salary and higher tax rate than another citizen in the same state. In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs). DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios. We lay out theoretical and practical foundations for DCs, including a set of sound inference rules and a linear algorithm for implication testing. We then develop an efficient instance-driven DC discovery algorithm and propose a novel scoring function to rank DCs for user validation. Using real-world and synthetic datasets, we experimentally evaluate scalability and effectiveness of our solution.",
author = "Xu Chu and Ilyas, {Ihab F.} and Paolo Papotti",
year = "2013",
month = "8",
language = "English",
volume = "6",
pages = "1498--1509",
booktitle = "Proceedings of the VLDB Endowment",
edition = "13",

}

TY - CHAP

T1 - Discovering denial constraints

AU - Chu, Xu

AU - Ilyas, Ihab F.

AU - Papotti, Paolo

PY - 2013/8

Y1 - 2013/8

N2 - Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, an American citizen cannot have lower salary and higher tax rate than another citizen in the same state. In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs). DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios. We lay out theoretical and practical foundations for DCs, including a set of sound inference rules and a linear algorithm for implication testing. We then develop an efficient instance-driven DC discovery algorithm and propose a novel scoring function to rank DCs for user validation. Using real-world and synthetic datasets, we experimentally evaluate scalability and effectiveness of our solution.

AB - Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, an American citizen cannot have lower salary and higher tax rate than another citizen in the same state. In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs). DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios. We lay out theoretical and practical foundations for DCs, including a set of sound inference rules and a linear algorithm for implication testing. We then develop an efficient instance-driven DC discovery algorithm and propose a novel scoring function to rank DCs for user validation. Using real-world and synthetic datasets, we experimentally evaluate scalability and effectiveness of our solution.

UR - http://www.scopus.com/inward/record.url?scp=84891066910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891066910&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:84891066910

VL - 6

SP - 1498

EP - 1509

BT - Proceedings of the VLDB Endowment

ER -