The document discusses various concurrency control techniques for database systems, including lock-based protocols, timestamp-based protocols, and graph-based protocols. Lock-based protocols use locks to control concurrent access to data with different lock modes. Timestamp-based protocols assign timestamps to transactions and manage concurrency to ensure transactions execute in timestamp order. Graph-based protocols impose a partial ordering on data items modeled as a directed acyclic graph.

44. Deadlock Detection (Cont.) Wait-for graph without a cycle Wait-for graph with a cycle

53. End of Chapter

54. Partial Schedule Under Two-Phase Locking

55. Incomplete Schedule With a Lock Conversion

56. Lock Table

57. Tree-Structured Database Graph

58. Serializable Schedule Under the Tree Protocol

59. Schedule 3

60. Schedule 4

61. Schedule 5, A Schedule Produced by Using Validation

62. Granularity Hierarchy

63. Compatibility Matrix

64. Wait-for Graph With No Cycle

65. Wait-for-graph With A Cycle

66. Nonserializable Schedule with Degree-Two Consistency

67. B + -Tree For account File with n = 3.

68. Insertion of “Clearview” Into the B + -Tree of Figure 16.21

69. Lock-Compatibility Matrix