| 000 | 07589nam a2201117 i 4500 | ||
|---|---|---|---|
| 001 | 8737907 | ||
| 003 | IEEE | ||
| 005 | 20200413152932.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 190630s2019 caua fob 000 0 eng d | ||
| 020 |
_a9781681735498 _qelectronic |
||
| 020 |
_z9781681735504 _qhardcover |
||
| 020 |
_z9781681735481 _qpaperback |
||
| 024 | 7 |
_a10.2200/S00912ED2V01Y201904DTM059 _2doi |
|
| 035 | _a(CaBNVSL)thg00979212 | ||
| 035 | _a(OCoLC)1107283226 | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.545 _b.G736 2019eb |
|
| 082 | 0 | 4 |
_a005/.74 _223 |
| 100 | 1 |
_aGraefe, Goetz, _eauthor. |
|
| 245 | 1 | 0 |
_aOn transactional concurrency control / _cGoetz Graefe. |
| 264 | 1 |
_a[San Rafael, California] : _bMorgan & Claypool, _c2019. |
|
| 300 |
_a1 PDF (xxi, 381 pages) : _billustrations (some color). |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 |
_aSynthesis lectures on data management, _x2153-5426 ; _v#59 |
|
| 538 | _aMode of access: World Wide Web. | ||
| 538 | _aSystem requirements: Adobe Acrobat Reader. | ||
| 500 | _aPart of: Synthesis digital library of engineering and computer science. | ||
| 504 | _aIncludes bibliographical references. | ||
| 505 | 0 | _apart I. Published papers. 1. A survey of B-tree locking techniques -- 1.1. Introduction -- 1.2. Preliminaries -- 1.3. Two forms of B-tree locking -- 1.4. Protecting a B-tree's physical structure -- 1.5. Protecting a B-tree's logical contents -- 1.6. Future directions -- 1.7. Summary and conclusions -- 1.8. References | |
| 505 | 8 | _a2. Hierarchical locking in B-tree indexes -- 2.1. Introduction -- 2.2. Related work -- 2.3. Assumptions -- 2.4. Traditional locking hierarchies -- 2.5. Locks on separator keys -- 2.6. Locks on key prefixes -- 2.7. Summary and conclusions -- 2.8. References | |
| 505 | 8 | _a3. Concurrent queries and updates in summary views and their indexes -- 3.1. Introduction -- 3.2. Prior work -- 3.3. Multi-version snapshot isolation -- 3.4. Concurrent updates and linear version history -- 3.5. Logging and recovery -- 3.6. Multi-granularity locking -- 3.7. Update and upgrade locks -- 3.8. Insert and delete -- 3.9. Online index operations -- 3.10. Correctness -- 3.11. Performance -- 3.12. Summary and conclusions -- 3.13. References | |
| 505 | 8 | _a4. Controlled lock violation / Goetz Graefe, Mark Lillibridge, Harumi Kuno, Joseph Tucek, and Alistair Veitch -- 4.1. Introduction -- 4.2. Related prior work -- 4.3. Controlled lock violation -- 4.4. Distributed transactions -- 4.5. Canned transactions -- 4.6. Performance evaluation -- 4.7. Discussion -- 4.8. Summary and conclusions -- 4.9. Acknowledgements -- 4.10. References | |
| 505 | 8 | _a5. Orthogonal key-value locking -- 5.1. Introduction -- 5.2. Prior designs -- 5.3. Orthogonal key-value locking -- 5.4. Case studies -- 5.5. Future opportunities -- 5.6. Conclusions -- 5.7. References | |
| 505 | 8 | _apart II. Optimistic concurrency control. 6. Orthogonal key-value validation -- 6.1. Introduction -- 6.2. Related prior work -- 6.3. Orthogonal key-value validation -- 6.4. Case studies -- 6.5. Alternative approaches -- 6.6. Conclusions -- 6.7. References | |
| 505 | 8 | _a7. Serializable timestamp validation -- 7.1. Introduction -- 7.2. Related prior work -- 7.3. Phantom protection with timestamp validation -- 7.4. Management of timestamps -- 7.5. Hierarchical timestamps -- 7.6. Conclusions -- 7.7. References | |
| 505 | 8 | _a8. Repairing optimistic concurrency control -- 8.1. Introduction -- 8.2. Related prior work -- 8.3. Concurrent validation -- 8.4. Premature publication -- 8.5. Distributed transactions -- 8.6. Conclusions -- 8.7. References | |
| 505 | 8 | _apart III. Locking. 9. Avoiding index-navigation deadlocks -- 9.1. Introduction -- 9.2. Related prior work -- 9.3. Recommended locking sequences -- 9.4. Conclusions -- 9.5. References | |
| 505 | 8 | _a10. A problem in two-phase commit -- 10.1. References | |
| 505 | 8 | _a11. Deferred lock enforcement -- 11.1. Introduction -- 11.2. Related prior work -- 11.3. Deferred lock acquisition -- 11.4. Deferred lock enforcement -- 11.5. Deferred lock enforcement and other techniques -- 11.6. Distributed operations -- 11.7. Summary and conclusions -- 11.8. References | |
| 505 | 8 | _apart IV. The end of optimistic concurrency control. 12. The end of optimistic concurrency control -- 12.1. Introduction -- 12.2. Earlier comparisons -- 12.3. Common misconceptions -- 12.4. Locking in optimistic concurrency control -- 12.5. Advantage : locking -- 12.6. Another quick look at optimistic concurrency control -- 12.7. Recommendations -- 12.8. Conclusions -- 12.9. References. | |
| 506 | _aAbstract freely available; full-text restricted to subscribers or individual document purchasers. | ||
| 510 | 0 | _aCompendex | |
| 510 | 0 | _aINSPEC | |
| 510 | 0 | _aGoogle scholar | |
| 510 | 0 | _aGoogle book search | |
| 520 | _aThis book contains a number of chapters on transactional database concurrency control. 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. | ||
| 530 | _aAlso available in print. | ||
| 588 | _aTitle from PDF title page (viewed on June 26, 2019). | ||
| 650 | 0 | _aTransaction systems (Computer systems) | |
| 653 | _aconcurrency | ||
| 653 | _aconcurrency control | ||
| 653 | _adatabase | ||
| 653 | _aupdate | ||
| 653 | _atransaction | ||
| 653 | _aserializability | ||
| 653 | _aphantom protection | ||
| 653 | _alocking | ||
| 653 | _aindex | ||
| 653 | _ab-tree | ||
| 653 | _akey-range locking | ||
| 653 | _akey-value locking | ||
| 653 | _adeadlock avoidance | ||
| 653 | _alock acquisition sequence | ||
| 653 | _apessimistic concurrency control | ||
| 653 | _aoptimistic concurrency control | ||
| 653 | _avalidation | ||
| 653 | _atimestamps | ||
| 653 | _asnapshot isolation | ||
| 653 | _aversioning | ||
| 653 | _amulti-version storage | ||
| 653 | _awrite buffer | ||
| 653 | _adistributed systems | ||
| 653 | _amirroring | ||
| 653 | _areplication | ||
| 653 | _alog shipping | ||
| 653 | _atwo-phase commit | ||
| 653 | _athree-phase commit | ||
| 653 | _acontrolled lock violation | ||
| 653 | _adeferred lock acquisition | ||
| 653 | _adeferred lock enforcement | ||
| 653 | _aweak lock enforcement | ||
| 653 | _areserved locks | ||
| 653 | _apending locks | ||
| 653 | _aorthogonal key-range locking | ||
| 653 | _aorthogonal key-value locking | ||
| 653 | _apartitioning | ||
| 776 | 0 | 8 |
_iPrint version: _z9781681735481 _z9781681735504 |
| 830 | 0 | _aSynthesis digital library of engineering and computer science. | |
| 830 | 0 |
_aSynthesis lectures on data management ; _v#59. |
|
| 856 | 4 | 0 |
_3Abstract with links to full text _uhttps://doi.org/10.2200/S00912ED2V01Y201904DTM059 |
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=8737907 |
| 999 |
_c562420 _d562420 |
||