中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A Low Disk Bound Transaction Logging System for In-Memory Distributed Data Stores

文献类型:会议论文

作者Dayal Dilli; Kenneth B. Kent; Yang Wang; Chengzhong Xu
出版日期2016
会议名称IEEE Cluster
会议地点Taipei, China
英文摘要Transaction logging and snapshotting are techniques used to deliver durability to the data in in-memory data stores. Absolute durability guarantees are delivered to a system by sequentially recording the transaction logs and snapshots to a non-volatile disk. Recent advancements in database restoration techniques have given rise to lock-free fuzzy snapshots. Still the transaction log that completes the fuzzy snapshots is not lock-free. In addition to locking, the major overhead behind the transaction logging technique is the bottleneck involved in storing the logs to a persistent but slower disk. This paper concentrates on implementing an in-memory transaction logging system with a lesser disk dependency. This logging system mainly targets the distributed in-memory data stores that are transaction replicated, eventually consistent and fault tolerant to crash failures. By making logging in-memory, the performance will be improved, but during the crash fails, the state may be lost. On recovery, we restore the current state partially from the locally available fuzzy snapshot and the remaining from the non-failed nodes in the distributed replica. ZooKeeper, a distributed data store that offers distributed coordination as its major service is used to implement and test our research. On average, a 30 times write performance improvement has been achieved with this approach guaranteeing sufficient durability in replicated mode.
收录类别EI
语种英语
源URL[http://ir.siat.ac.cn:8080/handle/172644/10328]  
专题深圳先进技术研究院_数字所
作者单位2016
推荐引用方式
GB/T 7714
Dayal Dilli,Kenneth B. Kent,Yang Wang,et al. A Low Disk Bound Transaction Logging System for In-Memory Distributed Data Stores[C]. 见:IEEE Cluster. Taipei, China.

入库方式: OAI收割

来源:深圳先进技术研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。