Using Compressed B+-trees for Line-based Database Indexes

In this paper, we propose a new indexing method called compressed B⁺-tree. The traditional B⁺-tree is the most common dynamic index structures in database systems. However, in practical applications, its performance still remains considerable room for improvement. Compressed B⁺-tree outperforms traditional access methods in two respects. The first is more economic storage requirement in the indexing structure. The second is better performance in retrieval. In addition, a compressed B⁺-tree can be used for the implementation of line-based database indexes