This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Storage Efficient Replicated Databases
September 1990 (vol. 2 no. 3)
pp. 342-352

A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown that this protocol is a generalization of quorum algorithms for replicated data in which objects are not fragmented. Although the protocol reduces storage requirements, it does not achieve a high level of resiliency for both read and write operations. By integrating a propagation mechanism with the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.

[1] D. Agrawal and A. J. Bernstein, "A family of optimistic algorithms for replicated data," Tech. Rep. 87/020, Dep. Comput. Sci., State University of New York at Stony Brook, Aug. 1987.
[2] M. Ahamad and M. H. Ammar, "Performance characterization of quorum-consensus algorithms for replicated data,"IEEE Trans. Software Eng., vol. 15, no. 4, pp. 492-495, Apr. 1989.
[3] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[4] P. A. Bernstein and N. Goodman, "The failure and recovery problem for replicated databases," inProc. 2nd Ann. Symp. Principles of Distributed Computing, 1983, pp. 114-122.
[5] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[6] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341-370.
[7] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[8] M. Fischer and A. Michael, "Sacrificing serializability to attain high availability of data in an unreliable network," inProc. 1st Symp. Principles Database Systems, Mar. 1982, pp. 70-75.
[9] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[10] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[11] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[12] A. Heddaya, M. Hsu, and W. Weihl, "Two phase gossip: Managing distributed event histories," Tech. Rep. TR-04-87, Aiken Computation Lab., Harvard Univ., 1987.Information Sciences: An International Journal, to be published.
[13] T. Joseph and K. Birman, "Low cost management of replicated data in fault tolerant distributed systems,"ACM Trans. Comput. Syst., vol. 4, pp. 54-70, 1986.
[14] D. E. Knuth, "Permutations, matrices, and generalized Young tableaux,"Pacific J. Mathematics, vol. 34, no. 3, 1970.
[15] L. Lamport, "Time, clocks, and the ordering of events in a distributed system,"Commun. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[16] B. Liskov and R. Ladin, "Highly available services in distributed systems," inProc. Fifth ACM Symp. Principles Distributed Comput., Aug. 1986, pp. 29-39.
[17] I. G. Macdonald,Symmetric Functions and Hall Polynomials. Oxford, England: Oxford University Press, 1979. Oxford Mathematical Monographs.
[18] J. F. Paris, "'Voting with witnesses: A consistency scheme for replicated files," inProc. 6th Conf. Distributed Comput. Syst., June 1986, pp. 606-612.
[19] L. L. Peterson, N. Buchholz, and R. D. Schlichting, "Preserving and using context information in interprocess communication,"ACM Trans. Comput. Syst., vol. 7, no. 3, pp. 217-246, Aug. 1989.
[20] D. P. Reed, "Naming and synchronization in a decentralized computer system," Ph.D. dissertation, Massachusetts Instit. Technol., 1978. Available as Tech. Rep. MIT/LCS/TR-205.
[21] R. D. Schlichting and F.B. Schneider, "Fail-stop processors: An approach to designing fault-tolerant computing systems,"ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222-238, Aug. 1983.
[22] F. B. Schneider, "Synchronization in distributed programs,"ACM Trans. Programming Languages Syst., vol. 4, no. 2, pp. 125-148, Apr. 1982.
[23] J. Tang and N. Natarajan, "A static pessimistic scheme for handling replicated databases," inProc. 1989 ACM SIGMOD Int. Conf. Management Data, June 1989, pp. 389-398.
[24] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.
[25] G. T. Wuu and A. J. Bernstein, "Efficient solutions to the replicated log and dictionary problems," inProc. Third ACM Symp. Priniciples Distributed Comput., Aug. 1984, pp. 233-242.

Index Terms:
replicated databases; fragmentation method; storage overhead; replicated objects; data-management protocol; quorum algorithms; propagation mechanism; database management systems
Citation:
D. Agrawal, A. El Abbadi, "Storage Efficient Replicated Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 3, pp. 342-352, Sept. 1990, doi:10.1109/69.60797
Usage of this product signifies your acceptance of the Terms of Use.