Your SlideShare is downloading. ×
Cassandra: a NoSQL storage system
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Saving this for later?

Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime - even offline.

Text the download link to your phone

Standard text messaging rates apply

Cassandra: a NoSQL storage system

812
views

Published on

Published in: Technology

0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
812
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
16
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Cassandra - ADecentralizedStructured StorageSystemAvinash Lakshman, FacebookPrashant Malik, Facebook Iván Carballo icf1e11@ecs.soton.ac.uk
  • 2. Content• Introduction• Data Model• API• System architecture• Performance example• Conclusion 2
  • 3. Introduction• Cassandra is a NoSQL database.• Originally developed by Facebook.• Cassandra was designed to: • Manage large amounts of structured data. • Run at tope of a system of hundreds of nodes. • Handle high write throughput. • Run on cheap hardware (scale out). • Provide high scalability, reliability and performance. 3
  • 4. Data Model 4Source: http://www.inmensia.com/blog/20100327/desmitificando_a_cassandra.html
  • 5. Data Model (Example) 5Source: http://www.divconq.com/2010/how-to-add-and-retrieve-data-from-a-cassandra-database/
  • 6. API (Application Programming Interface)• Three simple methods: • insert (table, key, rowMutation) • get (table, key, columnName) • delete (table, key, columnName) 6
  • 7. System architecture• Partitioning • Data is partitioned dynamically over a set of nodes. • Uses consistent hashing.• Replication • Each data item is replicated at N hosts.• Failure detection • Every node knows if the rest of nodes in the system are up or down. 7
  • 8. Performance example• Facebook Inbox Search • More than 50 TB • 150 nodes • Different datacentres (west and east cost)• Read performance: Latency Search interactions Term search Min 7.69 ms 7.78 ms Median 15.69 ms 18.27 ms Max 26.13 ms 44.41 ms 8
  • 9. Conclusion• They successfully implemented a system which provides: • Scalability • High performance • Wide applicability 9
  • 10. PaperA. Lakshman and P. Malik, “Cassandra: adecentralized structured storage system”, ACMSIGOPS Operating Systems Review, vol. 44, n. 2,pp. 35-40, April 2010. 10
  • 11. THANK YOUANY QUESTIONS? 11