Efficient novel memory index structure processing method

A technology of index structure and processing method, which is applied in the field of memory database, can solve problems such as difficult implementation and complex operation, and achieve the effects of simple implementation, good concurrency, and high cache utilization

CN110597805AActive Publication Date: 2019-12-20ZHEJIANG UNIV
3 Cites 5 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2019-12-20

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses an efficient novel memory index structure processing method. The method comprises the steps of before the skip list processing, calculating the query distribution and the datadistribution conditions through the statistical information; selecting the sentinel nodes inserted into a skip list structure; obtaining an optimal sentinel node configuration result by solving the minimum average operation cost of a skip list after the nodes are inserted; inserting the sentinel nodes into the bottom-layer skip list structure, then establishing an upper-layer CSB + tree structurefrom bottom to top through a Bulkload method after the sentinel nodes in the bottom-layer skip list structure are completely inserted, and quickly positioning the sentinel nodes; and for each piece ofdata needing to be queried or inserted, finding the nearest sentry node through the upper-layer CSB + tree structure, and starting to operate the skip list from the nearest sentry node. According tothe method, on the basis of reserving the advantages of simple implementation, good concurrency, suitability for range query and the like of a traditional skip list structure, the cache utilization rate of the whole operation process is improved, so that the memory index performance is obviously improved.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to methods such as memory database, storage strategy, jump table structure, cache utilization rate and the like. In particular, it relates to an efficient method for processing a novel memory index structure. Background technique

[0002] In-memory database (MMDB) is a data technology that has developed rapidly in recent years. Due to the current development of Internet technology and big data, higher and higher requirements are put forward for the response rate of data. The traditional disk database can no longer meet the requirements of some new services. At the same time, the development of hardware technology has reduced the manufacturing cost of memory. In-memory databases provide feasibility.

[0003] The indexing mechanism is an important part of the database management mechanism. The current memory index structures mainly include B+ trees, hash tables, and skip tables. Among them, only a single key query can be perform...

Examples

Embodiment Construction

[0026] The technical solution of the present invention will be further described in conjunction with specific implementation and examples.

[0027] Such as figure 1 , the specific implementation process and working principle of the present invention are as follows:

[0028] The specific implementation of the present invention can be aimed at the literal data of characters and character strings, such as user registration data in the background of the website, patent query and other statistical category storage data of information objects.

[0029] (1) Before skip table processing, calculate the query distribution and data distribution through statistical information. The data distribution and query distribution of the memory data set are relatively stable, and the data distribution and query distribution can be obtained through statistical methods. Specifically, the data in the memory is evenly divided into several segments, and the query distribution and data distribution in...