Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Disk Read-Write Optimizations and Data Integrity in Transaction Systems Using Write-Ahead Logging
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
An analysis of latent sector errors in disk drives
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An analysis of data corruption in the storage stack
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Warding off the dangers of data corruption with amulet
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
Foundations and Trends in Databases
Self-diagnosing and self-healing indexes
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The three traditional failure classes are system, media, and transaction failures. Sometimes, however, modern storage exhibits failures that differ from all of those. In order to capture and describe such cases, single-page failures are introduced as a fourth failure class. This class encompasses all failures to read a data page correctly and with plausible contents despite all correction attempts in lower system levels. Efficient recovery seems to require a new data structure called the page recovery index. Its transactional maintenance can be accomplished writing the same number of log records as today's efficient implementations of logging and recovery. Detection and recovery of a single-page failure can be sufficiently fast that the affected data access is merely delayed, without the need to abort the transaction.