Optimizing R-tree for flash memory

作者：

Highlights：

• We proposed a flash-optimized unbalanced R-tree index for flash memory.

• We introduced overflow nodes to defer node-splitting operations on the index.

• We presented a new buffering scheme to cache the node updates to the index.

• We conducted experiments on both real solid state drives and a flash simulation framework.

摘要

•We proposed a flash-optimized unbalanced R-tree index for flash memory.•We introduced overflow nodes to defer node-splitting operations on the index.•We presented a new buffering scheme to cache the node updates to the index.•We conducted experiments on both real solid state drives and a flash simulation framework.

论文关键词：Spatial index,Flash memory,Buffer management,R-tree

论文评审过程：Available online 30 January 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.01.011