周亮

0 声望

这家伙太懒，什么都没留下

个人动态
  • 半兽人 回复 周亮 在 kafka持久化 中 ：

    感谢，已优化一部分，明天继续优化！

    7年前
  • 周亮 在 kafka持久化 发表评论：

    This has obvious performance advantages since the performance is completely decoupled from the data size—one server can now take full advantage of a number of cheap, low-rotational speed 1+TB SATA drives. Though they have poor seek performance, these drives have acceptable performance for large reads and writes and come at 1/3 the price and 3x the capacity. 貌似没有翻译…………

    7年前
  • 周亮 在 kafka持久化 发表评论：

    Hence even a handful of disk seeks leads to very high overhead. Since storage systems mix very fast cached operations with very slow physical disk operations, the observed performance of tree structures is often superlinear as data increases with fixed cache--i.e. doubling your data makes things much worse then twice as slow. 这一段貌似没有翻译咯……

    但是它需要一个很高的花费。B树的操作需要 O(logN)。 花费可以改成开销，后面一句话可以加上算法复杂度

    7年前
  • 周亮 在 kafka持久化 发表评论：

    Furthermore this cache will stay warm even if the service is restarted, whereas the in-process cache will need to be rebuilt in memory
    rebuilt 翻译成 重新整理 比 重构 更合适 ，毕竟 后者 一般是用来指 refactor

    7年前
  • 半兽人 回复 周亮 在 kafka消息传递保障 中 ：

    囧，已改正，感谢提醒！

    7年前