SIGN IN
SIGN UP
Fast checkpoint recovery algorithms for frequently consistent applications
Full Text:
PDF
Buy this Article
Authors:
Tuan Cao
Cornell University, Ithaca, NY, USA
Marcos Vaz Salles
Cornell University, Ithaca, NY, USA
Benjamin Sowell
Cornell University, Ithaca, NY, USA
Yao Yue
Cornell University, Ithaca, NY, USA
Alan Demers
Cornell University, Ithaca, NY, USA
Johannes Gehrke
Cornell University, Ithaca, NY, USA
Walker White
Cornell University, Ithaca, NY, USA
2011 Article
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 155
· Downloads (cumulative): 453
· Citation Count: 6
Published in:
· Proceeding
SIGMOD '11
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Pages 265-276
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0661-4
doi>
10.1145/1989323.1989352
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
checkpointing
database recovery
durability
logical logging
main-memory databases
performance
recovery and restart
reliability
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder