技术头条 - 一个快速在微博传播文章的方式     搜索本站
您现在的位置首页 --> MySQL --> 转载:cassandra读写性能原理分析

转载:cassandra读写性能原理分析

浏览:3545次  出处信息

1.  关于cassandra的读性能分析的一篇文章:

     Mike Perham  continues his series now explaining: “reads and […] why they are slow”.

So what happens with a Cassandra read?

  • a client makes a read request to a random node
  • the node acts as a proxy determining the nodes having copies of data
  • the node request the corresponding data from each node
  • the client can select the strength of the read consistency:
    • single read => the request returns once it gets the first response, but data can be stale
    • quorum read => the request returns only after the majority responded with the same value

Mark mentions a couple of corner cases related to this behavior that is more complicated.

  • the node also performs read repair of any inconsistent response
  • each node reading data uses either Memtable (in-memory) or SSTables (disk)

Mike and Jonathan provide a very detailed explanation of the read performance:

Mike: To scan the SSTable, Cassandra uses a row-level column index and bloom filter to find the necessary blocks on disk, deserializes them and determines the actual data to return. There’s a lot of disk IO here which ultimately makes the read latency higher than a similar DBMS.

Jonathan: The reason uncached reads are slower in Cassandra is not because the SSTable is inherently io-intensive (it’s actually better than b-tree based storage on a 1:1 basis) but because in the average case you’ll have to merge row fragments from 2-4 SSTables to complete the request, since SSTables are not update-in-place.

It is also important to note that Cassandra employs row caching that addresses reads latency.

 

2.  关于cassandra的写性能分析的一篇文章:

An interesting explanation of how Cassandra write ops are happening:

  • client submits its write request to a single, random Cassandra node
  • the node behavior is similar to a proxy writing data to the cluster
  • writes are replicated to N nodes according to the replication placement strategy (the details of RackAwareStrategy are quite interesting)
  • each of the N nodes performs 2 actions when receiving a write (in the form of RowMutation):
    • append the mutation to the commit log for transactional purposes
    • update an in-memory Memtable structure with the change

There are also a couple of asynchronous operations:

  • Memtable is written to disk in a structure called SSTable
  • SSTables corresponding to a column family are merged into a raw ColumnFamily datafile.

参考文档:

 http://nosql.mypopescu.com/post/474623402/cassandra-reads-performance-explained

 http://nosql.mypopescu.com/post/454521259/cassandra-write-operation-performance-explained 

建议继续学习:

  1. Cassandra和HBase主要设计思路对比    (阅读:4131)
  2. Cassandra存储机制    (阅读:3820)
  3. Twitter停用Cassandra原因分析    (阅读:3055)
  4. Cassandra之Token    (阅读:2955)
  5. Cassandra运维之道    (阅读:2802)
  6. Cassandra数据模型    (阅读:2789)
  7. 深入浅出cassandra 4 数据一致性问题概述    (阅读:2757)
  8. Cassandra运维之道 v0.2    (阅读:2219)
  9. 深入浅出cassandra 1 安装    (阅读:2089)
  10. 深入浅出cassandra 3 例子背后的模型    (阅读:1917)
QQ技术交流群:445447336,欢迎加入!
扫一扫订阅我的微信号:IT技术博客大学习
© 2009 - 2024 by blogread.cn 微博:@IT技术博客大学习

京ICP备15002552号-1