Central Library

Normal view MARC view ISBD view

On Transactional Concurrency Control [electronic resource] / by Goetz Graefe.

By: Graefe, Goetz [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Data Management: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2019Edition: 1st ed. 2019.Description: XXI, 383 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031018732.Subject(s): Computer networks  | Data structures (Computer science) | Information theory | Computer Communication Networks | Data Structures and Information TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 004.6 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.