CPU (Central Processing Unit)-GPU (Graphic Processing Unit) collaborative query processing system and method for RDF (Resource Description Framework) graph data
A processing system and processing method technology, applied in the direction of processor architecture/configuration, etc., can solve problems such as decompression waste, speed up query, etc., to achieve the effect of high degree of parallelism, large number of threads, and high degree of overlap between communication and calculation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] Such as figure 1 The CPU-GPU cooperative query processing system for RDF graph data shown includes a central processing unit 1, a graphics processor 2, a user interface module 3, a data storage module 4, and an algorithm database module 5.
[0039] Preferably, the user interface module 3 includes an RDF data import interface, a Sparql query interface, an entity dump interface and an RDF data dump interface. Among them, the RDF data import interface is used to import RDF graph data that needs to be processed in a wired connection with an external device. The external device may be, for example, a mobile terminal, a computer, a cloud server, etc. The Sparql query interface is used to input query statements. The query sentence can be input by connecting the Sparql query interface with devices such as keyboards and touch screens. The RDF data dump interface is used to back up and store RDF data at a specific time to prevent errors in RDF data. Through the RDF data dump inte...
Embodiment 2
[0049] This embodiment is a further supplement to Embodiment 1, and the repeated content will not be repeated.
[0050] Such as Figure 4 As shown, a method of selecting a triple pattern for each of the common variables as a representative mode, and dividing based on the data corresponding to each of the representative modes to obtain several data blocks, specifically includes the following steps:
[0051] S1: Sort the triplet patterns based on the number and / or selectivity of the public variables and set the sorted N triplet patterns as an array Pattern[N];
[0052] S2: Set the counter k=0, and set the representative mode of the selected public variable to Delegate[var], where Delegate[var] is empty, which means that the public variable var has not yet selected the representative mode;
[0053] S3: Read the k-th triplet pattern and set it to P;
[0054] S4: If there is only one public variable var in P and Delegate[var] is empty, go to step S5; if there is only one public variable var ...
Embodiment 3
[0065] This embodiment is a further supplement to Embodiment 1 and Embodiment 2, and the repeated content will not be repeated.
[0066] A method for generating Join tasks and transferring data blocks to GPU memory, specifically including the following steps:
[0067] A1: Set the counter m=0, and set the data block corresponding to the representative mode to CHUNK[P][N] to indicate that the mode P corresponds to a total of N data blocks;
[0068] A2: Under the condition that the representative mode has two public variables, set the two public variables to x and y respectively and then go to step A3; if the representative mode does not have two public variables, go to step A4;
[0069] A3: Read the nth data block CHUNK[P][n] of mode P, create the join task according to the value of the public variable y in CHUNK[P][n], and then proceed to step A5;
[0070] A4: Read the nth data block CHUNK[P][n] of mode P, and according to the interval [x of the public variable x in CHUNK[P][n] min ,x ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


