Abstract
In this paper, we present two protocols for efficient execution of transactions in replicated databases. Transactions are executed at a single site thus avoiding communication overhead and distributed commitment, which are required by most other replica control protocols. In the first protocol, data accessibility at a site can be dynamically reconfigured using special transactions, which are executed on demand. In the second protocol, data accessibility is reconfigured by migrating ownership of individual objects in the database. The two protocols present trade-offs with respect to atomicity, resiliency, and data availability. The approach of local execution of user transactions improves response time, eliminates the need for distributed commit protocols, and accommodates database heterogeneity.
This research is supported by the NSF under grant numbers CCR-8809387 and IRI-8809284.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Agrawal and A. El Abbadi. Locks with Constrained Sharing. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 85–93, April 1990.
J.M. Bernabéu-Aubán and M. Ahamad. Applying a Path-Compression Technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm. In Proceedings of the Third International Workshop on Distributed Algorithms, pages 33–44, September 1989.
P. A. Bernstein and N. Goodman. A Proof Technique for Concurrency Control and Recovery Algorithms for Replicated Databases. Distributed Computing, Springer-Verlag, 2(1):32–44, January 1987.
O. Carvalho and G. Roucairol. On Mutual Exclusion in Computer Networks. Communications of the ACM, 26:146–147, February 1983.
S. B. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in partitioned networks. ACM Computing Surveys, 17(3):341–370, September 1985.
K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The Notion of Consistency and Predicate Locks in Database System. Communications of the ACM, 19(11):624–633, November 1976.
A. El Abbadi, D. Skeen, and F. Cristian. An Efficient Fault-Tolerant Protocol for Replicated Data Management. In Proceedings of the Fourth ACM Symposium on Principles of Database Systems, pages 215–228, March 1985.
A. El Abbadi and S. Toueg. Maintaining Availability in Partitioned Replicated Databases. ACM Transaction on Database Systems, 14(2):264–290, June 1989.
A. El Abbadi and S. Toueg. The Group Paradigm for Concurrency Control Protocol. IEEE Transactions on Knowledge and Data Engineering, pages 376–386, September 1989.
D. K. Gifford. Weighted Voting for Replicated Data. In Proceedings of the Seventh ACM Symposium on Operating Systems Principles, pages 150–159, December 1979.
M. Herlihy. Dynamic Quorum Adjustments for Partitioned Data. ACM Transactions on Database Systems, 12(2):170–194, June 1987.
B. Kogan and H. Garcia-Molina. Update Propagation in Bakunin Data Networks. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 13–26, August 1987.
H. T. Kung and J. T. Robinson. On Optimistic Methods for Concurrency Control. ACM Transactions on Database Systems, 6(2):213–226, June 1981.
L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558–565, July 1978.
K. Li and P. Hudak. Memory Coherence in Shared Virtual Memory Systems. ACM Transactions on Computer Systems, 7(4), November 1989.
B. Oki and B. Liskov. Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems. In Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, pages 8–17, August 1988.
K. Raymond. A Tree-Based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems, 7(1):61–77, February 1989.
D. P. Reed. Naming and Synchronization in a Decentralized Computer System. Technical Report MIT-LCS-TR-205, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 1978.
I. Suzuki and T. Kasami. A Distributed Mutual Exclusion Algorithm. ACM Transactions on Computer Systems, 3(4):344–349, November 1985.
D. Skeen. Crash Recovery in a Distributed Database Systems. PhD thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1982.
R. Schlichting and F. B. Schneider. Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. ACM Transactions on Computer Systems, 1(3):222–238, August 1982.
N. Soparkar and A. Silberschatz. Data-value Partitioning and Virtual Messages. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 357–367, April 1990.
M. Stonebraker. Concurrency Control and Consistency in Multiple Copies of Data in Distributed INGRES. IEEE Transactions on Software Engineering, 3(3):188–194, May 1979.
V. O. Tam and M. Hsu. Token Transactions: Managing Fine-Grained Migration of Data. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 344–356, April 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, D., El Abbadi, A. (1991). Localized-access protocols for replicated databases. In: van Leeuwen, J., Santoro, N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54099-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-54099-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54099-1
Online ISBN: 978-3-540-47405-0
eBook Packages: Springer Book Archive