Concurrency_Control_and_Recovery_in_Database_Systems (1)

Concurrency_Control_and_Recovery_in_Database_Systems (1) -...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CONTENTS PREFACE vii 1 THE PROBLEM 1 1.1 Transactions 1 1.2 Recoverability 6 1.3 Serializability 11 1.4 Database System Model 17 2 SERlALlZABlLlTY THEORY 25 2.1 Histories 25 2.2 Serializable Histories 30 2.3 The Serializability Theorem 32 2.4 Recoverable Histories 34 2.5 Operations Beyond Reads and Writes 37 2.6 View Equivalence 38 xi
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
xii CONTENTS 3 TWO PHASE LOCKING 47 3.1 Aggressive and Conservative Schedulers 47 3.2 Basic Two Phase Locking 49 3.3 Correctness of Basic Two Phase Locking* 53 3.4 Deadlocks 56 3.5 Variations of Two Phase Locking 58 3.6 Implementation Issues 60 3.7 The Phantom Problem 64 3.8 Locking Additional Operations 67 3.9 Multigranularity Locking 69 3.10 Distributed Two Phase Locking 77 3.11 Distributed Deadlocks 79 3.12 Locking Performance 87 3.13 Tree Locking 95 4 NON-LOCKING SCHEDULERS 113 4.1 Introduction 113 4.2 Timestamp Ordering (TO) 114 4.3 Serialization Graph Testing (SGT) 121 4.4 Certifiers 128 4.5 Integrated Schedulers 132 5 MULTIVERSION CONCURRENCY CONTROL
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/18/2012 for the course INFORMATIK 2011 taught by Professor Phanthuongcang during the Winter '11 term at Cornell University (Engineering School).

Page1 / 3

Concurrency_Control_and_Recovery_in_Database_Systems (1) -...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online