Cassandra : to be or not to be @ TechTalk
- 1. CASSANDRA To be ornot to be?
- 2. ABOUT ME Andriy Rymar SeniorSoftware Engineer @ Lohika Morning@Lohika Program Committee Member JUG Lviv Active Member 2
- 3.
- 4. AGENDA Cluster Ring 3 Node 4 Node1 Node 2 Node 3
- 5.
- 6. AGENDA Cluster Ring Data Model Read& Write 3 Read Write
- 7. AGENDA Cluster Ring Data Model Read& Write Update & Delete 3 Update Delete
- 8. AGENDA Cluster Ring Data Model Read& Write Update & Delete 3 To be or not to be?
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17. CASSANDRA To be ornot to be?
- 18.
- 19.
- 20.
- 21. DISCOVERY Node3 Node4 Node2 Hi, I’mnode 2 Node1 11
- 22. DISCOVERY Node3 Node4 Node2 OK, hereare you and me Hi, I’m node 2 Node1 11
- 23. DISCOVERY Node3 Node4 Node2 Hi, I’mnode 3 OK, here are you and me Hi, I’m node 2 Node1 11
- 24. DISCOVERY Node3 Node4 Node2 Hi, I’mnode 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 25. DISCOVERY Node3 Node4 Node2 Hi, I’mnode 4 Hi, I’m node 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 26. DISCOVERY Node3 Node4 Node2 Cool, hereare you, me, node2 and node3 Hi, I’m node 4 Hi, I’m node 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 27. DISCOVERY Node3 Node4 Node2 Cool, hereare you, me, node2 and node3 Hi, I’m node 4 Hi, I’m node 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 28. DISCOVERY Node3 Node4 Node2 Cool, hereare you, me, node2 and node3 Hi, I’m node 4 Hi, I’m node 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 29. DISCOVERY Node3 Node4 Node2 Cool, hereare you, me, node2 and node3 Hi, I’m node 4 Hi, I’m node 3 OK, here are you and me Hi, I’m node 2 Well, here are you, me and node2 Node1 11
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39.
- 40.
- 41.
- 42.
- 43. = 2 REPLICATION RF 18 «Hello,TechTalk» Node 1: «Hello, TechTalk» Node2: «Hello, TechTalk»
- 44.
- 45. REPLICATION &TOKENS Node1 RF =2 Node 2Node 3 19
- 46. REPLICATION &TOKENS RF =2 Node 2Node 3 Node1 19
- 47. REPLICATION &TOKENS RF =2 Node 2Node 3 Node1 19
- 48. REPLICATION &TOKENS RF =2 Node 3 Node1 Node 2 node1 Node1 19
- 49. REPLICATION &TOKENS RF =2 Node 3 Node1 Node 2 node1 Node1 19
- 50. REPLICATION &TOKENS RF =2 Node 3 Node1 Node 2 node1 Node1 19
- 51. REPLICATION &TOKENS Node1 RF =2 Node 3 Node 2 node1 19
- 52. REPLICATION &TOKENS Node1 RF =2 Node 3 Node 2 node1 19
- 53. REPLICATION &TOKENS Node1 RF =2 Node 3 Node 2 node1 Node 2 node1 19
- 54.
- 55.
- 56.
- 57.
- 58.
- 59. REPLICATION &V-NODE Node1 RF =2 Node 2Node 3 21
- 60. REPLICATION &V-NODE Node1 RF =2 Node 2Node 3 v-node = 2 21
- 61. Node1 REPLICATION &V-NODE RF =2 Node 2Node 3 v-node = 2 21
- 62. Node1 REPLICATION &V-NODE RF =2 Node 2Node 3 v-node = 2 21
- 63. Node1 REPLICATION &V-NODE RF =2 Node 2Node 3 v-node = 2 21
- 64. Node1 REPLICATION &V-NODE RF =2 Node 2Node 3 v-node = 2 21
- 65. Node1 REPLICATION &V-NODE RF =2 Node 2Node 3 v-node = 2 21
- 66. REPLICATION &V-NODE Node1 RF =2 Node 2Node 3 v-node = 2 21
- 67. REPLICATION &V-NODE Node1 RF =2 Node 2Node 3 v-node = 2 21
- 68.
- 69.
- 70. CASSANDRA To be ornot to be?
- 71.
- 72.
- 73.
- 74.
- 75. KEYSPACE 26 Column Family 1Column Family 2
- 76. KEYSPACE Row 1 Row 2 Row1 Row 2 26 Column Family 1 Column Family 2
- 77. KEYSPACE value value value valuevalue value key key key key key key value value value key key key Row 1 Row 2 Row 1 Row 2 26 Column Family 1 Column Family 2
- 78.
- 79.
- 80.
- 81.
- 82.
- 83.
- 84.
- 85.
- 86.
- 87.
- 88.
- 89. 29 PRIMARY CREATE TABLE album( id uuid, name text, PRIMARY KEY (id) )
- 90. 29 PRIMARY CREATE TABLE album( id uuid, name text, PRIMARY KEY (id) ) Primary & Partition & Clustering
- 91. 30 PARTITION CREATE TABLE author_book( author text, book text, population int, PRIMARY KEY (author, book) )
- 92. 30 PARTITION CREATE TABLE author_book( author text, book text, population int, PRIMARY KEY (author, book) ) Partition Clustering
- 93. 31 COMPOSITE & CLUSTERING CREATETABLE teacher_lesson ( teacher text, lesson text, topic text, duration int, PRIMARY KEY ((teacher, lesson), topic, duration) )
- 94. 31 COMPOSITE & CLUSTERING CREATETABLE teacher_lesson ( teacher text, lesson text, topic text, duration int, PRIMARY KEY ((teacher, lesson), topic, duration) ) Composite Clustering
- 95.
- 96.
- 97.
- 98. 32 IMPORTANT Natural ordering No relations NoACID transactions
- 99. CASSANDRA to be ornot to be?
- 100.
- 101.
- 102.
- 103.
- 104.
- 105. ARCHITECTURE Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Node 35
- 106. ARCHITECTURE Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 35
- 107. Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 35 WRITE
- 108. Request Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 35 WRITE
- 109. Request Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 1 35 WRITE
- 110. Request Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 1 2 35 WRITE
- 111. Request Memory MemTable CommitLog Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node 1 3 4 2 35 WRITE
- 112. Request Memory MemTable CommitLog Permanent storage SSTable 5 SSTable4 SSTable 1 SSTable 2 SSTable 3 Newer Older Node 1 3 4 5 2 35 WRITE
- 113. WRITE Node 1 Node2 Node 3 36
- 114. WRITE Node 1 Node2 Node 3 RF = 3 36
- 115. WRITE Node 1 Node2 Node 3 RF = 3 36 Client
- 116. WRITE Node 1 Node2 Node 3 RF = 3 36 Client
- 117.
- 118.
- 119. WRITE Node 1 Node2 Node 3 RF = 3 38 Client
- 120. WRITE Node 1 Node2 Node 3 RF = 3 38 Client CL = 2
- 121. WRITE Node 3 RF =3 Node 2Node 1 38 Client successsuccess CL = 2
- 122. WRITE Node 3 RF =3 Node 2Node 1 38 Client successsuccess CL = 2
- 123.
- 124.
- 125.
- 126.
- 127. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 39
- 128. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 2 39
- 129. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 2 3 39
- 130. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 2 3 4 39
- 131. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 2 3 4 5 39
- 132. Request READ Memory MemTable Permanent storage Node SSTable 1BFIF SSTable 2BF IF 1 2 3 4 5 6 39
- 133. READ Node 1 Node2 Node 3 40
- 134. READ Node 1 Node2 Node 3 RF = 3 40
- 135. READ Node 1 Node2 Node 3 CL = 2 RF = 3 40
- 136. READ Node 1 Node2 Node 3 CL = 2 RF = 3 40 Client
- 137. READ Node 1 Node2 Node 3 CL = 2 RF = 3 get digest 40 Client
- 138. READ Node 1 Node2 Node 3 CL = 2 RF = 3 get digest 123453 40 Client
- 139. READ Node 1 Node2 Node 3 CL = 2 RF = 3 get digest 123453 40 Client
- 140. CASSANDRA To be ornot to be?
- 141.
- 142.
- 143.
- 144. UPDATE Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 44
- 145. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 44
- 146. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 1 44
- 147. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 1 2 44
- 148. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 1 2 3 44
- 149. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 1 2 3 4 44
- 150. UPDATE Request Memory MemTable Permanent storage SSTable 1SSTable 2 SSTable 3 Newer Older Node CommitLog 1 2 3 4 5 44
- 151.
- 152.
- 153.
- 154.
- 155.
- 156.
- 157.
- 158.
- 159.
- 160.
- 161. CASSANDRA To be ornot to be?
- 162.
- 163.
- 164. THANKYOU My contacts : Email: andriyrav@gmail.com Q / A 52 Twitter : @AndriyRymar