skip to main content
article
Free Access

High speed on-line backup when using logical log operations

Published:16 May 2000Publication History
Skip Abstract Section

Abstract

Media recovery protects a database from failures of the stable medium by maintaining an extra copy of the database, called the backup, and a media recovery log. When a failure occurs, the database is “restored” from the backup, and the media recovery log is used to roll forward the database to the desired time, usually the current time. Backup must be both fast and “on-line”, i.e. concurrent with on-going update activity. Conventional online backup sequentially copies from the stable database, almost independent of the database cache manager, but requires page-oriented log operations. But results of logical operations must be flushed to a stable database (a backup is a stable database) in a constrained order to guarantee recovery. This order is not naturally achieved for the backup by a cache manager concerned only with crash recovery. We describe a “full speed” backup, only loosely coupled to the cache manager, and hence similar to current online backups, but effective for general logical log operations. This requires additional logging of cached objects to guarantee media recoverability. We then show how logging can be greatly reduced when log operations have a constrained form which nonetheless provides very useful additional logging efficiency for database systems.

References

  1. 1 Bernstein, P., Hadzilacos, V. Goodman, N. Concurrency Control and Recovery in Database Systems. Addison Wesley (1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Gray, J. Notes on Data Base Operating Systems. IBM Tech Report RJ2188 (Feb. 1978), IBM Corp., San Jose, CAGoogle ScholarGoogle Scholar
  3. 3 Gray, J., McJones, P., et al. The Recovery Manager of the System R Database Manager. ACM Computing Surveys, 13,2 (June 1981) 223-242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Gray, J. and Reuter, A. Transaction Processing: Concepts and Techniques. Morgan Kaufmann (1993) San Mateo, CA Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Haerder, T. and Reuter, A. Principles of transaction-oriented database recovery. ACM Comp. Surveys 15,4 (Dec. 1983) 287-317. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 King, R. P., Halim, N., Garcia-Molina, H. Polyzois, C. A. Management of a remote backup copy for disaster recovery. ACM Trans. on Database Systems 16, 2 (June 1991) 338-368 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Kumar, V. and Hsu, M. (eds.) Recovery Mechanisms in Database Systems. Prentice Hall, NJ 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Lomet, D. Application recovery using generalized redo recovery. Intl. Conf. on Data Eng., Orlando (Feb. 1998) 154-163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Lomet, D. and Salzberg, B. Exploiting a History Database for Backup, VLDB Conference, Dublin (Sept. 1993) 380-390. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Lomet, D. and Tuttle, M. Redo recovery from system crashes. VLDB Conference, Zurich (Sept. 1995) 457-468. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Lomet, D. and Tuttle, M. Logical logging to extend recovery to new domains. ACM SIGMOD Conference, Philadelphia (May 1999) 73-84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., and Schwarz, P. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using writeahead logging. ACM Trans. On Data. Sys. 17,1 (Mar. 1992) 94-162. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Mohan, C. and Narang, I. An Efficient and Flexible Method for Archiving a Data Base. ACM SIGMOD Conference, Washington, DC (May 1993) 139-146. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. High speed on-line backup when using logical log operations

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGMOD Record
          ACM SIGMOD Record  Volume 29, Issue 2
          June 2000
          609 pages
          ISSN:0163-5808
          DOI:10.1145/335191
          Issue’s Table of Contents
          • cover image ACM Conferences
            SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data
            May 2000
            604 pages
            ISBN:1581132174
            DOI:10.1145/342009

          Copyright © 2000 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 16 May 2000

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader