Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barbará, D., Garcia-Molina, H.: The Demarcation Protocol: A technique for maintaining constraints in distributed database systems. VLDB Journal 2(3)
Barbará, D., Garcia-Molina, H.: The demarcation protocol: A technique for maintaining arithmetic constraints in distributed database systems. In: Proc. 3rd International Conference on Extending Data Base Technology, EDBT 1992, pp. 373–388. Springer, Heidelberg (1992)
Fourier, J.B.J.: Reported in: Analyse de travaux de l’Academie Royale des Sciences, pendant l’annee 1824, Partie Mathematique, Historyde l’Academie Royale de Sciences de l’Institue de France 7, xlvii-lv (1827); Partial English translation in: Kohler, D.A.: Translation of a Report by Fourier on his work on Linear Inequalities. Opsearch 10 (1973), 38–42 (1824)
Garcia-Molina, H.: Global consistency constraints considered harmful. In: Proc. First International Workshop on Interoperability in Multidatabase Systems (IMS 1991), pp. 248–250 (1991)
Grufman, S., Samson, F., Embury, S., Gray, P., Risch, T.: Distributing semantic constraints between heterogeneous databases. In: 13th International Conference on Data Engineering (ICDE 1997). IEEE, Birmingham (1997)
Gupta, A., Widom, J.: Local verification of global integrity constraints in distributed databases. In: Proc. ACM-SIGMOD International Conference on Management of Data, Washington, D.C., pp. 49–58. ACM, New York (1993)
Huyn, N.: Maintaining global integrity constraints in distributed databases. CONSTRAINTS. An Internation Journal 2(3-4), 377–399 (1997)
Huynh, T., Joskowicz, L., Lassez, C., Lassez, J.L.: Practical tools for reasoning about linear constraints. Fundamenta Informaticae, Special issue on Logic and Artificial Intelligence 15(4), 357–379 (1991)
Jajodia, S., Kerschberg, L.: Advanced Transaction Models and Architectures, 1st edn. Kluwer Academic Publishers, Norwall (1997)
Lassez, J.-L.: Querying constraints. In: Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1990)
Lassez, J.-L., Maher, M.: On Fourier’s algorithm for linear arithmetic constraints. Journal of Automated Reasoning 9, 373–379 (1992)
Mazumdar, S.: Optimizing distributed integrity constraints. In: Proc. Third International Symposium on Database Systems for Advanced Applications (DASFAA 1993), Taejon, Korea, pp. 327–334 (1993)
Mazumdar, S., Yuan, Z.: Localizing global constraints: A geometric approach. In: Proceedings of the 9th International Conference on Computing and Information. ICCI 1998 (1998)
Qian, X.: Distributed desing of integrity constraints. In: Kerschberg, L. (ed.) Proc. Second International Conference on Expert System Database Systems, Redwood City, California, pp. 417–425. Benjamin Cummings (1988)
Qian, X., Smith, D.: Constraint reformulation for efficient validation. In: Proc. Thirteenth International Conference on Very Larqe Databases, pp. 622–632 (1987)
Simon, E., Valduriez, P.: Design and implementation of an extendible integrity subsystem. In: Proc. Nineteenth Hawaii International Conference on System Sciences, pp. 622–632 (1986)
Soparkar, N., Silberschatz, A.: Data-value partitioning and virtual messages. In: ACM (ed.) Proc. 9th ACM SIGACT-SIGMOD-SIGART Simposium on Principles of Database Systems, Nashville, Tennessee (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodsky, A., Kerschberg, L., Varas, S. (2004). Optimal Constraint Decomposition for Distributed Databases. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-30502-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24087-7
Online ISBN: 978-3-540-30502-6
eBook Packages: Computer ScienceComputer Science (R0)