ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Recovering from Main-Memory Lapses.

H. V. Jagadish, Abraham Silberschatz, S. Sudarshan: Recovering from Main-Memory Lapses. VLDB 1993: 391-404
@inproceedings{DBLP:conf/vldb/JagadishSS93,
  author    = {H. V. Jagadish and
               Abraham Silberschatz and
               S. Sudarshan},
  editor    = {Rakesh Agrawal and
               Se{\'a}n Baker and
               David A. Bell},
  title     = {Recovering from Main-Memory Lapses},
  booktitle = {19th International Conference on Very Large Data Bases, August
               24-27, 1993, Dublin, Ireland, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1993},
  isbn      = {1-55860-152-X},
  pages     = {391-404},
  ee        = {db/conf/vldb/JagadishSS93.html},
  crossref  = {DBLP:conf/vldb/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery related overhead is particularly troublesome in a main- memory database where I/O activities are performed for the sole purpose of ensuring data durability. In this paper we present a recovery technique for main-memory databases, whose benefits are as follows. First, disk I/O is reduced by logging to disk only redo records during normal execution. The undo log is normally resident only in main memory, and is garbage collectedafter transaction commit. Second, our technique reduces lock contention on account of the checkpointer byallowing action consistent checkpointing - to do so, the checkpointer writes todisk relevant parts of the undo log. Third, the recovery algorithm makes only a single pass over the log. Fourth, our technique does not require the availability of any special hardwaresuch as non-volatile RAM. Thus our recovery technique combines the benefits of several techniques proposed in the past. The ideas behind our technique can be used to advantage in disk-resident databases as well.

Copyright © 1993 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.


Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Rakesh Agrawal, Seán Baker, David A. Bell (Eds.): 19th International Conference on Very Large Data Bases, August 24-27, 1993, Dublin, Ireland, Proceedings. Morgan Kaufmann 1993, ISBN 1-55860-152-X
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
...
[2]
B. R. Badrinath, Krithi Ramamritham: Semantics-Based Concurrency Control: Beyond Commutativity. ACM Trans. Database Syst. 17(1): 163-199(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Catriel Beeri, Hans-Jörg Schek, Gerhard Weikum: Multi-Level Transaction Management, Theoretical Art or Practical Need ? EDBT 1988: 134-154 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
...
[6]
...
[7]
Margaret H. Eich: A Classification and Comparison of Main Memory Database Recovery Techniques. ICDE 1987: 332-339 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
Hector Garcia-Molina, Kenneth Salem: Main Memory Database Systems: An Overview. IEEE Trans. Knowl. Data Eng. 4(6): 509-516(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Robert B. Hagmann: Crash Recovery Scheme for a Memory-Resident Database System. IEEE Trans. Computers 35(9): 839-843(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
Tobin J. Lehman, Michael J. Carey: A Recovery Algorithm for A High-Performance Memory-Resident Database System. SIGMOD Conference 1987: 104-117 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
Eliezer Levy, Abraham Silberschatz: Incremental Recovery in Main Memory Database Systems. IEEE Trans. Knowl. Data Eng. 4(6): 529-540(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
Xi Li, Margaret H. Eich: Post-crash Log Processing for Fuzzy Checkpointing Main Memory Databases. ICDE 1993: 117-124 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
C. Mohan, Donald J. Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz: ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst. 17(1): 94-162(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
Calton Pu: On-the-Fly, Incremental, Consistent Reading of Entire Databases. Algorithmica 1(3): 271-287(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
...
[17]
Kenneth Salem, Hector Garcia-Molina: System M: A Transaction Processing Testbed for Memory Resident Data. IEEE Trans. Knowl. Data Eng. 2(1): 161-172(1990) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
William E. Weihl: Commutativity-Based Concurrency Control for Abstract Data Types. IEEE Trans. Computers 37(12): 1488-1505(1988) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Fri Mar 12 17:22:52 2010 by Michael Ley (ley@uni-trier.de)