000			02980nam a22004095i 4500
999			_c387275 _d387275
001			387275
003			ES-MaUEC
005			20230220164818.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2019 sz | s |||| 0|eng d
020			_a9783031018732
024	7		_a10.1007/978-3-031-01873-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.545 _b2019 EB
100	1		_aGraefe, Goetz _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686950
245	1	0	_aOn Transactional Concurrency Control _cby Goetz Graefe
250			_a1st edition 2019
264		1	_aCham _bSpringer International Publishing _c2019
300			_a1 recurso en línea (XXI, 383 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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.
988			_aSynthesis Collection of Technology_2019
650		7	_2embne _9161392 _aSistemas informáticos
776	0	8	_iPrinted edition: _z9783031001000
776	0	8	_iPrinted edition: _z9783031007453
776	0	8	_iPrinted edition: _z9783031030017
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-01873-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2023 _dz _esc _zSI