Constraint checking with partial information

Ashish Gupta*, Yehoshua Sagiv, Heffrey D. Ullman, Jennifer Widom

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

95 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
PublisherPubl by ACM
Pages45-55
Number of pages11
ISBN (Print)0897916425, 9780897916424
DOIs
StatePublished - 1994
Externally publishedYes
EventProceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Minneapolis, MN, USA
Duration: 24 May 199426 May 1994

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

ConferenceProceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityMinneapolis, MN, USA
Period24/05/9426/05/94

Fingerprint

Dive into the research topics of 'Constraint checking with partial information'. Together they form a unique fingerprint.

Cite this