The demarcation protocol: A technique for maintaining constraints in distributed database systems

Traditional protocols for distributed database management have a high message overhead; restrain or lock access to resources during protocol execution; and may become impractical for some scenarios like real-time systems and very large distributed databases. In this article, we present the demarcation protocol; it overcomes these problems by using explicit consistency constraints as the correctness criteria. The method establishes safe limits as “lines drawn in the sand” for updates, and makes it possible to change these limits dynamically, enforcing the constraints at all times. We show how this technique can be applied to linear arithmetic, existential, key, and approximate copy constraints.

[1]  Michael Hammer,et al.  Reliability mechanisms for SDD-1: a system for distributed databases , 1980, TODS.

[2]  Susan B. Davidson,et al.  An optimistic protocol for partitioned distributed database systems , 1982 .

[3]  Gérard Roucairol,et al.  On the distribution of an assertion , 1982, PODC '82.

[4]  Nancy A. Lynch,et al.  Global States of a Distributed System , 1982, IEEE Transactions on Software Engineering.

[5]  Hector Garcia-Molina,et al.  Using semantic knowledge for transaction processing in a distributed database , 1983, TODS.

[6]  Nancy A. Lynch,et al.  Correctness conditions for highly available replicated databases , 1986, PODC '86.

[7]  Patrick E. O'Neil,et al.  The Escrow transactional method , 1986, TODS.

[8]  Michael Stonebraker,et al.  Semantics based transaction management techniques for replicated data , 1988, SIGMOD '88.

[9]  Henry F. Korth,et al.  Formal model of correctness without serializabilty , 1988, SIGMOD '88.

[10]  Formal Model of Correctness Without Serializability , 1988, SIGMOD Conference.

[11]  Stanley B. Zdonik,et al.  Transaction Groups: A Model for Controlling Cooperative Transactions , 1989, POS.

[12]  Weimin Du,et al.  Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase , 1989, VLDB.

[13]  Abraham Silberschatz,et al.  Data-valued partitioning and virtual messages (extended abstract) , 1990, PODS '90.

[14]  Rafael Alonso,et al.  Data caching issues in an information retrieval system , 1990, TODS.

[15]  Abraham Silberschatz,et al.  Data-valued partitioning and virtual messages (extended abstract) , 1990, PODS.

[16]  Calton Pu,et al.  Replica control in distributed systems: as asynchronous approach , 1991, SIGMOD '91.

[17]  PuCalton,et al.  Replica control in distributed systems , 1991 .

[18]  Arthur J. Bernstein,et al.  High Throughput Escrow Algorithms for Replicated Databases , 1992, VLDB.

[19]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .