Hash join method and device

A connection method and original data technology, applied in the database field, can solve problems such as wasting computing resources

Active Publication Date: 2019-04-05
HUAWEI TECH CO LTD
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In view of this, the purpose of the embodiments of the present invention is to provide a hash join method and device to overcome the problem of wasting computing resources in the existing database query process

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
  • Hash join method and device
  • Hash join method and device
  • Hash join method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0082] Embodiment 1 of the present invention discloses a hash connection method, which is applied to a database, and its flow is as follows figure 1 Shown in step S101 to step S105, the specific process includes:

[0083] Step S101, receiving a structured query language SQL statement including a Join operation, parsing and obtaining at least two target data groups to be connected;

[0084] In the process of executing the database query, step S101 is executed, the database parses the received SQL query statement including the Join operation, and obtains at least two target data groups to be connected therefrom. That is to say, if two target data groups to be connected are a pair, at least two target data groups to be connected will appear in the parsing process, that is to say, the target data groups to be connected are parsed in pairs.

[0085] Step S102, divide each target data group into a plurality of data segments of determined data with the vector vector as the quantitat...

Embodiment 2

[0106] Based on the hash connection method disclosed in Embodiment 1 of the present invention, in Embodiment 2 of the present invention, it is mainly aimed at figure 1 The N times of hash grouping mentioned in step S103 shown will be described in detail.

[0107] Based on the preset grouping rules, the process of performing the first hash grouping in the N times of hash grouping for the data segments in each target data group in turn includes:

[0108] Step S1031, calculating the hash value of the original data contained in the current data segment, and using bits to represent the calculated hash value;

[0109] Based on the execution of step S102, the target data group is divided with a vector as the unit of quantity. Taking any data segment in the target data group as an example, when step S1031 is executed, the hash of each original data contained in the same data segment is simultaneously calculated. value, and use bits to represent the hash value obtained by calculating ...

Embodiment 3

[0126] Based on the hash connection method disclosed in Embodiment 1 and Embodiment 2 of the present invention, in Embodiment 2 of the present invention, it is mainly aimed at figure 1 The preset grouping rules mentioned in step S103 shown will be described in detail.

[0127] When the preset grouping rule is the preset number of hash groups N, in the process of performing hash grouping on the data segments in each of the target data groups in turn, stop the target data group until N times of hash grouping is completed to group. Wherein, the value of N is determined by the storage size of the page table buffer TLB, and is a positive integer greater than or equal to 1.

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

No PUM Login to view more

Abstract

A Hash join method, device and database management system, the method comprising: when dividing a target data group during database query, using vector as a unit of quantity to divide and calculate the Hash value of the original data in a data segment, and representing the Hash value in bits; dividing the original data corresponding to the same Hash value of specified bits into the same group based on a preset grouping rule in Hash grouping, continuing to execute Hash grouping in subsequent grouping by utilizing the unspecified bits in the previous Hash grouping, and in the grouping process, according to the positions of the original data in the target data group, ranking the original data in the same group; and conducting a join operation on the grouped and ranked original data to be joined in the corresponding groups in the target data group, thus reducing the complexity of subsequent ranking of each group.

Description

technical field [0001] The present invention relates to the technical field of databases, and more specifically, relates to a hash connection method and device. Background technique [0002] With the development and application of database technology, the amount of data stored in the database has transitioned from megabytes (M) and gigabytes (G) to the current terabytes (T) and gigabytes (P). . Based on the amount of data that the current database can store, users need to face G-level, T-level or even P-level data in the process of querying the database. In the case of querying such a large amount of data, it is necessary to meet the fast response of the query, which poses a great challenge to the processing performance of the database, and the most important thing for the performance of the database is that the database includes in the query during the query process. The processing response time of the Join operation (connection operation). [0003] The basic methods for...

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
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/00
CPCG06F16/00
Inventor 桑永嘉李俊施会华
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap