| 注册
首页|期刊导航|计算机工程|高效Key-Value持久化缓存系统的实现

高效Key-Value持久化缓存系统的实现

罗军 陈席林 李文生

计算机工程Issue(3):33-38,6.
计算机工程Issue(3):33-38,6.DOI:10.3969/j.issn.1000-3428.2014.03.007

高效Key-Value持久化缓存系统的实现

Implementation of Energy-efficient Key-Value Persistent Caching System

罗军 1陈席林 1李文生1

作者信息

  • 1. 重庆大学计算机学院,重庆 400044
  • 折叠

摘要

Abstract

Most of the traditional caching systems are based on memory storage in order to achieve higher performance, and their data persistence is not perfect. So these systems may be limited to memory capacity. Also they may lose all the data and be impossible to restore when systems break down. After analyzing the traditional caching systems, this paper applies the Log Structured Merge-Tree(LSM-Tree) theory and Merge-Dump storage engine to improve their data persistence, and then implements a distributed Key-Value persistent caching system Sorted Set DB(SSDB) by referencing the stand-alone persistent storage system LevelDB of Google. It combines SSDB with advantages of traditional caching systems, consistent Hashing, Bloom filter and so on to optimize its performance. It tests the performance of SSDB, and the results show that because of pure memory storage, SSDB can effectively reduce the cost of data storage, and it has just a slight decrease of 600 Query Per Second(QPS) in reading and writing performance compared with Redis.

关键词

LSM-Tree理论/Merge-Dump存储引擎/缓存系统/持久化存储/一致性哈希/布隆过滤器

Key words

LSM-Tree theory/Merge-Dump storage engine/caching system/persistent storage/consistent Hashing/Bloom filter

分类

信息技术与安全科学

引用本文复制引用

罗军,陈席林,李文生..高效Key-Value持久化缓存系统的实现[J].计算机工程,2014,(3):33-38,6.

基金项目

中央高校基本科研业务费专项基金资助项目(CDJZR10180014)。 (CDJZR10180014)

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文