%0 Journal Article
%T Flash-Optimized B+-Tree
%A Sai Tung On
%A Haibo Hu
%A Yu Li
%A Jianliang Xu
%A <br>安世通
%A 胡海波
%A 李宇
%A 徐建良
%J 计算机科学技术学报
%D 2010
%I 
%X With the rapid increasing capacity of flash memory, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the erase-before-write constraint and the asymmetric read/write cost, severely deteriorate the performance of the traditional B+-tree algorithm. In this paper, we propose an optimized indexing method, called lazy-update B+-tree, to overcome the limitations of flash memory. The basic idea is to defer the committing of update requests to the B...
%K B+-tree
%K flash memory
%K indexing
%K lazy update<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=9BE48DFEC51B6B5294FE6F1DA796C474&yid=140ECF96957D60B2&vid=C5154311167311FE&iid=38B194292C032A66&sid=4ECB3941871FD391&eid=91BAD12CFABB3251&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=22