关键词: B^＋-树 数据库 空间利用率

Abstract:

B^＋-tree is a commonly-used organization in database systems.Its strong point is its high efficiency,and its shortcoming is the low utilization of storage. This drawback has bad impact especially on embedded database systems which have limited storage. This project improves the access method aiming a  t this deficiency and applies this improved access method to an embedded database-Berkeley DB. This improved access method not only inherits the strong  point of B^＋-tree which has high efficiency and can perform sequential and random search, but also overcomes the shortcomings of B^＋-tree which has a  low utilization of storage. Experimental results show that the improved B^＋-tree access method can attain higher storage utilization at the expense of  f more execution time than the conventional B^＋-tree access method.

Key words: B^＋-tree;database;storage utilization