Introduction Dynamo Riak Erlang/OTP Conclusions Basho & Riak basho • Riak is Open-Source • Most developers employed by Basho • Basho can provide professional support Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Dynamo Dynamo: Amazon’s Highly Available Key-value Store This paper presents the design and implementation of Dynamo, a highly available key-value storage system that some of Amazons core services use to provide an always-on experience. [DeCandia et al., 2007] Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions CAP Theorem [Brewer, 2000] • Consistency • Availability • Partition-tolerance Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions CAP Theorem [Brewer, 2000] • Consistency • Availability • Partition-tolerance Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Consistent Hashing [Karger et al., 1997] 0 2160 hash(<>,<>) Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Consistent Hashing [Karger et al., 1997] 0 2160 hash(<>,<>) riak1.example.com Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Consistent Hashing [Karger et al., 1997] 0 2160 hash(<>,<>) riak1.example.com Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Quorum Modes & Values Values: all, quorum, integer Reads: • r • pr Writes: • w • pw • dw Deletes: • r • w • pr • pw • dw • rw Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Quorum Modes & Values Values: all, quorum, integer Reads: • r • pr Writes: • w • pw • dw Deletes: • r • w • pr • pw • dw • rw Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Example Application An Online Shop • Products • Search • Related Products • Categories • Baskets • Invoices Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Products PUT /buckets/products/keys/thingy -3000 Content -Type: application/json {...} GET /buckets/products/keys/thingy -3000 Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Attachments I PUT /buckets/attachments/props n_val =3 r=1 w=all last_write_wins =true Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Basket I One Approach to Eventual Consistency: • Use allow_mult • Teach your application how to resolve conflicts • Fetch all siblings Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Basket II • Each client maintains their own per-session basket (Map product → amount) • Upon fetch, merge into a single basket (Map product → sum(amounts)) In General: • Store the data somewhat like a vector clock • Teach your application how to resolve that structure into an object Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Basket II • Each client maintains their own per-session basket (Map product → amount) • Upon fetch, merge into a single basket (Map product → sum(amounts)) In General: • Store the data somewhat like a vector clock • Teach your application how to resolve that structure into an object • CRDTs: Commutative Replicated Data Types [Shapiro and Baquero, 2011] Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions Conclusions • Distributed databases aren’t trivial • Riak doesn’t hide anything • Riak’s extra features are quite cool Sam Elliott Riak: What’s all the fuss about?
Introduction Dynamo Riak Erlang/OTP Conclusions References Eric A. Brewer. Towards robust distributed systems (abstract). In Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, PODC ’00, pages 7–, New York, NY, USA, 2000. ACM. ISBN 1-58113-183-6. doi: 10.1145/343477.343502. URL http://doi.acm.org/10.1145/343477.343502. Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified data processing on large clusters. Communications of the ACM, 51(1):107–113, 2008. URL http://dl.acm.org/citation.cfm?id=1327492. G. DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: amazon’s highly available key-value store. ACM SIGOPS Operating Systems Review, 41(6):205–220, 2007. URL http://dl.acm.org/citation.cfm?id=1294281. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 654–663. ACM, 1997. URL http://dl.acm.org/citation.cfm?id=258660. Marc Shapiro and C Baquero. A comprehensive study of Convergent and Commutative Replicated Data Types. 2011. URL http://hal.archives-ouvertes.fr/inria-00555588/. Mathias Meyer. Riak Handbook. URL http://riakhandbook.com/. Sam Elliott Riak: What’s all the fuss about?
lenary
ledsun
yuzuy
mot_techtalk
hitokun
beberlei
masatoshiitoh
pineapplecandy
syossan27
skume
m_seki
ufoo68
syumai
productmarketing
phodgson
schacon
jakevdp
andyhume
mclloyd
thekraken
holman
zakiwarfel
lauravandoore
sferik
zenorocha