Graefe, Goetz.
On Transactional Concurrency Control [electronic resource] / by Goetz Graefe. - 1st ed. 2019. - XXI, 383 p. online resource. - Synthesis Lectures on Data Management, 2153-5426 . - Synthesis Lectures on Data Management, .
On Transactional Concurrency Control -- A Survey of B-Tree Locking Techniques -- Hierarchical Locking in B-Tree Indexes -- Concurrent Queries and Updates in Summary Views and Their Indexes -- Controlled Lock Violation -- Orthogonal Key-Value Locking -- Orthogonal Key-Value Validation -- Serializable Timestamp Validation -- Repairing Optimistic Concurrency Control -- Avoiding Index-Navigation Deadlocks -- A Problem in Two-Phase Commit -- Deferred Lock Enforcement -- The End of Optimistic Concurrency Control -- Author's Biography.
This book contains a number of chapters on transactional database concurrency control. This volume's entire sequence of chapters can summarized as follows: A two-sentence summary of the volume's entire sequence of chapters is this: traditional locking techniques can be improved in multiple dimensions, notably in lock scopes (sizes), lock modes (increment, decrement, and more), lock durations (late acquisition, early release), and lock acquisition sequence (to avoid deadlocks). Even if some of these improvements can be transferred to optimistic concurrency control, notably a fine granularity of concurrency control with serializable transaction isolation including phantom protection, pessimistic concurrency control is categorically superior to optimistic concurrency control, i.e., independent of application, workload, deployment, hardware, and software implementation.
9783031018732
10.1007/978-3-031-01873-2 doi
Computer networks .
Data structures (Computer science).
Information theory.
Computer Communication Networks.
Data Structures and Information Theory.
TK5105.5-5105.9
004.6
On Transactional Concurrency Control [electronic resource] / by Goetz Graefe. - 1st ed. 2019. - XXI, 383 p. online resource. - Synthesis Lectures on Data Management, 2153-5426 . - Synthesis Lectures on Data Management, .
On Transactional Concurrency Control -- A Survey of B-Tree Locking Techniques -- Hierarchical Locking in B-Tree Indexes -- Concurrent Queries and Updates in Summary Views and Their Indexes -- Controlled Lock Violation -- Orthogonal Key-Value Locking -- Orthogonal Key-Value Validation -- Serializable Timestamp Validation -- Repairing Optimistic Concurrency Control -- Avoiding Index-Navigation Deadlocks -- A Problem in Two-Phase Commit -- Deferred Lock Enforcement -- The End of Optimistic Concurrency Control -- Author's Biography.
This book contains a number of chapters on transactional database concurrency control. This volume's entire sequence of chapters can summarized as follows: A two-sentence summary of the volume's entire sequence of chapters is this: traditional locking techniques can be improved in multiple dimensions, notably in lock scopes (sizes), lock modes (increment, decrement, and more), lock durations (late acquisition, early release), and lock acquisition sequence (to avoid deadlocks). Even if some of these improvements can be transferred to optimistic concurrency control, notably a fine granularity of concurrency control with serializable transaction isolation including phantom protection, pessimistic concurrency control is categorically superior to optimistic concurrency control, i.e., independent of application, workload, deployment, hardware, and software implementation.
9783031018732
10.1007/978-3-031-01873-2 doi
Computer networks .
Data structures (Computer science).
Information theory.
Computer Communication Networks.
Data Structures and Information Theory.
TK5105.5-5105.9
004.6