Practical tools for reasoning about linear constraints
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Local verification of global integrity constraints in distributed databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On Fourier's algorithm for linear arithmetic constraints
Journal of Automated Reasoning
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data-valued partitioning and virtual messages (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Advanced Transaction Models and Architectures
Advanced Transaction Models and Architectures
The demarcation protocol: a technique for maintaining constraints in distributed database systems
The VLDB Journal — The International Journal on Very Large Data Bases
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Distributing Semantic Constraints Between Heterogeneous Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Optimizing Distributed Integrity Constraints
Proceedings of the 3rd International Conference on Database Systems for Advanced Applications (DASFAA)
Decomposing constraint systems: equivalences and computational properties
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Hi-index | 0.00 |
The problem considered is that of decomposing a global integrity constraint in a distributed database into local constraints for every local site, such that the local constraints serve as a conservative approximation, i.e., satisfaction of the local constraints by a database instance guarantees satisfaction of the global constraint. Verifying local rather than global constraints during database updates reduces distributed processing costs and allows most updates, even in the presence of site and network failures. This paper focuses on the problem of deriving the best possible decompositions, both at database design and update processing time. A generic framework is formulated for finding optimal decompositions for a range of design and update-time scenarios. For the case of linear arithmetic constraints, (1) a bounded size parametric formulation of the decomposition optimization problem is introduced which has a possibly smaller search space but is proven to have the same optimum, (2) the decomposition problem is reduced to the problem of resource distribution which simplifies distributed management of constraints, and (3) autonomous optimal decompositions in subsets of local database sites are shown possible and are proven to preserve optimality under the resource bounds constraints.