Abstract
Given some integrity constraints over a distributed database, we consider the problem of incrementally checking global consistency in response to updates made to the base relations but without accessing all these base relations. In many application areas such as collaborative design, mobile computing and enterprise information systems, total data availability cannot be assumed. Even if all the base data is available, some of it may incur such a high cost that its use should only be considered as a last resort. Without looking at all the relations that participate in the constraint, how can one meaningfully check a constraint for violation? When the constraint is known to be satisfied prior to the update, the state of the relations that are available (aka local) can in principle be used to infer something about the relations that are not available (aka remote). This observation is the basis for the existence of tests that guarantee that global consistency is preserved under a given update, without looking at all the base data. In order to make consistency maintenance practical, the challenge is to find those tests that are most general (we call Complete Local Tests) and that are efficient to generate and execute. This paper addresses the problem of finding efficient complete local tests for an important class of constraints that are very common in practice: constraints expressible as conjunctive queries with negated subgoals. For constraints where the predicates for the remote relations do not occur more than once, we present complete local tests under insertions and deletions to the local relations. These tests can be expressed as safe, nonrecursive Datalog queries against the local relations. These results also apply to other constraints with negation that are not conjunctive.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Gupta. (1994). Partial Information Based Integrity Constraint Checking. Ph.D. Thesis, Stanford University.
A. Gupta & J.A. Blakeley. (1995). Using Partial Information to Update Materialized Views. Information Systems, 20:641–662.
A. Gupta, Y. Sagiv, J.D. Ullman & J. Widom. (1994). Constraint Checking with Partial Information. Proc. 13th ACM Symp. on Principles of Database Systems, pages 45–55.
A. Gupta & J. Widom. (1993). Local Verification of Global Integrity Constraints in Distributed Databases. Proceedings of the ACM S1GMOD International Conf. on Management of Data, pages 49–58.
N. Huyn. (1996). Testing CQC constraints under limited data access. Technical Report available as URL http://www.db.stanford.edu/pub/papers/cqcnclt-tr.ps
N. Huyn. (1996). Efficient View Self-Maintenance. Proc. ACM Workshop on Materialized Views, pages 17–25.
N. Huyn. (1997). Efficient Complete Local Tests for Conjunctive-Query Constraints with Negation. Proc. Int. Conf Database Theory, pages 83–97, Delphi, Greece.
A. Levy & Y. Sagiv. (1993). Queries Independent of Updates. Proc. 19th International Conf. on Very Large Data Bases, pages 171–181.
S. Tiwari & H.C. Howard,. (1993). Constraint Management on Distributed AEC Databases. Fifth International Conf on Computing in Civil and Building Engineering, ASCE, pages 1147–1154.
F.W. Tompa, & J.A. Blakeley. (1988). Maintaining Materialized Views Without Accessing Base Data. Information Systems, 13:393–406.
J.D. Ullman. (1989). Principles of Database and Knowledge-Base Systems, Volumes 1 and 2, Computer Science Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Huyn, N. (1997). Maintaining Global Integrity Constraints in Distributed Databases. In: Ramakrishnan, R., Stuckey, P. (eds) Constraints and Databases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5515-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5515-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7520-3
Online ISBN: 978-1-4615-5515-5
eBook Packages: Springer Book Archive