Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Maintaining materialized views without accessing base data
Information Systems
Local verification of global integrity constraints in distributed databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Partial information based integrity constraint checking
Partial information based integrity constraint checking
Using partial information to update materialized views
Information Systems
Efficient Complete Local Tests for Conjunctive Query Constraints with Negation
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Adaptive filters for continuous queries over distributed data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Preservation of integrity constraints by workflow
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Optimal constraint decomposition for distributed databases
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
A Model for Ranking and Selecting Integrity Tests in a Distributed Database
International Journal of Information Technology and Web Engineering
| Hi-index | 0.00 |
Given some integrity constraints over a distributeddatabase, we consider the problem of incrementally checking globalconsistency in response to updates made to the base relationsbut without accessing all these base relations. In many applicationareas such as collaborative design, mobile computing and enterpriseinformation systems, total data availability cannot be assumed.Even if all the base data is available, some of it may incursuch a high cost that its use should only be considered as alast resort. Without looking at all the relations that participatein the constraint, how can one meaningfully check a constraintfor violation? When the constraint is known to be satisfied priorto the update, the state of the relations that are available(aka local) can in principle be used to infer something aboutthe relations that are not available (aka remote). This observationis the basis for the existence of tests that guarantee that globalconsistency is preserved under a given update, without lookingat all the base data. In order to make consistency maintenance practical, the challenge is to find those tests that are mostgeneral (we call Complete Local Tests) and that are efficientto generate and execute. This paper addresses the problem offinding efficient complete local tests for an important classof constraints that are very common in practice: constraintsexpressible as conjunctive queries with negated subgoals. Forconstraints where the predicates for the remote relations donot occur more than once, we present complete local tests underinsertions and deletions to the local relations. These testscan be expressed as safe, nonrecursive Datalog ¬queries against the local relations. These results also applyto other constraints with negation that are not conjunctive.