NV-Tree: A Consistent and Workload-Adaptive Tree Structure for Non-Volatile Memory

DOI10.1109/TC.2015.2479621MaRDI QIDQ2985394zbMATH OpenOpenAlexFDO

Authors Jun Yang, Qingsong Wei, Chun-Dong Wang, Cheng Chen, Khai Leong Yong, Bingsheng He

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2015.2479621

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data structures (68P05)

Recommendations

• TreeFTL: An Efficient Workload-Adaptive Algorithm for RAM Buffer Management of NAND Flash-Based Devices
• μ*-Tree: An Ordered Index Structure for NAND Flash Memory with Adaptive Page Layout Scheme
• An Adaptive Endurance-Aware ${B^+}$-Tree for Flash Memory Storage Systems
• Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory

Cited in

(1)

• μ*-Tree: An Ordered Index Structure for NAND Flash Memory with Adaptive Page Layout Scheme

This page was built for publication: NV-Tree: A Consistent and Workload-Adaptive Tree Structure for Non-Volatile Memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985394)