This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dec. 1985 (vol. 34 no. 12)
pp. 1158-1163
Sunil K. Sarin, Computer Corporation of America, Cambridge, MA 02142
Barbara T. Blaustein, Computer Corporation of America, Cambridge, MA 02142
Charles W. Kaufman, Computer Corporation of America, Alexandria, VA 22314
An overview is presented of an approach to distributed database design that emphasizes high availability in the face of network partitions and other communication failures. This approach is appropriate for applications that require continued operation and can tolerate some loss of integrity of the data. Each site presents its users and application programs with the best possible view of the data that it can, based on those updates that it has received so far. Mutual consistency of replicated copies of data is ensured by using timestamps to establish a known total ordering on all updates issued, and by a mechanism that ensures the same final result regardless of the order in which a site actually receives these updates. A mechanism is proposed, based on alerters and triggers, by which applications can deal with exception conditions that may arise as a consequence of the high-availability architecture. A prototype system that demonstrates this approach is near completion.
Index Terms:
replicated data,Concurrency control,compensation,distributed databases,mutual consistency,network partitions
Citation:
Sunil K. Sarin, Barbara T. Blaustein, Charles W. Kaufman, "System architecture for partition-tolerant distributed databases," IEEE Transactions on Computers, vol. 34, no. 12, pp. 1158-1163, Dec. 1985, doi:10.1109/TC.1985.6312213
Usage of this product signifies your acceptance of the Terms of Use.