000 03241nam a22005055i 4500
001 978-3-031-01873-2
003 DE-He213
005 20240730163738.0
007 cr nn 008mamaa
008 220601s2019 sz | s |||| 0|eng d
020 _a9783031018732
_9978-3-031-01873-2
024 7 _a10.1007/978-3-031-01873-2
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
100 1 _aGraefe, Goetz.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_980336
245 1 0 _aOn Transactional Concurrency Control
_h[electronic resource] /
_cby Goetz Graefe.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXXI, 383 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Data Management,
_x2153-5426
505 0 _aOn 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 _aThis 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.
650 0 _aComputer networks .
_931572
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 1 4 _aComputer Communication Networks.
_980337
650 2 4 _aData Structures and Information Theory.
_931923
710 2 _aSpringerLink (Online service)
_980338
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031001000
776 0 8 _iPrinted edition:
_z9783031007453
776 0 8 _iPrinted edition:
_z9783031030017
830 0 _aSynthesis Lectures on Data Management,
_x2153-5426
_980339
856 4 0 _uhttps://doi.org/10.1007/978-3-031-01873-2
912 _aZDB-2-SXSC
942 _cEBK
999 _c84941
_d84941