Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
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
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
A history and evaluation of System R
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
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
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
Redo Recovery after System Crashes
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
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
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Shore-MT: a scalable storage manager for the multicore era
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Organization and maintenance of large ordered indices
SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Aether: a scalable approach to logging
Proceedings of the VLDB Endowment
Data-oriented transaction execution
Proceedings of the VLDB Endowment
Dealing proactively with data corruption: Challenges and opportunities
ICDEW '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering Workshops
PLP: page latch-free shared-everything OLTP
Proceedings of the VLDB Endowment
A survey of B-tree logging and recovery 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
Foundations and Trends in Databases
Self-diagnosing and self-healing indexes
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
From A to E: analyzing TPC's OLTP benchmarks: the obsolete, the ubiquitous, the unexplored
Proceedings of the 16th International Conference on Extending Database Technology
A scalable lock manager for multicores
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
Foster B-trees are a new variant of B-trees that combines advantages of prior B-tree variants optimized for many-core processors and modern memory hierarchies with flash storage and nonvolatile memory. Specific goals include: (i) minimal concurrency control requirements for the data structure, (ii) efficient migration of nodes to new storage locations, and (iii) support for continuous and comprehensive self-testing. Like Blink-trees, Foster B-trees optimize latching without imposing restrictions or specific designs on transactional locking, for example, key range locking. Like write-optimized B-trees, and unlike Blink-trees, Foster B-trees enable large writes on RAID and flash devices as well as wear leveling and efficient defragmentation. Finally, they support continuous and inexpensive yet comprehensive verification of all invariants, including all cross-node invariants of the B-tree structure. An implementation and a performance evaluation show that the Foster B-tree supports high concurrency and high update rates without compromising consistency, correctness, or read performance.