Stanford InfoLab Publication Server

Validating Constraints with Partial Information: Research Overview

Widom, J. and Gupta, A. and Sagiv, Y. and Ullman, J. (1994) Validating Constraints with Partial Information: Research Overview. Technical Report. Stanford InfoLab. (Publication Note: Appeared in Fifth International Workshop on the Deductive Approach to Information Systems and Databases. September 19-21, 1994, Aiguablava, Costa Brava, Catalonia (DAISD 1994); invited paper, similar material appears in PODS '94 paper by same AUTHORS)




We are interested in the problem of validating the consistency of integrity constraints when data is modified. In particular, we consider how constraints can be checked with only "partial information". Partial information may include: (1) the constraint specifications only, (2) the constraint specifications and the modified data, or (3) the constraint specifications, the modified data, and portions of the existing data. Methods for constraint checking with partial information can be much more effcient than traditional constraint checking methods (e.g. because work is done at compile time, or because less data is Partial information methods also enable constraint checking in where traditional constraint checking methods fail (e.g. in distributed environments where not all data is We explain how existing methods and results for query containment and for independence can be applied to problems (1) and (2) above, and we give an overview of our research into problem

Item Type:Techreport (Technical Report)
Additional Information:Appeared in DAISD '94; invited paper, similar material appears in PODS '94 paper by same AUTHORS
Uncontrolled Keywords:integrity
Subjects:Computer Science > Data Integration and Mediation
Projects:Information Integration
Related URLs:Project Homepage
ID Code:55
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:05 Feb 2009 15:52

Download statistics

Repository Staff Only: item control page