Main memory database access optimization method on basis of page coloring technology

Abstract

The invention discloses a main memory database access optimization method on the basis of a page coloring technology. The method comprises the following steps of: firstly, carrying out sorting on an access sequence of all data pages of a weak locality dataset according to page colors and carrying out grouping on all the data pages according to the page colors; then scanning all the data pages of the weak locality dataset according to a sequence of grouping the page colors; furthermore, presetting a plurality of memory pages with the same page color into a page color queue, wherein the page color queue is used as a memory cache before the memory pages are uploaded into a CPU (Central Processing Unit) cache; and ensuring the data pages of the weak locality dataset to firstly enter the page color queue by an asynchronous mode and then be uploaded into the CPU cache to complete the data processing. The invention can solve the problem that in the main memory database application, a cache address space cannot be optimized and distributed for processes, threads or the datasets by the page colors, and effectively reduces cache conflicts between the datasets with different data locality intensities.

Description

technical field [0001] The present invention relates to a memory database access optimization method, in particular to an access control based on page-coloring technology (Page-coloring) for data sets with different data locality strengths, so as to control the CPU cache (cache) access used by the memory database The optimization method belongs to the technical field of database management. Background technique [0002] An in-memory database is a database in which all data resides in memory, rather than in external storage as traditional databases do. Its notable feature is that all data access control is performed in memory, so the data read and write speed is several orders of magnitude higher than that of disk databases, which can greatly improve the performance of database applications. Compared with disk databases, in-memory databases have redesigned the architecture and made corresponding improvements in data caching, query optimization, and parallel operations. [0...

AI Technical Summary

Problems solved by technology

In-memory databases cannot allocate fewer page colors for large datasets with weak locality

The second challenge is that if the dynamic page coloring technology is used, the page color of the weak locality data page can be changed through the method of memory copy before the memory data is accessed. Although it can solve the problem that the weak locality data set cannot allocate fewer page colors, but The latency of memory copying seriously affects the overall performance of data access

At the same time, weak locality datasets only need a small range of page colors but actually require a lot of memory address space to store larger datasets

It is difficult to meet the quota contradiction between the memory address space and the page color range at the same time

Images