UID:
almafu_9960073625102883
Umfang:
1 online resource (880 p.)
Ausgabe:
1st edition
ISBN:
9786611024512
,
9781281024510
,
1281024511
,
9780080519562
,
0080519563
Serie:
The Morgan Kaufmann Series in Data Management Systems
Inhalt:
〈br〉 〈br〉〈i〉Transactional Information Systems〈/i〉 is the long-awaited, comprehensive work from leading scientists in the transaction processing field. Weikum and Vossen begin with a broad look at the role of transactional technology in today's economic and scientific endeavors, then delve into critical issues faced by all practitioners, presenting today's most effective techniques for controlling concurrent access by multiple clients, recovering from system failures, and coordinating distributed transactions.〈br〉 〈br〉The authors emphasize formal models that are easily applied across fields, th
Anmerkung:
Description based upon print version of record.
,
Cover; Copyright Page; Foreword; Contents; Preface; Part One: Background and Motivation; Chapter 1. What Is It All About? ; 1.1 Goal and Overview; 1.2 Application Examples; 1.3 System Paradigms; 1.4 Virtues of the Transaction Concept; 1.5 Concepts and Architecture of Database Servers; 1.6 Lessons Learned ; Exercises; Bibliographic Notes; Chapter 2. Computational Models; 2.1 Goal and Overview; 2.2 Ingredients; 2.3 The Page Model; 2.4 The Object Model; 2.5 Road Map of the Book; 2.6 Lessons Learned; Exercises; Bibliographic Notes; Part Two: Concurrency Control
,
Chapter 3. Concurrency Control: Notions of Correctness for the Page Model3.1 Goal and Overview; 3.2 Canonical Concurrency Problems; 3.3 Syntax of Histories and Schedules; 3.4 Correctness of Histories and Schedules; 3.5 Herbrand Semantics of Schedules; 3.6 Final State Serializability; 3.7 View Serializability; 3.8 Conflict Serializability; 3.9 Commit Serializability; 3.10 An Alternative Correctness Criterion: Interleaving Specifications; 3.11 Lessons Learned; Exercises; Bibliographic Notes; Chapter 4. Concurrency Control Algorithms; 4.1 Goal and Overview; 4.2 General Scheduler Design
,
4.3 Locking Schedulers4.4 Nonlocking Schedulers; 4.5 Hybrid Protocols; 4.6 Lessons Learned; Exercises; Bibliographic Notes; Chapter 5. Multiversion Concurrency Control; 5.1 Goal and Overview; 5.2 Multiversion Schedules; 5.3 Multiversion Serializability; 5.4 Limiting the Number of Versions; 5.5 Multiversion Concurrency Control Protocols; 5.6 Lessons Learned; Exercises ; Bibliographic Notes; Chapter 6. Concurrency Control on Objects: Notions of Correctness; 6.1 Goal and Overview; 6.2 Histories and Schedules; 6.3 Conflict Serializability for Flat Object Transactions; 6.4 Tree Reducibility
,
6.5 Sufficient Conditions for Tree Reducibility6.6 Exploiting State Based Commutativity; 6.7 Lessons Learned; Exercises; Bibliographical Notes; Chapter 7. Concurrency Control Algorithms on Objects; 7.1 Goal and Overview; 7.2 Locking for Flat Object Transactions; 7.3 Layered Locking; 7.4 Locking on General Transaction Forests; 7.5 Hybrid Algorithms; 7.6 Locking for Return Value Commutativity and Escrow Locking; 7.7 Lessons Learned; Exercises; Bibliographic Notes; Chapter 8. Concurrency Control on Relational Databases; 8.1 Goal and Overview; 8.2 Predicate-Oriented Concurrency Control
,
8.3 Relational Update Transactions8.4 Exploiting Transaction Program Knowledge; 8.5 Lessons Learned; Exercises; Bibliographic Notes; Chapter 9. Concurrency Control on Search Structures; 9.1 Goal and Overview; 9.2 Implementation of Search Structures by B+ Trees; 9.3 Key Range Locking at the Access Layer; 9.4 Techniques for the Page Layer; 9.5 Further Optimizations; 9.6 Lessons Learned; Exercises; Bibliographic Notes; Chapter 10. Implementation and Pragmatic Issues ; 10.1 Goal and Overview; 10.2 Data Structures of a Lock Manager; 10.3 Multiple Granularity Locking and Dynamic Escalation
,
10.4 Transient Versioning
,
English
Weitere Ausg.:
ISBN 9781558605084
Weitere Ausg.:
ISBN 1558605088
Weitere Ausg.:
ISBN 9780585456829
Weitere Ausg.:
ISBN 0585456828
Sprache:
Englisch
Schlagwort(e):
Einführung
;
Einführung
;
Einführung
