• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Software Engineering and Service Science >Improve the Performance of LSM-Tree Based Key-Value via Multiple Immutable MemTables
【24h】

Improve the Performance of LSM-Tree Based Key-Value via Multiple Immutable MemTables

机译：通过多个不可变形记忆库提高基于LSM树的键值的性能

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the advent of the era of big data, key-value storage systems based on LSM-Tree have been widely used. Because of its excellent writing performance, it is favored by data centers. LSM-Tree is divided into two parts, one that SkipList structure located in the memory and the other that level structure resident in the disk. The SkipList structure involves two modules, MemTable and Immutable MemTable, which speed up its read and write performance. However, Immutable MemTable is only single and unchangeable, which will cause the thread to block and affect access efficiency in terms of write-intensive workloads. To solve the issue, we propose multiple Immutable MemTables for rotating storage to improve write performance. Furthermore, due to the increase of memory-resident data in the MemTables, the read rate is also enhanced. Through running the benchmarks of the LevelDB system, In the case of less than 1000,000 key-value items, the read performance can be improved by 15%~65%, and when it comes to less than 10000,000 key-value items, the write performance can be improved by 15%~71%.
机译：随着大数据时代的出现，基于LSM树的键值存储系统已被广泛使用。由于其写作表现优异，它受到数据中心的青睐。 LSM树分为两个部分，一个位于内存中的Skiplist结构，另一个驻留在磁盘中的水平结构。 Skiplist结构涉及两个模块，Mementable和Uncutible Mementable，其加速其读写性能。但是，不可变的Memtable只是单一和不可改变的，这将导致线程阻塞并影响写入密集型工作负载的访问效率。要解决此问题，我们提出了多个不可变记忆库来旋转存储以提高写性能。此外，由于MEMTABLE中的存储器驻留数据的增加，还增强了读取速率。通过运行LeveldB系统的基准，在少于1000,000个密钥值项目的情况下，读取性能可以提高15％〜65％，并且当到少于1000万键值时，写性能可以提高15％〜71％。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号