All DEFINITION list of "Transactional Information Systems"
Tags: transaction, database, books
Published: 2019-02-06 04:01:37

---
title: All DEFINITION list of "Transactional Information Systems"
published: true
description: 
tags: Transaction,Database,books
---

"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery (The Morgan Kaufmann Series in Data Management Systems)" is a nice book to learning transaction theory.This book contain many definitions. So,I made list of that.




| DEFINITION                                                        | page | 
|-------------------------------------------------------------------|------| 
| 2.1 Partial Order                                                 | 46   | 
| 2.2 Page Model Transaction                                        | 46   | 
| 2.3 Object Model Transaction                                      | 51   | 
| 3.1 Schedules and Histories                                       | 66   | 
| 3.2 Serial History                                                | 67   | 
| 3.3 Herbrand Semantics of Steps                                   | 74   | 
| 3.4 Herbrand Universe                                             | 75   | 
| 3.5 Schedule Semantics                                            | 76   | 
| 3.6 Final State Equivalence                                       | 77   | 
| 3.7 Reads-From Relation                                           | 78   | 
| 3.8 Final State Serializability                                   | 82   | 
| 3.9 View Equivalence                                              | 83   | 
| 3.10 View Serializability                                         | 85   | 
| 3.11 Monotone Classes of Histories                                | 92   | 
| 3.12 Conflicts and Conflict Relations                             | 93   | 
| 3.13 Conflict Equivalence                                         | 93   | 
| 3.14 Conflict Serializability                                     | 94   | 
| 3.15 Conflict Graph (Serialization Graph)                         | 96   | 
| 3.16 Commutativity Based Equivalence                              | 99   | 
| 3.17 Commutativity Based Reducibility                             | 100  | 
| 3.18 Order Preservation                                           | 102  | 
| 3.19 Commit Order Preservation                                    | 102  | 
| 3.20 Closure Properties of Schedule Properties                    | 106  | 
| 3.21 Commit Serializability                                       | 107  | 
| 3.22 Indivisible Units                                            | 111  | 
| 3.23 Dependence of Steps                                          | 113  | 
| 3.24 Relatively Serial Schedule                                   | 113  | 
| 3.25 Relative Serializability                                     | 114  | 
| 3.26 Push Forward and Pull Backward                               | 116  | 
| 3.27 Relative Serialization Graph                                 | 116  | 
| 4.1 CSR Safety                                                    | 130  | 
| 4.2 Two-Phase Locking (2PL)                                       | 134  | 
| 4.3 Conservative 2PL                                              | 142  | 
| 4.4 Strict 2PL                                                    | 143  | 
| 4.5 Strong 2PL                                                    | 144  | 
| 5.1 Version Function                                              | 187  | 
| 5.2 Multiversion Schedule                                         | 188  | 
| 5.3 Monoversion Schedule                                          | 189  | 
| 5.4 Reads-From Relation                                           | 190  | 
| 5.5 View Equivalence                                              | 191  | 
| 5.6 Multiversion View Serializability                             | 192  | 
| 5.7 Version Order                                                 | 194  | 
| 5.8 Multiversion Serialization Graph (MVSG)                       | 195  | 
| 5.9 Multiversion Conflict                                         | 197  | 
| 5.10 Multiversion Reducibility                                    | 198  | 
| 5.11 Multiversion Conflict Serializability                        | 199  | 
| 5.12 Multiversion Conflict Graph                                  | 199  | 
| 6.1 Object Model History                                          | 218  | 
| 6.2 Tree-Consistent Node Ordering                                 | 219  | 
| 6.3 Object Model Schedule                                         | 219  | 
| 6.4 Serial Object Model Schedule                                  | 221  | 
| 6.5 Isolated Subtree                                              | 221  | 
| 6.6 Layered History and Schedule                                  | 222  | 
| 6.7 Flat Object Schedule                                          | 223  | 
| 6.8 Commutative Operations                                        | 224  | 
| 6.9 Commutativity Based Reducibility                              | 226  | 
| 6.10 Conflict Equivalence and Conflict Serializability            | 227  | 
| 6.11 Tree-Reducible History                                       | 229  | 
| 6.12 Level-to-Level Schedule                                      | 234  | 
| 6.13 Conflict Faithfulness                                        | 238  | 
| 6.14 State-Dependent Commutativity                                | 241  | 
| 6.15 Return Value Commutativity                                   | 242  | 
| 8.1 IDM Transaction                                               | 286  | 
| 8.2 Transaction Equivalence                                       | 287  | 
| 8.3 Final State Serializability                                   | 289  | 
| 8.4 Conflict Serializability                                      | 291  | 
| 8.5 Conflict Graph                                                | 291  | 
| 8.6 Extended Conflict Graph and Serializability                   | 293  | 
| 8.7 State Serializability                                         | 296  | 
| 8.8 Transaction Chopping                                          | 302  | 
| 8.9 Chopping Graph                                                | 302  | 
| 8.10 Correct Chopping                                             | 304  | 
| 10.1 Isolation Levels                                             | 361  | 
| 10.2 Multiversion Read Committed and Snapshot Isolation Levels    | 362  | 
| 10.3 Formal Definition of Snapshot Isolation                      | 363  | 
| 10.4 Snapshot Isolation Serialization Graph                       | 363  | 
| 11.1 Expansion of a Schedule                                      | 384  | 
| 11.2 Expanded Conflict Serializability                            | 385  | 
| 11.3 Reducibility                                                 | 387  | 
| 11.4 Prefix Reducibility                                          | 389  | 
| 11.5 Recoverability                                               | 391  | 
| 11.6 Avoiding Cascading Aborts                                    | 392  | 
| 11.7 Strictness                                                   | 393  | 
| 11.8 Rigorousness                                                 | 394  | 
| 11.9 Log Recoverability                                           | 398  | 
| 11.10 Inverse Operation                                           | 408  | 
| 11.11 Perfect Commutativity                                       | 411  | 
| 11.12 Perfect Closure                                             | 413  | 
| 11.13 Normal Commutativity Table                                  | 414  | 
| 11.14 Strictness                                                  | 415  | 
| 11.15 Terminated Subtransactions                                  | 416  | 
| 11.16 Expanded Object Model Schedule                              | 417  | 
| 11.17 Extended Tree Reducibility                                  | 418  | 
| 12.1 Extended History                                             | 434  | 
| 12.2 Stable Log                                                   | 435  | 
| 12.3 Log Buffer                                                   | 435  | 
| 12.4 Cached Database                                              | 436  | 
| 12.5 Stable Database                                              | 437  | 
| 12.6 Correct Crash Recovery                                       | 437  | 
| 12.7 Logging Rules: Redo Rule, Undo Rule, Garbage Collection Rule | 438  | 
| 18.1 Global History                                               | 677  | 
| 18.2 Conflict Serializability                                     | 678  | 
| 18.3 Global History                                               | 692  | 
| 18.4 Direct and Indirect Conflict                                 | 694  | 
| 18.5 Global Conflict Graph                                        | 695  | 
| 18.6 Commit-Deferred Transaction                                  | 699  | 
| 18.7 Extended Commitment Ordering                                 | 701  | 


https://www.amazon.com/dp/1558605088
https://www.elsevier.com/books/transactional-information-systems/weikum/978-1-55860-508-4

This article is translated from my blog post(original is japanese).
http://yuyubu.hatenablog.com/entry/2019/02/05/weikum%E6%9C%AC%E3%81%AB%E8%A8%98%E8%BC%89%E3%81%95%E3%82%8C%E3%81%A6%E3%81%84%E3%82%8B%E5%85%A8%E5%AE%9A%E7%BE%A9%E3%81%AE%E4%B8%80%E8%A6%A7%E3%83%AA%E3%82%B9%E3%83%88