An index management using CHC-cluster for flash memory databases
暂无分享,去创建一个
[1] Sang Kyun Cha,et al. Xmas: an extensible main-memory storage system , 1997, CIKM '97.
[2] Sang-goo Lee,et al. A new flash memory management for flash storage system , 1999, Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032).
[3] Chanik Park,et al. Cost-efficient memory architecture design of NAND flash memory embedded systems , 2003, Proceedings 21st International Conference on Computer Design.
[4] Ramez Elmasri,et al. Fundamentals of Database Systems , 1989 .
[5] John Wilkes,et al. UNIX Disk Access Patterns , 1993, USENIX Winter.
[6] 张戟,et al. 计算机中的新技术—Flash Memory , 1993 .
[7] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[8] Tei-Wei Kuo,et al. An efficient R-tree implementation over flash-memory storage systems , 2003, GIS '03.
[9] Keun Soo Yim,et al. A Novel Memory Hierarchy for Flash Memory Based Storage Systems , 2005 .
[10] Dong-Joo Park,et al. Design and Implementation of B-Tree on Flash Memory , 2007 .
[11] Tei-Wei Kuo,et al. An adaptive striping architecture for flash memory storage systems of embedded systems , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.
[12] Ruei-Chuan Chang,et al. Cleaning policies in mobile computers using flash memory , 1999, J. Syst. Softw..
[13] Hongjun Lu,et al. T-tree or B-tree: main memory database index structure revisited , 2000, Proceedings 11th Australasian Database Conference. ADC 2000 (Cat. No.PR00528).
[14] Tei-Wei Kuo,et al. Endurance Enhancement of Flash-Memory Storage, Systems: An Efficient Static Wear Leveling Design , 2007, 2007 44th ACM/IEEE Design Automation Conference.
[15] Siwoo Byun,et al. An index rewriting scheme using compression for flash memory database systems , 2007, J. Inf. Sci..
[16] Kern Koh,et al. A Study on Flash Memory Based Storage Systems Depending on Design Techniques , 2003 .