Outside The Box With Apache Cassnadra
•
14 likes•1,387 views
Cassandra presentation given at the 3rd annual Palmetto Open Source Software Conference (POSSCON 2010).
Recommended
More Related Content
What's hot
What's hot (20)
Viewers also liked
Similar to Outside The Box With Apache Cassnadra
Similar to Outside The Box With Apache Cassnadra (20)
More from Eric Evans
More from Eric Evans (17)
Recently uploaded
Recently uploaded (20)
Outside The Box With Apache Cassnadra
- 1. Outside The Box With Apache Cassandra Eric Evans eevans@rackspace.com @jericevans Palemetto Open Source Software Conference April 16, 2010
- 2. Cassandra is... A massively scalable, decentralized, structured data store (aka database).
- 3. Outline 1 Background 2 Project History 3 Description 4 Case Studies 5 Roadmap
- 6. Old Guard
- 8. CAP Theorem (aka Brewer’s Theorem) Distributed systems cannot provide all three of: • Consistency • Availability • Partition Tolerance
- 9. Influential Papers Dynamo: Amazon’s Highly Available Key-value Store 1 • Voldemort • Riak Bigtable: A Distributed Storage System for Structured Data 2 • Hypertable • HBase 1 http: //www.allthingsdistributed.com/2007/10/amazons_dynamo.html 2 http://labs.google.com/papers/bigtable-osdi06.pdf
- 10. Outline 1 Background 2 Project History 3 Description 4 Case Studies 5 Roadmap
- 14. • 7 new committers added • Dozens of contributors • 200+ (!) people on IRC • Hundreds of closed issues (bugs, features, etc) • 4 major releases; a number of stable point releases • Graduation to TLP
- 15. Outline 1 Background 2 Project History 3 Description 4 Case Studies 5 Roadmap
- 16. Cassandra is... • O(1) DHT • Eventual consistency • Tunable trade-offs, consistency vs. availability
- 18. But... • Values are structured, indexed • Columns / column families • Slicing w/ predicates (queries)
- 19. Column families
- 21. Client API • Thrift (12 different languages!)3 • High-level client libraries • Ruby • Perl • Python (Twisted too) • Scala • Java • PHP • Grails • C++ 3 http://incubator.apache.org/thrift
- 22. Querying • get(): retrieve by column name • multiget(): by column name for a set of keys • get slice(): by column name, or a range of names • returning columns • returning super columns • multiget slice(): a subset of columns for a set of keys • get count: number of columns or sub-columns • get range slice(): subset of columns for a range of keys
- 23. Updating • insert(): add/update column (by key) • batch insert(): add/update multiple columns (by key) • remove(): remove a column • batch mutate(): like batch insert() but can also delete (new for 0.6, deprecates batch insert())
- 24. Column comparators • TimeUUID • LexicalUUID • UTF8 • Long • Bytes • ...
- 25. Consistency CAP Theorem: choose any two of Consistency, Availability, or Partition tolerance. • Zero • One • Quorum ((N / 2) + 1) • All
- 26. About writes... • Atomic within a column family • Any node • Always writeable (hinted hand-off) • Fast
- 27. Writes
- 28. About reads... • Any node • Read repair • Key cache • Record cache
- 29. Reads
- 30. Outline 1 Background 2 Project History 3 Description 4 Case Studies 5 Roadmap
- 31. Case 1: Digg Digg is a social news site that allows people to discover and share content from anywhere on the Internet by submitting stories and links, and voting and commenting on submitted stories and links. Ranked 98th by Alexa.com.
- 32. Digg
- 33. Problem • Terabytes of data; high transaction rate (reads dominated) • Multiple clusters; heavily sharded • Management nightmare (high effort, error prone) • Unsatisfied availability requirements (geographic isolation)
- 34. Solution • Currently production on ”Green Badges” • Cassandra as primary data store RSN • Datacenter and rack-aware replication
- 35. Case 2: Twitter Twitter is a social networking and microblogging service that enables its users to send and read tweets, text-based posts of up to 140 characters. Ranked 12th by Alexa.com.
- 36. Twitter
- 37. MySQL • Terabytes of data, ˜1,000,000 ops/s • Calls for heavy sharding, light replication • Schema changes are very difficult, (if possible at all) • Manual sharding is very high effort • Automated sharding and replication is Hard
- 38. Case 3: Facebook Facebook is a social networking site where users can create a profile, add friends, and send them messages. Users can also join groups organized by location or other points of common interest. Ranked #2 by Alexa.com.
- 39. Inbox Search • 100 TB • 160 nodes • 1/2 billion writes per day (2yr old number?)
- 40. Outline 1 Background 2 Project History 3 Description 4 Case Studies 5 Roadmap
- 41. 0.6 • batch mutate command • authentication (basic) • new consistency level, ANY • fat client • mmapped i/o reads (default on 64bit jvm) • improved write concurrency (HH) • networking optimizations • row caching • improved management tools • per-keyspace replication factor
- 42. 0.7 • more efficient compactions (row sizes bigger than memory) • easier (dynamic?) column family changes • SSTable versioning • SSTable compression • support for column family truncation • improved configuration handling • remove key range command • even more improved management tools • vector clocks w/ server-side conflict resolution
- 43. Questions?