Utah PHP Users Group - 2012
•Download as KEY, PDF•
0 likes•1,904 views
Introduction slide deck to Riak using the PHP client.
Recommended
More Related Content
Viewers also liked
Viewers also liked (20)
Similar to Utah PHP Users Group - 2012
Similar to Utah PHP Users Group - 2012 (20)
Recently uploaded
Recently uploaded (20)
Utah PHP Users Group - 2012
- 2. Randy Secrist @randysecrist rsecrist@basho.com
- 6. Riak is a Database
- 7. Riak is Open Source http://git.io/basho http://git.io/riak http://git.io/riak_core http://git.io/riak_kv
- 9. Eventual ... Consistency
- 10. CAP • Consistency • Availability • Partitioning
- 11. BASE • Basically • Available • Soft • State
- 12. Riak’s Strong Areas • Availability • Partitioning
- 13. Riak is also ...
- 14. • Fault-Tolerant • Highly-Available • Geo Distributable, horizontally scaleable • Built for the Web
- 15. Fault-Tolerant • All nodes participate equally - no SPOF • All data is replicated • Cluster transparently survives ... • node failures • network partitions • Built on Erlang/OTP (designed for FT)
- 16. Highly-Available • Masterless: Any node can service client requests. • Fallbacks are used when nodes are down. • Always accepts read and write requests. • Per-Request Quorums
- 17. SCALES
- 18. Geo Distributable & Horizontally Scalable • Default configuration is in a cluster • Load and data are spread evenly • Add more nodes to get more X • Multi Data Center Replication*
- 19. Built for the Web • HTTP is default (but not only) interface • Does HTTP/REST well (see Webmachine) • Plays well with HTTP infrastructure - reverse proxy caches, load balancers, web servers. • Suitable for many web and mobile applications.
- 20. Riak Features
- 21. Native APIs
- 22. HTTP
- 23. Protocol Buffers
- 24. Client Libraries
- 25. Erlang
- 26. Ruby
- 27. Java
- 28. Python
- 30. Many more client libraries http://wiki.basho.com/Client-Libraries.html
- 31. Querying • Key Value - get, put, delete • Value is mostly opaque (some metadata) • Secondary Indexes • Map Reduce • Links • Full Text Search (Lucene Style)
- 32. Storage Backends • Bitcask • LevelDB • Memory • Multi
- 33. Request Quorums • Every request contacts all replicas of key • N - number of replicas (default 3) • R - read quorum • W - write quorum
- 34. Hands on! Setting it Up!
- 37. Use ‘join’ command to build a cluster
- 38. Main Config File etc/app.config
- 39. Rekon https://github.com/basho/rekon curl -s rekon.basho.com | sh or curl -s rekon.basho.com | node=node-addr:port sh
- 40. PHP Client Demo
- 41. Connecting to Riak require_once('riak-php-client/riak.php'); $client = new RiakClient('127.0.0.1', 8098);
- 43. Writing Data $person = $bucket->newObject(‘jack’,array( ‘name’ => “Jack Bauer”, ‘age’ => 24, ‘hobbies’ => “Interrogation” )); $person->store();
- 44. Getting Data $jack = $bucket->get('jack'); $me = $bucket->get('randy');
- 45. Riak Objects foreach ($me->data as $key =>$value) print($key);
- 46. PHP Documentation Readme: http://git.io/pk5umA PHP Docs: http://git.io/9YYaKQ
- 47. s3:// compatible layer http://basho.com/products/riakcs
- 48. Thank You!
- 49. References • http://www.infoq.com/articles/cap-twelve-years-later-how-the-rules-have-changed • http://www.odbms.org/blog/2012/08/on-eventual-consistency-an-interview-with-justin-sheehy/ • http://pbs.cs.berkeley.edu/#demo • https://github.com/basho/riak-php-client/blob/master/README.md
- 50. Credits • Slides by Casey Rosenthal • Slides by Bryce Kerley
- 51. Consistent Hashing & The Ring
- 52. Consistent Hashing & The Ring • 160-bit integer keyspace 0 2 160/4 2 160/2
- 53. Consistent Hashing & The Ring • 160-bit integer keyspace • Divided into fixed 0 number of evenly-sized partitions 32 partitions 2 160/4 2 160/2
- 54. Consistent Hashing & The Ring node 0 node 1 • 160-bit integer keyspace node 2 • Divided into fixed 0 node 3 number of evenly-sized partitions • Partitions are claimed by 32 partitions 2 160/4 nodes in the cluster 2 160/2
- 55. Consistent Hashing & The Ring node 0 node 1 • 160-bit integer keyspace node 2 • Divided into fixed node 3 number of evenly-sized partitions • Partitions are claimed by nodes in the cluster • Replicas go to the N partitions following the key
- 56. Consistent Hashing & The Ring node 0 node 1 • 160-bit integer keyspace node 2 • Divided into fixed node 3 number of evenly-sized partitions • Partitions are claimed by nodes in the cluster N=3 • Replicas go to the N partitions following the key hash(“utah/uphpu”)
- 57. Hinted Handoff
- 58. Hinted Handoff • Node fails X X X X X X X X
- 59. Hinted Handoff • Node fails X X • Requests go to fallback X X X X X X hash(“utah/uphpu”)
- 60. Hinted Handoff • Node fails • Requests go to fallback • Node comes back hash(“utah/uphpu”)
- 61. Hinted Handoff • Node fails • Requests go to fallback • Node comes back • “Handoff” - data returns to recovered node hash(“utah/uphpu”)
- 62. Hinted Handoff • Node fails • Requests go to fallback • Node comes back • “Handoff” - data returns to recovered node • Normal operations resume hash(“utah/uphpu”)
- 64. Riak Architecture Erlang/OTP Runtime Riak KV
- 65. Riak Architecture Erlang/OTP Runtime Client APIs Riak KV
- 66. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Riak KV
- 67. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Riak KV
- 68. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Riak KV
- 69. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination Riak KV
- 70. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce Riak KV
- 71. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce Riak Core Riak KV
- 72. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing Riak Core Riak KV
- 73. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing membership Riak Core Riak KV
- 74. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff membership Riak Core Riak KV
- 75. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff membership node-liveness Riak Core Riak KV
- 76. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness Riak Core Riak KV
- 77. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness buckets Riak Core Riak KV
- 78. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness buckets Riak Core vnode master Riak KV
- 79. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness buckets Riak Core vnode master vnodes Riak KV
- 80. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness buckets Riak Core vnode master vnodes storage backend Riak KV
- 81. Riak Architecture Erlang/OTP Runtime Client APIs HTTP Protocol Buffers Erlang local client Request Coordination get put delete map-reduce consistent hashing handoff gossip membership node-liveness buckets Riak Core vnode master vnodes JS Runtime storage backend Riak KV
Editor's Notes
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- Used for moving data around & dealing with failures - without applications noticing.\n\ndue to how data is replicated, there is no SPOF, or master / slave setup.\n\ndue to no SPOF and how replication is done, every node in the cluster looks the same.\n - can read and write from each node\n - turns out to be operationally friendly.\n\n\nAT&T for mHealth is using Riak replication across multiple data centers.\n\n
- always accepts writes.\n - (will not talk in detail, but you can ask me questions, send me email, or bug me on twitter).\n - causes the need to read repair.\n - eventually consistent. (tough for some people to grok at first).\n - ask me questions, or find me after & we can chat all day long about it.\n
- \n
- X = throughput, compute power for MapReduce, storage, lower latency\nData center replication. Focus on disaster survival vs recovery.\nenables us to have local data access no matter where you are.\n\n
- Basic operations are done over HTTP or a Protocol Buffer interface.\n\ndon’t spend much time here\n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- will not talk about in detail, but you can ask questions\n - again, twitter\n\ndon’t spend much time here\n
- will not talk about in detail, but you can ask questions\n - again, twitter\n\ndon’t spend much time here\n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- will not talk about in detail, but you can ask questions\n - again, twitter\n\ndon’t spend much time here\n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n
- \n