Conflict Resolution for Eventual Consistency • Martin Kleppmann • GOTO 2016
ฝัง
- เผยแพร่เมื่อ 25 ก.ค. 2024
- This presentation was recorded at GOTO Berlin 2016
gotober.com
Martin Kleppmann - Researcher at University of Cambridge @kleppmann
ABSTRACT
What do collaborative editors like Google Docs, the calendar app on your phone, and multi-datacenter database clusters have in common?
Answer: They all need to cope with network interruptions, and still work offline. They all allow state to be updated [...]
Download slides and read the full abstract here:
gotocon.com/berlin-2016/prese...
RECOMMENDED BOOKS
Martin Kleppmann • Designing Data-Intensive Applications • amzn.to/3mk2Roj
Martin Kleppmann • Secret Colors: A Gentle Introduction to Cryptography • amzn.to/3PgAcyj
/ gotocon
/ goto-
/ gotoconferences
Looking for a unique learning experience?
Attend the next GOTO conference near you! Get your ticket at gotopia.tech
Sign up for updates and specials at gotopia.tech/newsletter
SUBSCRIBE TO OUR CHANNEL - new videos posted almost daily.
th-cam.com/users/GotoConf... - วิทยาศาสตร์และเทคโนโลยี
Martin explains things very smoothly, that you can easily understand it. Reading the "Designing Data-intensive applications" book of him and it explains concepts very comprehensively.
This far more better than Netflix! :) We need to clone this man! :)
Netflix should take him into new series
Great talk. Well prepared speaker and well prepared presentation. Excellent explanation of complex topic.
Reading DDIA now, this guy is brilliant.
Simply brilliant! Thank you.
Great stuff! Good follow up after reading "Designing data intensive" book!
Really interesting talk, nicely presented.
Great talk, Martin!
His book is exceptional.
Amazing talk!
So well explained!
very good !!! thank you !
good
49:08, oh yeah we'll check it out :)
Any update for the "Open Challenges"? Is there any another talk about? thanks
May I expect the slides being public some where? Your presentation content is really good!
The slides are linked in the text below the video.
What's the rule behind assuming that 4b>4a ? at 36:00
He already explained that, consider number and node id as separate fields, then first compare number and if they are equal then compare node id. So, in this case 4 == 4 and b > a, hence 4b > 4a
Hi can anyone tell me what software was used to make the slides? I really like the handwritten-looking font and colours. Thanks!
Check out the video at 51:10. :)
On iPad using an app called Paper by a company named 53. He mentions it at the end of his presentation.
So you *did not* solve it. Dios mio. At least you got the conclusion right.
a little nervous
Kane Sun the presenter? That's his usual demeanor. Don't let his outward appearance fool you, mate. He is a master of his field. Or, at least streets ahead of rest of us.