Recno索引方式在伯克利数据库中的应用  

Application of Recno access method in Berkeley DB

作　　者：刘彩苹[1] 李仁发[1] 李肯立[1] 

机构地区：[1]湖南大学计算机与通信学院,湖南长沙410082

出　　处：《计算机应用》2004年第12期156-158,共3页journal of Computer Applications

基　　金：湖南省科学技术厅制造业信息化示范工程项目 (HNMIE A 0 2 6 )

摘　　要：B+ 树,Hash是数据库中常用的索引方式。但是,当要存储的记录太庞杂无法从中提取合适的关键字时,采用传统的B+ 树或HASH方式存储记录效率低。文中阐述了在这种情况下可提高数据库存储效率的索引方式———Recno方式的具体实现,并结合在伯克利数据库中实际应用进行了详细介绍。最后通过实验分析,证明了当要存储的记录太庞杂,无法从中提取合适的关键字时,采用Recno方式能较大改进数据库的存储效率。B^+-tree and Hash methods are common access methods in the database. But when storing numerous and jumbled records from which compatible keys can't be selected, the efficiency of the B^+-tree or Hash access method is low. The implementation of a new access method-Recno method, which could improve the access efficiency of database aiming at this deficiency was demonstrated. The application of Recno access method in Berkeley DB was also introduced in detail. Finally with experiments, it was concluded that when records were numerous and jumbled and compatible keys could not be selected from these records, Recno method could obviously improve the efficiency of accessing records.

关 键 词：B^+树 数据库 索引方式 

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