Constraint checking with partial information

95Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Constraints are a valuable tool for managing information across multiple databases, as well as for general purposes of assuring data integrity. However, efficient implementation of constraint checking is difficult. In this paper we explore techniques for assuring constraint satisfaction without performing a complete evaluation of the constraints. We consider methods that use only constraints definitions, methods that use constraints and updates, and methods that use constraints, updates, and 'local' data.

Cite

CITATION STYLE

APA

Gupta, A., Sagiv, Y., Ullman, H. D., & Widom, J. (1994). Constraint checking with partial information. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 45–55). Publ by ACM. https://doi.org/10.1145/182591.182597

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free