This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Achieving High Availability in Distributed Databases
July 1988 (vol. 14 no. 7)
pp. 886-896

An approach is presented for managing distributed database systems in the face of communication failures and network partitions. The approach is based on the idea of dividing the database into fragments and assigning each fragment a controlling entity called an agent. The goals achieved by this approach include high data availability and the ability to operate without promptly and correctly detecting partitions. A correctness criterion for transaction execution, called fragmentwise serializability, is introduced. It is less strict than the conventional serializability, but provides a valuable alternative for some applications.

[1] B. T. Blaustein, H. Garcia-Molina, D. R. Ries, R. M. Chilenskas, and C. W. Kaufman, "Maintaining replicated databases even in the presence of partitions," inProc. 16th IEEE Elec. Aerosp. Syst. Conf., Washington, DC, 1983, pp. 353-360.
[2] T. Blaustein and C. W. Kaufman, "Updating replicated data during communications failures," inProc. 11th Conf. Very Large Data Bases, Stockholm, Sweden, Aug. 1985, pp. 48-58.
[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] S. Davidson, "Optimization and consistency in partitioned distributed database systems,"ACM Trans. Database Syst., vol. 9, no. 3, pp. 456-481, 1984.
[5] 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.
[6] 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.
[7] H. Garcia-Molina, T. Allen, B. Blaustein, R. M. Chilenskas, and D. R. Ries, "Data-Patch: Integrating inconsistent copies of a database after a partition," inProc. 3rd IEEE Symp. Rel. of Distributed Software and Database Syst., Oct. 1983, pp. 38-48.
[8] H. Garcia-Molina and B. Kogan, "Achieving high availability in distributed databases (full version)," Dep. Comput. Sci., Princeton Univ., Princeton, NJ, Tech. Rep., in preparation.
[9] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[10] T. Minoura and G. Wiederhold, "Resilient extended true-copy token scheme for a distributed database system,"IEEE Trans. Software Eng., vol. SE-8, pp. 173-189, May 1982.
[11] D. Skeen and D. Wright, "Increasing availability in partitioned networks," inProc. 3rd ACM SIGACT-SIGMOD Symp. Principles of Database Syst., Waterloo, Ont., Canada, Apr. 1984, pp. 290-299.
[12] I. L. Traiger, J. Gray, C. A. Galtieri, and B. G. Lindsay, "Transactions and consistency in distributed database systems,"ACM Trans. Database Syst., vol. 7, pp. 323-342, Sept. 1982.

Index Terms:
fault tolerant computing; distributed databases; communication failures; network partitions; controlling entity; agent; data availability; correctness criterion; transaction execution; fragmentwise serializability; database theory; distributed databases; fault tolerant computing; program verification; software reliability
Citation:
H. Garcia-Molina, B. Kogan, "Achieving High Availability in Distributed Databases," IEEE Transactions on Software Engineering, vol. 14, no. 7, pp. 886-896, July 1988, doi:10.1109/32.42732
Usage of this product signifies your acceptance of the Terms of Use.