Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
MLR: a recovery method for multi-level systems
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Towards a unified theory of concurrency control and recovery
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unifying concurrency control and recovery of transactions
Information Systems - Special issue on extending database technology
Concurrency control and recovery methods for B+-tree indexes: ARIES/KVL and ARIES/IM
Performance of concurrency control mechanisms in centralized database systems
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Unifying concurrency control and recovery of transactions with semantically rich operations
Theoretical Computer Science - Special issue: database theory
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Key Range Locking Strategies for Improved Concurrency
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We consider transactions running on a database that consists of records with unique totally-ordered keys and is organized as a sparse primary search tree such as a B-tree index on disk storage.We extend the classical read-write model of transactions by considering inserts, deletes and key-range scans and by distinguishing between four types of transaction states: forward-rolling, committed, backward-rolling, and rolled-back transactions. A search-tree transaction is modelled as a two-level transaction containing structure modifications as open nested subtran-sactions that can commit even though the parent transaction aborts. Isolation conditions are defined for search-tree transactions with nested structure modifications that guarantee the structural consistency of the search tree, a required isolation level (including phantom prevention) for database operations, and recoverability for structure modifications and database operations.