Report Number: CS-TR-85-1053
Institution: Stanford University, Department of Computer Science
Title: Transaction classification to survive a network partition
Author: Apers, Peter M. G.
Author: Wiederhold, Gio
Date: August 1984
Abstract: When comparing centralized and distributed databases one of the advantages of distributed databases is said to be the greater availability of the data. Availability is defined as having access to the stored data for update and retrieval, even when some distributed sites are down due to hardware failures. We will investigate the functioning of a distributed database of which the underlying computer network may fail. A classification of transactions is given to allow an implementation of different levels of operatability. Some transactions can be guaranteed to commit in spite of a network partition, while others have to wait until the state of potential transactions in the other partitions is also known. An algorithm is given to compute a classification. Based on historics of transactions kept in the different partitions a merge of histories is computed, generating the new values for some data items when communication is re-established. Thc algorithm to compute the merge of the histories makes use of a knowledge base containing knowledge about the transactions, to decide whether to merge, delete, or delay a transaction.
http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1053/CS-TR-85-1053.pdf