This paper presents a novel B-tree storage scheme that reduces the number of time-consuming erase operations on flash memory-based systems. The scheme adopts group-based round robin fashion and in-block logging technique for efficiently maintaining the B- tree nodes in the heavy-update workloads. Experimental results show that the proposed scheme improves the I/O performance by up to 3X , compared to the related work.