计算机应用与软件Issue(11)：243-246,4.DOI:10.3969/j.issn.1000-386x.2013.11.066
DB-Tree：一种高性能的闪存数据库索引结构
DB-TREE:AN EFFICIENT INDEX STRUCTURE FOR FLASH-BASED DATABASE
摘要
Abstract
The advantage of flash memory performance brings the flash-based database system to the focus of current research , and the index is an important means to improve the efficiency of flash-based database .In this paper , we propose a suitable index structure for flash-based database, namely DB-Tree, based on B+-tree index structure.In the method, the updating operations are stored in a structure form of“pseudo B+-tree” to avoid scanning the entire update log-area while retrieving;the update operations are pertinently aggregated to the page of flash memory in the way of merging the corresponding branches;the self-adaptive mechanism for update-buffer size and merger frequency is introduced to ensure the flash-based database can be applied to different read/write load.Through the experimental comparison with the classic log update IPL B +Tree and the μ-Tree index method without log , it is proved that the DB-Tree index structure we presented significantly reduces the update cost and greatly improves the query performance of the index simultaneously .关键词
闪存/数据库/索引结构/检索/更新合并Key words
Flash/Database/Index structure/Retrieval/Merger update分类
信息技术与安全科学引用本文复制引用
房俊华,王翰虎,陈梅,马丹..DB-Tree：一种高性能的闪存数据库索引结构[J].计算机应用与软件,2013,(11):243-246,4.基金项目
贵阳市2010年工业科技攻关项目（［2010］筑科工合同字第28号）。 （）
