|
|
|
|
| LEADER |
01726nam a2200205 a 4500 |
| 001 |
485831 |
| 005 |
20171111225914.0 |
| 008 |
930820s1994 caua b 001 0 eng |
| 020 |
|
|
|a 155860104X
|
| 050 |
|
|
|a QA76.545
|b .A86 1994
|
| 082 |
|
|
|2 20
|a 005.74
|
| 245 |
|
|
|a Atomic transactions /
|c Nancy Lynch . . . [et al.]
|
| 260 |
|
|
|a San Mateo, Calif. :
|b Morgan Kaufmann Publishers,
|c c1994.
|
| 300 |
|
|
|a xxi, 500 p. :
|b ill. ;
|c 24 cm.
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
|
|
|a 6.5. General Undo Logging Algorithm -- 7. Timestamp Algorithms. 7.2.Simple-Pseudotime Systems. 7.3. Static Atomicity. 7.4. Reed's Algorithm. 7.5. Type-specific Concurrency Control -- 8. Hybrid Algorithms. 8.2. Hybrid Atomicity. 8.3. Dependency-Based Hybrid Locking-- 9. Relationship to the Classical Theory. 9.2. Assumptions. 9.3. The Serialization Graph Construction. 9.4. Moss's Algorithm. 9.5. Extensionto General Data Types -- 10. Optimistic Algorithms. 10.2. Optimistic Hybrid Systems. 10.3. An Optimistic Dependency-based Algorithm. 10.4.Optimistic Pseudotime Systems. 10.5. An Optimistic Version of Reed's Algorithm -- 11. Orphan Management Algorithms. 11.2. The Orphan Management Problem. 11.3. An Affects Relation. 11.4. Filtered Systems.11.5. Piggyback Systems. 11.6. Strictly Filtered Systems. 11.7. ClockSystems -- 12. Replication. 12.2. Configurations. 12.3. Fixed Configuration Quorum Consensus. 12.4. Reconfigurable Quorum Consensus.12.5. Concurrent Replicated Systems -- A. Mathematical Concepts.
|
| 650 |
|
|
|a Transaction systems (Computer systems)
|
| 650 |
|
|
|a Electronic data processing
|x Distributed processing
|
| 700 |
1 |
|
|a Lynch, Nancy A.
|
| 952 |
|
|
|a GrThPMO
|b 59afd6106c5ad17d7e59bfde
|c 952a
|d 9528
|e -
|t 1
|x m
|z Books
|
