Abstract
Traditional protocols for distributed database management have high message overhead, lock or restrain access to resources during protocol execution, and may become impractical for some scenarios like real-time systems and very large distributed databases. In this paper we present the demarcation protocol; it overcomes these problems through the use of explicit linear arithmetic consistency constraints as the correctness criteria. The method establishes safe limits as “lines drawn in the sand” for updates and gives a way of changing these limits dynamically, enforcing the constraints at all times.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alonso, D. Barbará, and H. Garcia-Molina, “Data Caching Issues in an Information Retrieval System,” ACM Transactions on Database Systems, Vol. 15, No. 3, September 1990.
O.S.F. Carvalho and G. Roucariol, “On the Distribution of an Assertion,” Proceedings of the ACM-SIGOPS Symposium on Principles of Distributed Computing. Ottawa, 1982.
C.J. Date, “An Introduction to Database Systems,” Volume 2, Addison-Wesley.
S. B. Davidson, “An Optimistic Protocol for Partitioned Distributed Database Systems,” Ph.D. Dissertation, Princeton University. October 1982.
W. Du, and A. Elmagarmid, “Quasi-Serializability: A Correctness Criterion for Global Concurrency Control in InterBase,” Proceedings of the 15th Conference on Very Large Data Bases, Amsterdam, Aug. 1989.
J.M. Fischer, N.D. Griffeth, and N.A. Lynch, “Global States of a Distributed System,” IEEE Transactions on Software Engineering, SE-8, 3. May 1982.
M. F. Fernández and S. B. Zdonik, “Transaction Groups: A Model for Controlling Cooperative Work,” Proceedings of the Third International Workshop on Persistent Object Systems. Queensland, Australia, January 1989.
H. Garcia-Molina, “Using Semantic Knowledge for Transaction Processing in a Distributed Database,” ACM Transactions on Database Systems, Vol.8, No. 2, June 1983.
M.M. Hammer and D. W. Shipman, “The Reliability Mechanisms of SDD-1: A system for Distributed Databases,” Computer Corporation of America Technical Report CCA-80-04, January 1980.
H. F. Korth, and G.D. Speegle, “Formal Model of Correctness Without Serializability,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, June 1988.
A. Kumar, and M. Stonebraker, “Semantics Based Transaction Management Techniques for Replicated Data,” Proceedings of the ACM SIGMOD 1988 International Conference on Management of Data, Chicago, 1988.
N.A. Lynch, B. Blaustein, and M. Siegel, “Correctness Conditions for Highly Available Replicated Data,” Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Systems, Calgary, August 1986.
P. O'Neil, “The Escrow Transactional Method,” ACM Transactions on Database Systems, Vol. 11, No. 4, December 1986.
N. Soparkar, A. Silberschatz, “Data-Value Partitioning and Virtual Messages,” Proceedings of the Conference on Principles of Database Systems, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbard, D., Garcia-Molina, H. (1992). The demarcation protocol: A technique for maintaining linear arithmetic constraints in distributed database systems. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032443
Download citation
DOI: https://doi.org/10.1007/BFb0032443
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive