References
- Stepahan Baumann, Giel de Nijs, Michael Strobel, and Kai-Uwe Sattler, "Flashing Databases: Expectations and Limitations", In Proc. of Data Management on New Hardware, pp. 9-18, 2010.
- Yongkun Wang, Kazuo Goda, and Masaru Kitsuregawa, "Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems", In Proc. of DEXA, pp. 777-791, 2009.
- Gap-Joo Na, Sang-Won Lee, and Bongki Moon, "Dynamic In-Page Logging for B+-tree Index", IEEE Trans. on Knowledge and Data Engineering, Vol. 24(7), pp. 1231-1243, 2012 https://doi.org/10.1109/TKDE.2011.32
- Sungup Moon, Sang-Phil Lim, Dong-Joo Park, and Sang-Won Lee, "Crash Recovery in FAST FTL", LNCS Vol. 6399, pp. 13-22, 20111.
- Chin-Hsien Wu, Tei-Wei Kuo, and Li Ping Chang, "An Efficient B-tree Layer Implementation for Flash-memory Storage Systems", ACM Transactions on Embedded Computing Systems, Vol. 6(3), 2007 (BFTL)
- Sang-Won Lee and Bongki Moon,"Design of Flash-based DBMS: An In-page Logging Approach," In Proc. of ACM SIGMOD, pp.55-66, 2007.
- Chang Xu, Lidan Show, Gang Chen, Cheng Yan, and Tianlei Hu, "Update Migration: An Efficient B+-tree for Flash Storage", In Proc. of DASFAA, pp.276-290, 2010.
- Hua-Wei Fang, Mi-Yen Yeh, Pei-Lun Suei, and Tei-Wei Kuo, "An Adaptive Endurance-aware B+-tree for Flash Memory Storage Systems", IEEE Transactions on Computers, 2013.
- Hongchan Roh, Sanghyun Park, Sungho Kim, Mincheol Shin, and Sang-Won Lee, "B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives", In Proc. of VLDB, pp.286-297, 2011.
- Sang-Won Lee, and Bongki Moon, "Transactional In-Page Logging for Multiversion Read Consistency and Recovery," In Proc. of ICDE, pp.876-887, 2011.
- Sangwon Park, Ha-Joo Song, and Dong-Ho Lee, "An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory", In Proc. of ICESS, 2007.
- D. Yinan Li, Bingsheng He, Robin Jun Yang, Qiong Luo, and Ke Yi, "Tree Indexing on Solid State Drives", In Proc. of the VLDB, 2010
- Devesh Agrawal, Deepak Ganesan, Ramesh Sitaraman, Yanlei Diao, Shashi Singh, "Lazy-Adaptive Tree: an Optimized Index Structure for Flash Devices", In Proc. of VLDB, pp. 361-372, August 2009.
- Chang Xu, Lidan Show, Gang Chen, Cheng Yan, and Tianlei Hu, "Update Migration: An Efficient B+ Tree for Flash Storage", In Proc. of DASFAA, pp. 276-290, 2010.
- Sai Tung On, Haibo Hu, Yu Li, and Jianliang Xu, "Flash-Optimized B+-Tree", Journal of Computer Science and Technology, Vol. 25(3), 2010.
- Xiaoyan Xiang, Lihua Yue, Zhanzhan Liu, Peng Wei, "A Reliable B-Tree Implementation over Flash Memory", ACM SAC, 2008.
- Patrick E. O'Neil, Edward Cheng, Dieter Gawlick, and Elizabeth J. O'Neil, "The Log-Structured Merge-Tree (LSM-Tree)", Acta Informatica, Vol. 33(1), pp. 351-385, 1996. https://doi.org/10.1007/s002360050048
- Marcel Kornacker, C. Mohan, and Joseph Hellerstein, "Concurrency and Recovery in Generalized Search Trees", In Proc. of SIGMOD, 1997.
- C. Mohan and F. Levine, "ARIES/IM: An Efficient and High Concurrency Index Management Method using Write-ahead Logging", In Proc. of SIGMOD, 1992.
- Sungchae Lim, Myoung-Ho Kim, "Restructuring the concurrent B+-tree with non-blocked search operations", Information Sciences, 147(1-4), 2002.