Affiliation:
1. Universidad Politécnica de Valencia, Spain
2. Free University of Bozen/Bolzano, Italy
Abstract
Integrity constraints (or simply “constraints”) are formal representations of invariant conditions for the semantic correctness of database records. Constraints can be expressed in declarative languages such as datalog, predicate logic, or SQL. This article highlights the historical background of integrity constraints and the essential features of their simplified incremental evaluation. It concludes with an outlook on future trends.
Reference49 articles.
1. Aldana, J., Yagüe, I., & Gómez, L. (2002). Integrity issues in the Web: Beyond distributed databases. In J. Doorn & L. Rivero (Eds.), Database integrity: Challenges and solutions (pp. 293-321). Hershey, PA: Idea Group Publishing.
2. Armstrong, W. (1974). Dependency structures of database relationships. In J. L. Rosenfeld (Ed.), Proceedings of IFIP ’74 (pp. 580-583). Stockholm, Sweden: North-Holland.
3. Bernstein, P., & Blaustein, B. (1982). Fast methods for testing quantified relational calculus assertions. In M. Schkolnick (Ed.), Proceedings of SIGMOD’82 (pp. 39-50). Orlando, FL: ACM Press.
4. Bernstein, P., Blaustein, B., & Clarke, E. (1980). Fast maintenance of semantic integrity assertions using redundant aggregate data. In W. W. Armstrong et al. (Eds.), Proceedings of the Sixth VLDB (pp. 126-136). Montreal: IEEE-CS.
5. Consistent query answering in databases