On Transactional Concurrency Control (Record no. 84941)

000 -LEADER
fixed length control field 03241nam a22005055i 4500
001 - CONTROL NUMBER
control field 978-3-031-01873-2
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163738.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2019 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031018732
-- 978-3-031-01873-2
082 04 - CLASSIFICATION NUMBER
Call Number 004.6
100 1# - AUTHOR NAME
Author Graefe, Goetz.
245 10 - TITLE STATEMENT
Title On Transactional Concurrency Control
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2019.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XXI, 383 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Data Management,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01873-2
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2019.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer networks .
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Information theory.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data Structures and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2153-5426
912 ## -
-- ZDB-2-SXSC

No items available.