Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Working with Persistent Objects: To Swizzle or Not to Swizzle
IEEE Transactions on Software Engineering
Concepts and applications of multilevel transactions and open nested transactions
Database transaction models for advanced applications
The log-structured merge-tree (LSM-tree)
Acta Informatica
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Recovery mechanisms in database systems
Recovery mechanisms in database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
ARIES-RRH: Restricted Repeating of History in the ARIES Transaction Recovery Method
Proceedings of the Seventh International Conference on Data Engineering
Proceedings of the 17th International Conference on Data Engineering
Group Commit Timers and High Volume Transaction Systems
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Issues in Developing Very Large Data Warehouses
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Repeating History Beyond ARIES
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Redo Recovery after System Crashes
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Applying Database Technology in the ADSM Mass Storage System
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Theory of Computing Systems
B-tree indexes, interpolation search, and skew
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
An adaptive packed-memory array
ACM Transactions on Database Systems (TODS)
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Using Punctuation Schemes to Characterize Strategies for Querying over Data Streams
IEEE Transactions on Knowledge and Data Engineering
Rose: compressed, log-structured replication
Proceedings of the VLDB Endowment
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Definition, detection, and recovery of single-page failures, a fourth class of database failures
Proceedings of the VLDB Endowment
Concurrency control for adaptive indexing
Proceedings of the VLDB Endowment
Self-diagnosing and self-healing indexes
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
ACM Transactions on Database Systems (TODS)
Automatic undo for cloud management via AI planning
HotDep'12 Proceedings of the Eighth USENIX conference on Hot Topics in System Dependability
MLC-flash-friendly logging and recovery for databases
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Supporting undoability in systems operations
LISA'13 Proceedings of the 27th international conference on Large Installation System Administration
Resolving journaling of journal anomaly in android I/O: multi-version B-tree with lazy split
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.02 |
B-trees have been ubiquitous in database management systems for several decades, and they serve in many other storage systems as well. Their basic structure and their basic operations are well understood including search, insertion, and deletion. However, implementation of transactional guarantees such as all-or-nothing failure atomicity and durability in spite of media and system failures seems to be difficult. High-performance techniques such as pseudo-deleted records, allocation-only logging, and transaction processing during crash recovery are widely used in commercial B-tree implementations but not widely understood. This survey collects many of these techniques as a reference for students, researchers, system architects, and software developers. Central in this discussion are physical data independence, separation of logical database contents and physical representation, and the concepts of user transactions and system transactions. Many of the techniques discussed are applicable beyond B-trees.