Search This Blog

Wednesday, March 25, 2009

μ-tree: an ordered index structure for NAND flash memory

All the nodes along the path from the root to the leaf are put together into a single flash memory page in order to minimize the number of flash write operations when a leaf node is updated.

Dongwon Kang , Dawoon Jung , Jeong-Uk Kang , Jin-Soo Kim, μ-tree: an ordered index structure for NAND flash memory, Proceedings of the 7th ACM & IEEE international conference on Embedded software, September 30-October 03, 2007, Salzburg, Austria

No comments:

Post a Comment

Blog Archive