Unlock instant, AI-driven research and patent intelligence for your innovation.
Page query method and data processing nodes in oltp cluster database
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A data processing and data query technology, applied in the computer field, can solve problems such as eliminating pages and increasing processing overhead, and achieve the effect of reducing disk IO, reducing processing overhead, and reducing network communication time
Active Publication Date: 2018-03-02
HUAWEI TECH CO LTD
View PDF3 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0004] The above two methods have the following problems: when the cache of the data processing node is insufficient, the page needs to be eliminated, and when it needs to be accessed again, it needs to be read again through the network or disk, which increases the processing overhead
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
example 1
[0043] The page summary of page 1 shows that the maximum and minimum values of cust_age are 20 and 30, respectively. In the table customers stored on page 1, the value of the field cust_age is 20, 21, 22, and 30. According to the page summary of page 1, it can be judged that the target data of the above-mentioned database query statement cannot exist on page 1. Therefore, it is not necessary to query page 1.
example 2
[0045] The page summary of page 2 shows that the maximum and minimum values of cust_age are 20 and 90, respectively. In the table customers stored on page 2, the value of the field cust_age is 20, 21, 80, and 90. According to the page summary of page 2, it can be judged that page 2 may have the target data of the data query. Therefore, page 2 can be loaded into the database buffer storage space, and page 2 can be traversed and inquired. Of course, in this query, the target data of the above database query statement does not exist on page 2.
example 3
[0047] The page summary on page 3 shows that the maximum and minimum values of cust_age are 20 and 90 respectively. In the table customers stored on page 3, the value of the field cust_age is 20, 41, 61, and 90. According to the page summary of page 3, it can be judged that page 3 may have the target data of the data query. Therefore, page 3 can be loaded into the database buffer storage space, and page 3 can be traversed and inquired. In this query, the records with the values of the cust_age field of 41 and 61 can be obtained from page 2, and then the cust_state field value corresponding to the record can be obtained.
[0048] In the embodiment of the present invention, the page is quickly filtered according to the page summary when the page is accessed, which reduces unnecessary disk IO, reduces the interaction between the data processing node and the central node, thereby reducing network communication time and reducing the processing of the data processing node Overhead,...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
Embodiments of the present invention provide a page query method and data processing nodes in an OLTP cluster database. The OLTP cluster database includes a central node and at least one data processing node. The central node manages the PLock by passively releasing the PLock. The method includes: when the OLTP When the data processing node of the cluster database needs to query the first page during the data query process, and the first page does not exist in the database buffer storage space of the data processing node, the data processing node searches for the first page in the shared memory of the data processing node. The page abstract of the first page; if it is judged according to the page abstract that the target data of the data query is not likely to be on the first page, the first page will not be queried, or if it is judged according to the page abstract The target data of the data query may be on the first page, then the first page is loaded into the buffer storage space of the database, and the data query is performed by traversing the first page.
Description
Technical field [0001] The embodiments of the present invention relate to the computer field, and more specifically, to a page query method and data processing node in an OLTP cluster database. Background technique [0002] The target architecture of the On-Line Transaction Processing (OLTP) database is a shared-disk OLTP cluster database system. The data processing capacity (Scale-out) can be increased linearly by adding database servers to overcome Single-instance database systems can only improve the limitations of data processing capabilities (Scale-up) by upgrading the database server hardware. The core component of an OLTP cluster database is the database kernel engine. Only on the basis of a good database kernel engine can it be possible to build a good cluster database. [0003] Shared-disk architecture cluster database has two implementation methods: one is a fully distributed cluster represented by Oracle RAC, which uses distributed buffer pool and distributed lock manag...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.