ACM Home Page
Please provide us with feedback. Feedback
A snapshot differential refresh algorithm
Full text PdfPdf (827 KB)
Source International Conference on Management of Data archive
Proceedings of the 1986 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 53 - 60  
Year of Publication: 1986
ISBN:0-89791-191-1
Also published in ...
Authors
Bruce Lindsay  IBM Almaden Research Center, San Jose, CA
Laura Haas  IBM Almaden Research Center, San Jose, CA
C. Mohan  IBM Almaden Research Center, San Jose, CA
Hamid Pirahesh  IBM Almaden Research Center, San Jose, CA
Paul Wilms  IBM Almaden Research Center, San Jose, CA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 38,   Citation Count: 39
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/16894.16860
What is a DOI?

ABSTRACT

This article presents an algorithm to refresh the contents of database snapshots. A database snapshot is a read-only table whose contents are extracted from other tables in the database. The snapshot contents can be periodically refreshed to reflect the current state of the database. Snapshots are useful in many applications as a cost effective substitute for replicated data in a distributed database system. When the snapshot contents are a simple restriction and projection of a single base table, differential refresh techniques can reduce the message and update costs of the snapshot refresh operation. The algorithm presented annotates the base table to detect the changes which must be applied to the snapshot table during snapshot refresh. The cost of maintaining the base table annotations is minimal and the amount of data transmitted during snapshot refresh is close to optimal in most circumstances.


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.

 
ADIBA 80
M E Achba and B G Lmdsay, Database Snapshots, Proceedings 6th International Conference on Very large Data Bases, Montreal, Canada (October 1980) pp 86-91
 
HAAS 82
L M Haas, Pl Sehnger, E Bertmo, D Darnels, B Lmdsay, G Lohman, Y Masunaga, C Mohan, P Ng, P Wdms, and R Yost, R* A Research ProJect on Dtstnbuted Relatwnal DBMS, IEEE Database Engineering, Vol 5, No 4 (also available as IBM Research Report RJ3653, October 1982) (December 1982) pp 28-32
 
LOHMAN 85
G Lohman, C Mohan, L Haas, D Danlels, B Lmdsay, P Selmger, and P Wdms, Query Processing m R *, m Query Processing m Database Systems, W Ktm, D Remer, and D Batory (Eds), Sprmger-Verlag, 1985 (also avadable as IBM Research Report RJ4272, Aprd 1984)

CITED BY  39

Collaborative Colleagues:
Bruce Lindsay: colleagues
Laura Haas: colleagues
C. Mohan: colleagues
Hamid Pirahesh: colleagues
Paul Wilms: colleagues