Update migration: an efficient B+ tree for flash storage

Authors:
Chang Xu;Lidan Shou;Gang Chen;Cheng Yan;Tianlei Hu
Affiliations:
College of Computer Science department, Zhe Jiang University, Hang zhou, China;College of Computer Science department, Zhe Jiang University, Hang zhou, China;College of Computer Science department, Zhe Jiang University, Hang zhou, China;College of Computer Science department, Zhe Jiang University, Hang zhou, China;College of Computer Science department, Zhe Jiang University, Hang zhou, China
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Year:
2010

Citing 16
Cited 0

ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging

ACM Transactions on Database Systems (TODS)
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Concurrency control and recovery methods for B+-tree indexes: ARIES/KVL and ARIES/IM

Performance of concurrency control mechanisms in centralized database systems
The log-structured merge-tree (LSM-tree)

Acta Informatica
Concurrency and recovery in generalized search trees

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees

ACM Transactions on Database Systems (TODS)
Concurrent operations on B-trees with overtaking

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Design of flash-based DBMS: an in-page logging approach

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A reliable B-tree implementation over flash memory

Proceedings of the 2008 ACM symposium on Applied computing
Design tradeoffs for SSD performance

ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Flash Disk Opportunity for Server Applications

Queue - Enterprise Flash Storage
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory

ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Flash memories: successes and challenges

IBM Journal of Research and Development
In-Page Logging B-Tree for Flash Memory

DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Tree Indexing on Flash Disks

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Lazy-Adaptive Tree: an optimized index structure for flash devices

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

More and more evidence indicates that flash storage is a potential substitute for magnetic disk in the foreseeable future. Due to the high-speed random reads, flash storage could improve the performance of DBMS significantly in OLTP applications. However, previous research has shown that small-to-moderate random overwrites on flash are particularly expensive, which implies that the conventional DBMS is not ready to run on the flash storage. In this paper, we propose the design of a variant of B+ tree for flash storage, namely the Update-Migration B+ tree. In the UM-B+ tree, small quantity of updates will be migrated, rather than being executed directly, to its parent node in the form of update records when a dirty node is evicted from main memory. Further accesses to the child node will cause the update records stored in the parent node to be executed when reading the child node from the permanent storage (flash). We propose the detailed structure and operations of UM-B+ tree. We also discuss expanding the UM-B+ tree to the transaction system based on the Aries/IM. Experiments confirm that our proposed UM-B+ tree significantly reduces the random overwrites of B+ tree in a typical OLTP workloads, therefore securing a significant performance improvement on flash storage.