Local Verification of Global Integrity Constraints in Distributed Databases

65Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

We present an optimization for integrity constraint verification in distributed databases. The optimization allows a global constraint, i.e. a constraint spanning multiple databases, to be verified by accessing data at a single database, eliminating the cost of accessing remote data. The optimization is based on an algorithm that takes as input a global constraint and data to be inserted into a local database. The algorithm produces a local condition such that if the local data satisfies this condition then, based on the previous satisfaction of the global constraint, the global constraint is still satisfied. If the local data does not satisfy the condition, then a conventional global verification procedure is required. © 1993, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Gupta, A., & Widom, J. (1993). Local Verification of Global Integrity Constraints in Distributed Databases. ACM SIGMOD Record, 22(2), 49–58. https://doi.org/10.1145/170036.170048

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