That's the slides of my half day workshop at the EFS'11 in Stuttgart where I covered some theoretical aspects of NoSQL data stores relevant for dealing with large data amounts
66. Why can we never be sure till we die . Or have killed for an answer
67. CAP – C onsistency, A vailability, P artition tolerance
68. CAP – the variations CA – irrelevant CP – eventually unavailable offering maximum consistency AP – eventually inconsistent offering maximum availability
126. Hinted handoff N: node, G: group including N node(N) is unavailable replicate to G or store data(N) locally hint handoff for later node(N) is alive handoff data to node(N)
127. Key = “foo” N replicate Key = “foo”, # = N -> handoff hint = true Direct replica fails
133. MapReduce model: functional map/fold out-database MR irrelevant in-database MR: data locality no splitting needed distributed querying distributed processing
134. In-database MapReduce map reduce Node X Node C N = "Alice" map query = "Alice" Node A N = „ Alice" Node B N = "Alice" map hit list
145. Many graphics I’ve created myself, though I better should have asked @mononcqc for help ‘cause his drawings are awesome Some images originate from istockphoto.com except few ones taken from Wikipedia and product pages