HBase memory index construction method and system and storage medium

Abstract

The invention discloses an HBase memory index construction method and system and a storage medium, and the HBase memory index construction method comprises the steps: an updating step: intercepting anupdating operation request through a coprocessor when a data table is updated, and carrying out the updating of an index table, and obtaining a second-level index table; and a searching step: when index query is carried out, intercepting a search operation request through the coprocessor, finding out index entries meeting conditions from the secondary index table, returning to the original data table and then carrying out query. According to the invention, the construction of the memory index is achieved, the constructed memory index is persistently stored in the external memory, the rapid construction of the secondary index is achieved through the coprocessor, and the index can be automatically updated according to the change of the HBase table. During use, through memory calculation, the index data retrieval speed is greatly increased, and the availability and fault tolerance of indexes are ensured.

Description

technical field [0001] The present invention relates to a method, system and storage medium for constructing an HBase memory index, in particular, to a method, system and storage medium for constructing an HBase memory index based on a coprocessor. Background technique [0002] With the rapid development of the Internet, data indexing technology is also developing rapidly. 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 during data query, and non-primary key data can only be queried through full table scanning, which greatly reduces the multi-condition query speed of HBase. [0003] The native HBase database only supports primary key indexes when performing data queries, and non-primary key data can only be queried through full table scanning, which greatly reduces the multi-condition query speed of HBase. Research on t...

AI Technical Summary

Problems solved by technology

[0004] In addition, in the prior art, secondary index schemes based on Solr and HiBase are also used, but the retrieval speed of these two schemes is relatively slow, and when using a non-coprocessor (Coprocessor) scheme, the storage overhead is relatively large, especially when the index When there are more columns, the space overhead will be greater

Images