ACM Home Page
Please provide us with feedback. Feedback
An efficient and flexible method for archiving a data base
Full text PdfPdf (969 KB)
Source International Conference on Management of Data archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 139 - 146  
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
Authors
C. Mohan  Data Base Technology Institute, IBM Almaden Research Center, San Jose, CA
Inderpal Narang  Data Base Technology Institute, IBM Almaden Research Center, San Jose, CA
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 43,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/170035.170064
What is a DOI?

ABSTRACT

We describe an efficient method for supporting incremental and full archiving of data bases (e.g., individual files). Customers archive their data bases quite frequently to minimize the duration of data outage. Because of the growing sizes of data bases and the ever increasing need for high availability of data, the efficiency of the archive copy utility is very important. The method presented here minimizes interferences with concurrent transactions by not acquiring any locks on the data being copied. It significantly reduces disk I/Os by not keeping on data pages any extra tracking information in connection with archiving. These features make the archive copy operation be more efficient in terms of resource consumption compared to other methods. The method is also flexible in that it optionally supports direct copying of data from disks, bypassing the DBMS's buffer pool. This reduces buffer pool pollution and processing overheads, and allows the utility to take advantage of device geometries for efficiently retrieving data. We also describe extensions to the method to accommodate the multisystem shared disks transaction environment. The method tolerates gracefully system failures during the archive copy operation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
CPM82
Crus, R., Putzolu, F., Mortenson, J. Incremental Data Base Log Image Copy, IBM Technical Disclosure Bulle. tin, Vol. 25, No. 7B, p3730-3732, December 1982.
GMBLL81
 
IBM
IBM Database 2 Version 2 Command and UtiZity Reference, Document Number SC'2S-4378, IBM Corp.
 
Info91
INFORHIX OnLine Administrator's 6uide - Database Server Version 5.0, Part No. 000-7106, lntorrnix Software, Inc., December 1991.
MHLPS92
 
Moha92
Mohan, C. Support ing Very Large Tables, Proc. 7th Brazilian Symposium on Database Systems, Porto Alegre, May 1992. Also available as IBM Research Report RJ8687, iBM Almaden Research Center, March 1992.
Moha93
 
MoNa91
 
MoNa92a
 
MoNa92b
Mohan, C., Narang, I. Data Base Recovery in Shared Disks and CZient-Server Architectures, Proc. 12th International Conference on Distributed Computing Systems, Yokohama, June 1992.
 
TeGu84
Teng, J., Gurnaer, R.Hanaging IBH Database 2 Buffers to Maximize Performance, IBM Systems Journal, Vol. 23, No. 2, 1984.

CITED BY  12

Collaborative Colleagues:
C. Mohan: colleagues
Inderpal Narang: colleagues