Quasi-partitioning: a new paradigm for transaction execution in partitioned distributed database systems

Abstract

The quasi-partitioning paradigm of operation for partitioned database systems is discussed in which a broken main link between two partitions can be replaced by a much slower backup link (e.g. a dial-up telephone connection). The paradigm solves the problem of preparation for network partitioning. The quasi-partitioning mode of operation has two primitive operations: creeping retrieval and creeping merge. Creeping retrieval increases data availability by crossing partition boundaries (over backup links) to read foreign data. Similarly, creeping merge improves the degree of partition-consistency by crossing partition boundaries to perform merge actions. A quasi-partitioning protocol consists of an adaptation protocol and a merge protocol. Taxonomies are shown for quasi-partitioning adaptation protocols and for quasi-partitioning merge protocols (for restoring partition-consistency after system reconnection). Since merge protocols and adaptation protocols are interdependent, it is indicated here how these protocols should be paired.<>