A novel checkpointing scheme for distributed database systems

ABSTRACT

We present a new checkpointing scheme for a distributed database system. Our scheme records the states of some selected data items and can be executed at any time without stopping other activities in the database system. It makes use of “shadows” of data items to make sure that the collected data item values are “transaction-consistent”. Storage overhead is low, since at most one shadow is needed for each data item.

REFERENCES

• BEGO81: Philip A. Bernstein , Nathan Goodman, Concurrency Control in Distributed Database Systems, ACM Computing Surveys (CSUR), v.13 n.2, p.185-221, June 1981 [doi>10.1145/356842.356846]
• BHG87: Philip A. Bernstein , Vassco Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
• DASC80: P. Dadam and G. Schlageter, Recovery in distributed databases based on nonsynchronized local checkpoints, Information Processing 80, North-Holland Publ. Co., Amsterdam, 1980, 457-462.
• EGLT76: K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976 [doi>10.1145/360363.360369]
• FGL82: MJ. Fischer, N.D. Griffeth and N.A. Lynch, Global states of a distributed system, IEEE Trans. on Soft.Eng.Vol.SE-8, No. 3, (1982), 198-202.
• GRAY79: Jim Gray, Notes on Data Base Operating Systems, Operating Systems, An Advanced Course, p.393-481, January 1978
• JOUV77: M. Jouve, Reliability aspects in a distributed database management system, Proc. AICA, 1977, 199-209.
• KNAP87: Edgar Knapp, Deadlock detection in distributed databases, ACM Computing Surveys (CSUR), v.19 n.4, p.303-328, Dec. 1987 [doi>10.1145/45075.46163]
• KUSS82: Herbert Kuss, On totally ordering checkpoints in distributed data bases, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582384]
• LAMP78: Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
• LAMP86: Leslie Lamport, The mutual exclusion problem: part I—a theory of interprocess communication, Journal of the ACM (JACM), v.33 n.2, p.313-326, April 1986 [doi>10.1145/5383.5384]
• MCDE81: J. McDermid, Checkpointing and error recovery in distributed systems, Proc. 2nd Intn'l Conf. on Distributed Computing Systems, 1981, 271-282.
• PAPA86: Christos Papadimitriou, The theory of database concurrency control, Computer Science Press, Inc., New York, NY, 1986
• PIKA89: S. Pilarski and T. Kameda, Checkpointing for distributed databases: Starting from the basics, CSS/LCCR TR 89-14, School of Computing Science, Simon Fraser University, 1989.
• PU86: C. Pu , C. H. Hong , J. M. Wha, Performance evaluation of global reading of entire databases, Proceedings of the first international symposium on Databases in parallel and distributed systems, p.167-176, December 05-07, 1988, Austin, Texas, United States
• PU86: F. Pu, On-the-fly, incremental, consistent reading of entire databases, Algorithmica Vol. 1, No. 3 (Oct. 1986), 271-287.
• SCDA80: G. Schlagetcr and P. Dadam, Reconstruction of consistent global states in distributed databases, Proc. Intn'l Symp. on Distributexi Databases, INRIA, North-Holland Publ. Co., 1980, 191-200.
• SOAG85: S.H. Son and A.K. Agrawala, A nonintrusive checkpointing scheme in distributed database systems, Proc. IEEE FTCS-15, 1985, 99-104.
• SOAG89: Sang Hyuk Son , Ashok K. Agrawala, Distributed Checkpointing for Globally Consistent States of Databases, IEEE Transactions on Software Engineering, v.15 n.10, p.1157-1167, October 1989 [doi>10.1109/TSE.1989.559763]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

General Terms:
Design