國立虎尾科技大學 |

On transactional concurrency control /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	On transactional concurrency control // Goetz Graefe.
作者:	Graefe, Goetz,
面頁冊數:	1 PDF (xxi, 381 pages) :illustrations (some color). :
附註:	Part of: Synthesis digital library of engineering and computer science.
標題:	Transaction systems (Computer systems) -
電子資源:	https://doi.org/10.2200/S00912ED2V01Y201904DTM059
電子資源:	https://ieeexplore.ieee.org/servlet/opac?bknumber=8737907
ISBN:	9781681735498

On transactional concurrency control /
Graefe, Goetz,

On transactional concurrency control /Goetz Graefe. - 1 PDF (xxi, 381 pages) :illustrations (some color). - Synthesis lectures on data management,#592153-5426 ;. - Synthesis digital library of engineering and computer science..

Part of: Synthesis digital library of engineering and computer science.

Includes bibliographical references.

part 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

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

This 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.

Mode of access: World Wide Web.

ISBN: 9781681735498

Standard No.: 10.2200/S00912ED2V01Y201904DTM059doiSubjects--Topical Terms:

793786
Transaction systems (Computer systems)
Subjects--Index Terms:

concurrency

LC Class. No.: QA76.545 / .G736 2019eb

Dewey Class. No.: 005/.74

On transactional concurrency control /
LDR:07326nam 2201057 i 4500 001 959768
003 IEEE
005 20190702190106.0
006 m eo d
007 cr cn |||m|||a
008 201209s2019 caua fob 000 0 eng d
020 $a 9781681735498 $q electronic
020 $z 9781681735504 $q hardcover
020 $z 9781681735481 $q paperback
024 7 $a 10.2200/S00912ED2V01Y201904DTM059 $2 doi
035 $a (CaBNVSL)thg00979212
035 $a (OCoLC)1107283226
035 $a 8737907
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a QA76.545 $b .G736 2019eb
082 0 4 $a 005/.74 $2 23
100 1 $a Graefe, Goetz, $e author. $3 1253114
245 1 0 $a On transactional concurrency control / $c Goetz Graefe.
264 1 $a [San Rafael, California] : $b Morgan & Claypool, $c 2019.
300 $a 1 PDF (xxi, 381 pages) : $b illustrations (some color).
336 $a text $2 rdacontent
337 $a electronic $2 isbdmedia
338 $a online resource $2 rdacarrier
490 1 $a Synthesis lectures on data management, $x 2153-5426 ; $v #59
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references.
505 0 $a part 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 $a 2. 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 $a 3. 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 $a 4. 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 $a 5. 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 $a part 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 $a 7. 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 $a 8. 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 $a part 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 $a 10. A problem in two-phase commit -- 10.1. References
505 8 $a 11. 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 $a part 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 $a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 $a Compendex
510 0 $a INSPEC
510 0 $a Google scholar
510 0 $a Google book search
520 $a This 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 $a Also available in print.
538 $a Mode of access: World Wide Web.
538 $a System requirements: Adobe Acrobat Reader.
588 $a Title from PDF title page (viewed on June 26, 2019).
650 0 $a Transaction systems (Computer systems) $3 793786
653 $a concurrency
653 $a concurrency control
653 $a database
653 $a update
653 $a transaction
653 $a serializability
653 $a phantom protection
653 $a locking
653 $a index
653 $a b-tree
653 $a key-range locking
653 $a key-value locking
653 $a deadlock avoidance
653 $a lock acquisition sequence
653 $a pessimistic concurrency control
653 $a optimistic concurrency control
653 $a validation
653 $a timestamps
653 $a snapshot isolation
653 $a versioning
653 $a multi-version storage
653 $a write buffer
653 $a distributed systems
653 $a mirroring
653 $a replication
653 $a log shipping
653 $a two-phase commit
653 $a three-phase commit
653 $a controlled lock violation
653 $a deferred lock acquisition
653 $a deferred lock enforcement
653 $a weak lock enforcement
653 $a reserved locks
653 $a pending locks
653 $a orthogonal key-range locking
653 $a orthogonal key-value locking
653 $a partitioning
776 0 8 $i Print version: $z 9781681735481 $z 9781681735504
830 0 $a Synthesis digital library of engineering and computer science. $3 598254
830 0 $a Synthesis lectures on data management ; $v #36. $3 931356
856 4 0 $3 Abstract with links to full text $u https://doi.org/10.2200/S00912ED2V01Y201904DTM059
856 4 2 $3 Abstract with links to resource $u https://ieeexplore.ieee.org/servlet/opac?bknumber=8737907