임광현, 이세권, 송현섭

Paper accepted at FAST 2017

Activities December 27, 2016

UNIST CSE Se Kwon Lee, Hongik Univ. K. Hyun Lim, UNIST CSE Hyunsub Song, and Professor Beomseok Nam, Sam H. Noh’s paper “WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems” was accepted for publication at FAST 2017.

Recent interest in persistent memory (PM) has stirred development of index structures that are efficient in PM. Recent such developments have all focussed on variations of the B-tree. In this paper, we show that the radix tree, which is another less popular indexing structure, is more appropriate as an efficient PM indexing structure.

FAST is a top-tier conference on file and storage technologies.