Live briefing
Everything about Two-phase locking
Concurrency control method
In databases and transaction processing, two-phase locking (2PL) is a pessimistic concurrency control method that guarantees conflict-serializability. It is also the name of the resulting set of database transaction schedules (histories). The protocol uses locks, applied by a transaction to data, which may block other transactions from accessing the same data during the transaction's life. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Two-phase lockingA 5-minute orientation
- Skim a recent paper: Tunable two-dimensional laser arrays with zero-phase lockingInfluential work since 2022
- Pick up a classic book: Lock-in amplifiersThe most-reprinted book on the subject
- Read the landmark paper: Two-phase locking performance and its thrashing behaviorCited 54 times
- Go sideways: Commitment orderingA closely related topic
- Go sideways: Concurrency controlA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Two-phase locking performance and its thrashing behavior
Performance analysis of two-phase locking
Rectification and Phase Locking for Particles on Symmetric Two-Dimensional Periodic Substrates
Phase locking of two coupled lasers with many longitudinal modes
Phase locking of two strongly coupled vircators
Phase locking two beams by means of seeded Brillouin scattering
Phase locking of two fiber lasers with time-delayed coupling
Phase locking of two limit cycle oscillators with delay coupling
🆕 Influential since 2022
Tunable two-dimensional laser arrays with zero-phase locking
Two-Photon Pumped Phase Locking of Random Lasers in Hybrid Perovskite Multi-Crystalline Microdisks
Phase-amplitude reduction and optimal phase locking of collectively oscillating networks
Asymptotic phase-locking and synchronization in two-qubit systems
Scalable Timestamp Allocation for Deadlock Prevention in Two-phase Locking based Protocols
📚 Books worth reading
Lock-in amplifiersM. L. Meade · 1983
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Commitment ordering Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related…
- Concurrency control In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency…
- Isolation (database systems) In database systems, isolation is one of the ACID (Atomicity, Consistency, Isolation, Durability) transaction properties. It determines how transaction…
- Lock (computer science) In computer science, a lock or mutex (from mutual exclusion) is a synchronization primitive that prevents state from being modified or accessed by multiple…
- Write–write conflict In computer science, in the field of databases, write–write conflict, also known as overwriting uncommitted data is a computational anomaly associated…
- Database transaction schedule In the fields of databases and transaction processing (transaction management), a schedule (or history) of a system is an abstract model to describe the…
- Multiple granularity locking In computer science, multiple granularity locking (MGL) is a locking method used in database management systems (DBMS) and relational databases. In multiple…
- Read–write conflict In computer science, in the field of databases, read–write conflict, also known as unrepeatable reads, is a computational anomaly associated with interleaved…