关键词: HBase, 内存索引, HT树, 持久化

Abstract: In order to achieve efficient storage and query of massive data, many NoSQL databases have been developed, and HBase is one of them. However, the native HBase database only supports the primary key index when performing data query, and the non-primary key data can only be queried by means of full table scan, which greatly reduces the multi-condition query speed of HBase. To this end, a HBase memory index construction scheme based on coprocessor is proposed. The coprocessor is used to quickly construct the secondary index and the index can be automatically updated according to the change of the HBase table. At the same time, the established index is persisted, and the memory calculation is used in use, which greatly improves the retrieval speed of the index data, and ensures the availability and fault tolerance of the index. Experiments show that the condition retrieval speed of the scheme is greatly improved compared with the original database, and the retrieval speed of the secondary index scheme based on Solr and HiBase is also improved.

Key words: HBase, memory index, HT tree, durability