内存数据库系统SwiftMMDB索引机制的设计与实现  

Design and implementation of index in main memory database system named SwiftMMDB

作　　者：赵艳梅[1] 郑鑫福[2] 徐立臻[2] 

机构地区：[1]国家自然科学基金委员会信息中心,北京100085 [2]东南大学计算机科学与工程学院,南京210096

出　　处：《计算机应用》2011年第9期2395-2398,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(M1021003)

摘　　要：T树结合了平衡二叉树(AVL树)和B树的优点,可以有效地组织索引数据,从而为内存数据库提供优良的存储效率和查询性能。结合自主开发的一个内存数据库系统Sw iftMMDB介绍T树索引的设计与实现,并通过节点分裂、填充等方法改进了经典T树的插入和删除操作,减少了T树中平衡旋转的次数,从而进一步提高内存数据库检索的效率和性能。T tree, combining the advantages of AVL tree and B tree, can organize index data efficiently, thus providing good storage efficiency and search performance for main memory database. The design and implementation of T tree index was presented in the main memory database system named SwiftMMDB which was developed by the authors＇ research group recently. The insert and delete operations of traditional T tree were improved through node splitting and node populating method. The rotation number for balance in T tree was reduced. As a result, the retrieve efficiency and performance of main memory database system are improved.

关 键 词：内存数据库 索引 T树 平衡二叉树 B+树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]