WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems
Abstract: Recent interest in persistent memory (PM) has stirred development of index structures that are efficient in PM. Recent such developments have all focused on variations of the B-tree. In this paper, we show that the radix tree can be more appropriate as an efficient PM indexing structure and present three radix tree variants, namely, WORT (Write Optimal Radix Tree), WOART (Write Optimal Adaptive Radix Tree), and ART+CoW.
Bio: Se Kwon Lee is a master's candidate in the NECSST lab at Ulsan National Institute of Science and Technology (UNIST). His research interests are data structure and filesystem for persistent memory. Se Kwon Lee received his B.S degree in computer engineering from Hongik University.