CN103995879A - Data query method, device and system based on OLAP system - Google Patents

Abstract

Embodiments of the present invention provide a data query method, device, and system based on an OLAP system, including: receiving a data query request sent by a user terminal, performing logical partition processing on the first data table corresponding to the first data table identifier, and obtaining at least two A first partition, and for each first partition, establish a corresponding connection mapping relationship; perform partition processing on the second data table corresponding to the second data table identifier, obtain at least two second partitions, and for each second data table Partitioning, obtaining the first foreign key value from the second partition, the first foreign key value is within a boundary value range of the first partition; querying the connection mapping relationship, obtaining the first hash subtable corresponding to the first foreign key value; The first hash subtable is scanned to obtain corresponding data, and the data is returned to the user terminal. The embodiment of the present invention effectively shortens data query time and reduces server overhead by establishing a connection mapping relationship.

Description

Data query method, device and system based on OLAP system

technical field

Embodiments of the present invention relate to computer technology, and in particular to a data query method, device and system based on an On-Line Analytical Processing (OLAP) system.

Background technique

As a typical application scenario of the database system, OLAP is mainly used to query data. In the process of querying data, it often involves joint query of multiple data tables. Tables need to be associated through connection operations. , a common join operation is a hash join.

In the prior art, the method of data query using hash join is mainly as follows: the background server of the database system receives the data query message sent by the user, and according to the first data table identifier and the second data table identifier carried in the data query message, , perform a hash operation on the primary key of the first data table with a small number of rows, establish a shared hash table, and then perform a parallel scan on the second data table, and perform a hash operation on the foreign key of each query thread to obtain each According to the hash value corresponding to each thread, the shared hash table is scanned in parallel to obtain the complete data required by the user.

However, because there are write conflicts in multi-threaded parallel query, when there are many parallel threads, it will cause long data query time and high server overhead.

Contents of the invention

Embodiments of the present invention provide a data query method, device, and system based on an OLAP system to overcome the problems of long multi-threaded query time and high server overhead in the prior art, by partitioning the first data table and the second data table , and establish a connection mapping relationship. In the process of multi-thread query, each thread obtains and scans the first hash subtable through the connection mapping relationship, thereby obtaining data, effectively shortening data query time and reducing server overhead.

The first aspect of the embodiments of the present invention provides a data query method based on an OLAP system, including:

receiving a data query request sent by a user terminal, where the data query request includes query information, a first data table identifier, and a second data table identifier;

According to the data query request, perform logical partition processing on the first data table corresponding to the first data table identifier, obtain at least two first partitions, and establish a corresponding connection mapping relationship for each first partition, so The connection mapping relationship includes: the boundary value of the first partition and the corresponding hash subtable;

Partitioning the second data table corresponding to the second data table identifier, obtaining at least two second partitions, and obtaining the first foreign key value from the second partition for each second partition, the the first foreign key value is within a boundary value range of said first partition;

Querying the connection mapping relationship to obtain a first hash subtable corresponding to the first foreign key value;

Scanning the first hash sub-table, acquiring data corresponding to the query information, and returning the data to the user terminal.

With reference to the first aspect, in a first possible implementation manner of the first aspect, performing logical partition processing on the first data table corresponding to the first data table identifier, obtaining at least two first partitions, and Establish a connection mapping relationship, including:

performing partition processing on the first data table according to the inherent order of the first data table, and acquiring at least two first partitions;

For each of the first partitions, perform a hash operation according to the primary key of the first partition, and establish a corresponding hash subtable;

For each of the first partitions, a corresponding connection mapping relationship is established according to the hash subtable corresponding to the first partition.

With reference to the first aspect or the first possible implementation manner of the first aspect, in the second possible implementation manner of the first aspect, the logical partition processing is performed on the first data table corresponding to the first data table identifier, and the obtained At least two first divisions, including:

If the first data table is in order, perform logical partition processing on the first data table according to the inherent order of the first data table, and obtain at least two of the first partitions;

or,

If the first data table is out of order, an ordered proxy column is added to the first data table as a primary key column, and the first data table is logically partitioned according to the order of the ordered proxy column, Obtain at least two of said first partitions.

With reference to the second possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, performing partition processing on the second data table corresponding to the second data table identifier to obtain at least two a second partition, including:

If the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, and at least two second data tables are obtained. partition.

or,

If the first data table is ordered and the second data table is out of order, partitioning the second data table according to parallel processing capability to obtain at least two second partitions;

or,

If the first data table is unordered and the second data table is unordered, then replace the original foreign key value in the second data table with the one corresponding to the ordered proxy column in the first data table new primary key value, and perform partition processing on the replaced second data table according to the parallel processing capability to obtain at least two second partitions.

With reference to the first aspect and any one of the first to third possible implementation manners of the first aspect, in a fourth possible implementation manner of the first aspect, the scanning of the first hash subtable, Obtain data corresponding to the query information, including:

Scanning the first hash sub-table, and obtaining all data information in associated rows in the first data table and the second data table corresponding to the query information as the data.

The second aspect of the embodiment of the present invention provides a data query device based on an OLAP system, including:

A transceiver module, configured to receive a data query request sent by a user terminal, where the data query request includes query information, a first data table identifier, and a second data table identifier;

A processing module, configured to perform logical partition processing on the first data table corresponding to the first data table identifier according to the data query request, acquire at least two first partitions, and establish a corresponding A connection mapping relationship, the connection mapping relationship including: the boundary value of the first partition and the corresponding hash subtable;

The processing module is further configured to partition the second data table corresponding to the second data table identifier, acquire at least two second partitions, and obtain the second partition from the second partition for each second partition. a foreign key value, said first foreign key value being within a boundary value range of said first partition;

An acquisition module, configured to query the connection mapping relationship, and acquire the first hash subtable corresponding to the first foreign key value;

The acquisition module is further configured to scan the first hash subtable to acquire data corresponding to the query information, and return the data to the user terminal through the transceiver module.

With reference to the second aspect, in the first possible implementation manner of the second aspect, the processing module is specifically configured to:

performing partition processing on the first data table according to the inherent order of the first data table, and acquiring at least two first partitions;

For each of the first partitions, perform a hash operation according to the primary key of the first partition, and establish a corresponding hash subtable;

For each of the first partitions, a corresponding connection mapping relationship is established according to the hash subtable corresponding to the first partition.

With reference to the second aspect or the first possible implementation manner of the second aspect, in the second possible implementation manner of the second aspect, the processing module is used for:

If the first data table is in order, perform logical partition processing on the first data table according to the inherent order of the first data table, and obtain at least two of the first partitions;

or,

If the first data table is out of order, an ordered proxy column is added to the first data table as a primary key column, and the first data table is logically partitioned according to the order of the ordered proxy column, Obtain at least two of said first partitions.

With reference to the second possible implementation manner of the second aspect, in a third possible implementation manner of the second aspect, the processing module is further configured to:

If the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, and at least two second data tables are obtained. partition.

or,

If the first data table is ordered and the second data table is out of order, partitioning the second data table according to parallel processing capability to obtain at least two second partitions;

or,

If the first data table is unordered and the second data table is unordered, then replace the original foreign key value in the second data table with the one corresponding to the ordered proxy column in the first data table new primary key value, and perform partition processing on the replaced second data table according to the parallel processing capability to obtain at least two second partitions.

In combination with the second aspect and any one of the first to third possible implementation manners of the second aspect, in the fourth possible implementation manner of the second aspect, the acquiring module is specifically configured to:

Scanning the first hash sub-table, and obtaining all data information in associated rows in the first data table and the second data table corresponding to the query information as the data.

The third aspect of the embodiments of the present invention provides an OLAP system-based data query system, including: a user terminal and the OLAP system-based data query device provided in the second aspect.

The embodiment of the present invention is based on the data query method, device and system of the OLAP system. By receiving the query request from the user terminal, the first data table is logically partitioned to obtain the first partition, and a connection mapping relationship is established. The connection mapping relationship represents the first The corresponding relationship between the boundary value of the partition and the hash subtable, and then partition the second data table to obtain the second partition. In the process of multi-thread query, each thread obtains and scans the first hash subtable through the connection mapping relationship. Table, so as to obtain data, and then return the data to the client terminal, which solves the problems of long multi-threaded query time and high server overhead in the prior art, effectively shortens the data query time, and reduces server overhead.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description These are some embodiments of the present invention. For those skilled in the art, other drawings can also be obtained according to these drawings without any creative effort.

Fig. 1 is the flow chart of embodiment one of the data query method based on OLAP system of the present invention;

Fig. 2 is the flowchart of the second embodiment of the data query method based on the OLAP system of the present invention;

Fig. 3 is the structural representation of the embodiment of the data inquiry device based on OLAP system of the present invention;

FIG. 4 is a schematic structural diagram of an embodiment of the data query system based on the OLAP system of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

Fig. 1 is the flow chart of embodiment one of the data query method based on OLAP system of the present invention, and this scheme is mainly applied in the database system of OLAP type, in the process of carrying out joint query to multiple data tables to obtain data, as shown in Fig. 1 , the method of this embodiment may include:

S101: Receive a data query request sent by a user terminal, where the data query request includes query information, a first data table identifier, and a second data table identifier.

In this embodiment, when the user terminal needs to obtain data, it sends a data query request to the database system, wherein the first data table and the second data table are two associated data tables that store associated data information.

S102: According to the data query request, perform logical partition processing on the first data table corresponding to the first data table identifier, obtain at least two first partitions, and establish a corresponding connection mapping relationship for each first partition , the connection mapping relationship includes: the boundary value of the first partition and the corresponding hash subtable.

In this embodiment, the first data table is divided into at least one first partition, and for each first partition, a hash subtable is obtained, and a connection mapping relationship is established to represent the boundary value and The correspondence of the hash subtable of this first partition.

The connection mapping relationship can be expressed in the form of a table, optionally, it can also be expressed in other ways such as mapping, array, set, etc., which can be selected according to the actual application environment, which is not limited in the present invention.

S103: Perform partition processing on the second data table corresponding to the second data table identifier, obtain at least two second partitions, and obtain the first foreign key value from the second partition for each second partition, The first foreign key value is within a boundary value range of the first partition.

In this embodiment, the second data table is obtained according to the second data table identifier, and the second data table is partitioned to obtain at least one second partition, and the number of the second partitions may be the same as the number of the first partitions , can also be different. From each second partition, select a foreign key value and compare it with the boundary value of the first partition one by one. If the foreign key value is within the boundary value range of the first partition, use the foreign key value as the The first foreign key value for the second partition.

In this embodiment, the boundary value range of the first partition is a value between the current boundary value of the first partition and the previous boundary value of the first partition.

In a relational database, each data table has several attributes. If one of the attribute groups can uniquely identify the data table, the attribute group is a primary key of the table. For example, the student table includes student number, name, Gender and class, and the student ID of each student is unique, so the student ID is the primary key. The foreign key is mainly used to associate with another data table. For example, the grade table includes the student number, course number and grade. The student number and the course number can determine the grade together. Therefore, the primary key of the grade table is the student number and the course number. The student number in the grade table corresponds to the student number in the student table, so the student number in the grade table is the foreign key of the student table.

S104: Query the connection mapping relationship, and obtain a first hash subtable corresponding to the first foreign key value.

In this embodiment, the connection mapping relationship is queried by using the first foreign key value, and the first hash subtable is obtained. Hash subtable of boundary values for the first partition.

S105: Scan the first hash subtable, acquire data corresponding to the query information, and return the data to the user terminal.

The embodiment of the present invention is based on the data query method of the OLAP system. By receiving the query request from the user terminal, the first data table is logically partitioned to obtain the first partition, and a connection mapping relationship is established. The connection mapping relationship represents the boundary value of the first partition The corresponding relationship with the hash subtable, and then partition the second data table to obtain the second partition. In the process of multi-threaded query, each thread obtains and scans the first hash subtable through the connection mapping relationship, thereby obtaining Data, and then return the data to the client terminal, which solves the problems of long multi-threaded query time and high server overhead in the prior art, effectively shortens the data query time, and reduces server overhead.

Fig. 2 is the flow chart of embodiment two of the data query method based on OLAP system of the present invention, as shown in Fig. 2, on the basis of above-mentioned embodiment, the specific implementation of S102 comprises the following steps:

S201: According to the inherent order of the first data table, perform partition processing on the first data table to obtain at least two first partitions.

In this embodiment, in the OLAP database system, the primary key of the first data table usually has a partial order relationship, that is, there is an inherent order, so the first data table can be partitioned according to the inherent order, and divided into mutually disjoint at least two of the first partitions.

S202: For each of the first partitions, perform a hash operation according to the primary key of the first partition, and establish a corresponding hash subtable.

In this embodiment, according to the above-mentioned first partition, a shared hash subtable is established for the primary key value lock hash operation of each first partition, and the hash subtables corresponding to each first partition are mutually independent.

S203: For each of the first partitions, establish a corresponding connection mapping relationship according to the hash subtable corresponding to the first partition.

In this embodiment, the boundary value of each first partition is obtained, and each first partition has only one boundary value, that is, the boundary value is used to identify the first partition, and the boundary value corresponding to the first partition is obtained. Hash the corresponding relationship between the sub-tables, and establish the connection mapping relationship.

The embodiment of the present invention is based on the data query method of the OLAP system. By receiving the query request from the user terminal, the first data table is logically partitioned to obtain the first partition, and the hash subtable corresponding to each first partition and each first partition are obtained. boundary value, and establish a connection mapping relationship, the connection mapping relationship represents the corresponding relationship between the boundary value of the first partition and the hash subtable, and then partition the second data table to obtain the second partition, in the process of multi-threaded query , each thread obtains and scans the first hash subtable through the connection mapping relationship, thereby obtaining data, and then returns the data to the client terminal, which solves the problems of long multi-thread query time and large server overhead in the prior art, and is effective Shorten data query time and reduce server overhead.

On the basis of the above-mentioned embodiments, in particular, in S102, the first data table corresponding to the first data table identifier performs logical partition processing to obtain at least two first partitions, including the following two implementations:

In a first implementation manner, if the first data table is in order, the first data table is logically partitioned according to the inherent order of the first data table, and at least two of the first partitions are obtained.

In this embodiment, if the primary keys of the first data table have a certain fixed order (partial order relationship), the first data table is logically partitioned according to the fixed order.

In the second implementation mode, if the first data table is out of order, add an ordered proxy column in the first data table as a primary key column, and use the first data table according to the ordered proxy column The logical partition processing is performed sequentially, and at least two of the first partitions are obtained.

In this embodiment, if the first data table does not have a certain fixed order (partial order relationship), then add an ordered proxy column to the first data table, for example, add an incremental number sequence 1 to the first data table The number of rows in the data table is used as an ordered proxy column, and then the first data table is logically partitioned according to the newly added ordered proxy column.

Further, in S103, performing partition processing on the second data table corresponding to the second data table identifier to obtain at least two second partitions, specifically, there are the following three implementation methods:

In the first implementation manner, if the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, Get at least two second partitions.

In the second implementation manner, if the first data table is in order and the second data table is out of order, perform partition processing on the second data table according to parallel processing capability, and obtain at least two second partitions;

In the third implementation, if the first data table is out of order and the second data table is out of order, replace the original foreign key value in the second data table with the value described in the first data table The new primary key value corresponding to the ordered surrogate column, and partitioning the replaced second data table according to the parallel processing capability to obtain at least two second partitions.

In particular, for the first data table and the second data table have the same inherent order (that is, have the same partial order relationship, which is very common in practical applications), for example: lineitem, order in "The TPC Benchmark ^TM H" Table two commonly used connection data tables, the primary key order of the order table has the same inherent order as the record order of the lineitem table, so the order table and lineitem table can be partitioned with the same boundary value, which can ensure the logical partition of the two data tables One-to-one correspondence, during the hash join process, the link mapping relationship may not be required, and only the unique hash subtable can be accessed.

Specifically, in S105, the scanning the first hash subtable to obtain data corresponding to the query information includes: scanning the first hash subtable to obtain the first hash data corresponding to the query information. All the data information in the associated row in the data table and the second data table is used as the data.

An example is given below to describe the technical solutions in the above embodiments in detail. Specifically, the names of 50 individuals and their corresponding genders and ages are stored in the first data table, that is, the attributes of the first data table include name, gender, and age, the primary key is name, and the inherent The order is that the first letter of the name is arranged in the order of the twenty-six letters, that is, the rows are arranged in alphabetical order. The names, dates of birth and mobile phone numbers of 100 individuals are stored in the second data table associated with the first data table, and the name in the attribute of the second data table is the foreign key of the first data table.

The main process of utilizing the data query method based on the OLAP system is as follows: first, the first data table is partitioned according to the inherent order of the first data table (name initial alphabet order), and is divided into five first partitions, each The border value of the first partition is the name of the border personnel of the first partition, hash calculation is performed on each first partition after partition, and the hash subtable corresponding to each first partition is obtained. A connection mapping table is established, which stores the boundary value (name, for example, one of the boundary values: Zhang San) and the identification of the corresponding hash subtable of each first partition in the table, that is, the connection mapping table identifies each The mapping relationship between the boundary value of the first partition and the corresponding hash subtable.

Secondly, in the second data table, in general, the foreign key columns of the first data table are out of order, so the second data table is not physically partitioned, but only logically divided horizontally, and the second data table is divided into Three second partitions (the number of threads that need to be processed is three threads, or can also be divided into the same partition number as the maximum number of threads that the system can handle, which can be selected according to the actual situation, and the application does not limit this), Query all the foreign key values of the first data table from each second partition, find a name within the range of the boundary value of a certain first partition as the first foreign key value, that is, find out the name: Zhang San , query the connection mapping table according to the first foreign key value, obtain the corresponding hash sub-table, and then independently scan the corresponding hash sub-table for each thread in the way of the prior art, from the first data table and the second data table Get all the data you need. Each thread does not interact with each other during this scan.

Finally, the acquired data is returned to the user terminal to complete the entire data query process.

In this embodiment, the first data table (primary key table) is logically decomposed into N first partitions (N depends on the parallel capability provided by the platform). Due to the inherent order of the primary key, these first partitions can be mutually disjoint, and each first partition can be distinguished by recording boundary values. After the first data table (primary key table) is partitioned, each first partition is scanned by different threads in parallel, and a hash function is used to complete the calculation during the scanning process to generate a hash sub-table of each first partition. And the mapping relationship between the primary key boundary value and the hash subtable is recorded in a connection mapping relationship structure. In this process, each thread independently completes its own hash calculation process, and each thread has no conflict.

The second data table (foreign key table) in the connection is out of order on the foreign key columns, so the second data table (foreign key table) is not physically partitioned, but only logically partitioned according to the parallelism level, and multi-threaded parallel scanning is used. For a first foreign key value read by each thread, first query the connection mapping relationship, and determine the hash subtable corresponding to the first foreign key value through the mapping relationship. The multi-threaded query of the connection mapping relationship is a read-only operation and has no conflict with other operations.

The embodiment of the present invention is based on the data query method of the OLAP system. By receiving the query request from the user terminal, the first data table is partitioned to obtain the first partition, and the hash subtable corresponding to each first partition and the hash subtable of each first partition are obtained. Boundary value, and establish a connection mapping relationship, the connection mapping relationship represents the corresponding relationship between the boundary value of the first partition and the hash subtable, and then partition the second data table to obtain the second partition, in the process of multi-threaded query, Each thread obtains and scans the first hash subtable through the connection mapping relationship, independently scans the hash subtable corresponding to each first foreign key value, thereby obtaining data, and then returns the data to the client terminal, solving the problem In the prior art, the multi-threaded query time is long and the server overhead is high, which can effectively shorten the data query time and reduce the server overhead.

Fig. 3 is a schematic structural diagram of an embodiment of a data query device based on an OLAP system in the present invention. As shown in Fig. 3, the device of this embodiment may include: a transceiver module 31, a processing module 32 and an acquisition module 33, wherein the transceiver module 31, For receiving a data query request sent by a user terminal, the data query request includes query information, a first data table identifier and a second data table identifier; the processing module 32 is configured to perform the first data query according to the data query request. Perform partition processing on the first data table corresponding to the data table identifier, obtain at least two first partitions, and establish a corresponding connection mapping relationship for each first partition, and the connection mapping relationship includes: the boundary of the first partition value and the corresponding hash subtable; the processing module 32 is further configured to partition the second data table corresponding to the second data table identifier, obtain at least two second partitions, and for each second partition, Acquire the first foreign key value from the second partition, the first foreign key value is the same as a boundary value of the first partition; the obtaining module 33 is used to query the connection mapping relationship, and obtain the connection mapping relationship with the first The first hash sub-table corresponding to the foreign key value; the acquisition module 33 is also used to scan the first hash sub-table, obtain data corresponding to the query information, and return the data through the transceiver module 31 user terminal.

The data query device based on the OLAP system provided in this embodiment can be used to implement the technical solution of the method embodiment shown in Figure 1, and the query request of the user terminal is received by the transceiver module, and the processing module logically partitions the first data table to obtain the second data table. A partition, obtain the hash subtable corresponding to each first partition and the boundary value of each first partition, and establish a connection mapping relationship, the connection mapping relationship represents the corresponding relationship between the boundary value of the first partition and the hash subtable, and then Partition the second data table to obtain the second partition. In the process of multi-thread query, each thread obtains and scans the first hash sub-table through the connection mapping relationship to obtain data, and then returns the data The client terminal solves the problems of long multi-thread query time and high server overhead in the prior art, effectively shortens data query time, and reduces server overhead.

In the second embodiment of the data query device based on the OLAP system of the present invention, on the basis of the above embodiments, the processing module 32 is used for:

If the first data table is in order, perform logical partition processing on the first data table according to the inherent order of the first data table, and obtain at least two of the first partitions;

or,

If the first data table is out of order, an ordered proxy column is added to the first data table as a primary key column, and the first data table is logically partitioned according to the order of the ordered proxy column, Obtain at least two of said first partitions.

Optionally, the processing module 32 is also used for:

If the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, and at least two second data tables are obtained. Partition;

or,

If the first data table is ordered and the second data table is out of order, partitioning the second data table according to parallel processing capability to obtain at least two second partitions;

or,

If the first data table is unordered and the second data table is unordered, then replace the original foreign key value in the second data table with the one corresponding to the ordered proxy column in the first data table new primary key value, and perform partition processing on the replaced second data table according to the parallel processing capability to obtain at least two second partitions.

Optionally, if the inherent order of the first data table and the second data table are the same, the processing module 32 is configured to: according to the same inherent order as the first data table, process the Partitioning is performed on the second data table to obtain at least two second partitions; wherein, the number of the second partitions is the same as the number of the first partitions.

Specifically, the obtaining module 33 is specifically configured to: scan the first hash sub-table, and obtain all data in associated rows in the first data table and the second data table corresponding to the query information information as said data.

The data query device based on the OLAP system provided in this embodiment can be used to implement the technical solution of any of the method embodiments 1 to 3, and its implementation principle and technical effect are similar, and will not be repeated here.

FIG. 4 is a schematic structural diagram of an embodiment of the data query system based on the OLAP system of the present invention. As shown in FIG. 4 , the system includes: a user terminal 41 and a data query device 42 based on an OLAP system described in any device embodiment shown in FIG. 3 . Wherein, the user terminal 41 is used to send a data query message to the data query device 42 based on the OLAP system, and is used to receive the data returned by the data query device 42 based on the OLAP system. The data query device 42 based on the OLAP system is used to execute the technical solution of any one of the method embodiments in Fig. 1, Fig. 2 and examples, and its implementation principle and technical effect are similar, and will not be repeated here.

Those of ordinary skill in the art can understand that all or part of the steps for implementing the above method embodiments can be completed by program instructions and related hardware. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above-mentioned method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than limiting them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: It is still possible to modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the technical solutions of the various embodiments of the present invention. scope.

Claims (11)

1. A data query method based on OLAP system, characterized in that, comprising: receiving a data query request sent by a user terminal, where the data query request includes query information, a first data table identifier, and a second data table identifier; According to the data query request, perform logical partition processing on the first data table corresponding to the first data table identifier, obtain at least two first partitions, and establish a corresponding connection mapping relationship for each first partition, so The connection mapping relationship includes: the boundary value of the first partition and the corresponding hash subtable; Partitioning the second data table corresponding to the second data table identifier, obtaining at least two second partitions, and obtaining the first foreign key value from the second partition for each second partition, the the first foreign key value is within a boundary value range of said first partition; Querying the connection mapping relationship to obtain a first hash subtable corresponding to the first foreign key value; Scanning the first hash sub-table, acquiring data corresponding to the query information, and returning the data to the user terminal. 2. The method according to claim 1, wherein the first data table corresponding to the first data table identifier is logically partitioned, at least two first partitions are obtained, and a connection mapping relationship is established, include: performing partition processing on the first data table according to the inherent order of the first data table, and acquiring at least two first partitions; For each of the first partitions, perform a hash operation according to the primary key of the first partition, and establish a corresponding hash subtable; For each of the first partitions, a corresponding connection mapping relationship is established according to the hash subtable corresponding to the first partition. 3. The method according to claim 1 or 2, wherein the logical partition processing is performed on the first data table corresponding to the first data table identifier, and at least two first partitions are obtained, including: If the first data table is in order, perform logical partition processing on the first data table according to the inherent order of the first data table, and obtain at least two of the first partitions; or, If the first data table is out of order, an ordered proxy column is added to the first data table as a primary key column, and the first data table is logically partitioned according to the order of the ordered proxy column, Obtain at least two of said first partitions. 4. The method according to claim 3, wherein the partitioning of the second data table corresponding to the second data table identifier to obtain at least two second partitions comprises: If the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, and at least two second data tables are obtained. Partition; or, If the first data table is ordered and the second data table is out of order, partitioning the second data table according to parallel processing capability to obtain at least two second partitions; or, If the first data table is unordered and the second data table is unordered, then replace the original foreign key value in the second data table with the one corresponding to the ordered proxy column in the first data table new primary key value, and perform partition processing on the replaced second data table according to the parallel processing capability to obtain at least two second partitions. 5. The method according to any one of claims 1 to 4, wherein the scanning of the first hash subtable to obtain data corresponding to the query information comprises: Scanning the first hash sub-table, and obtaining all data information in associated rows in the first data table and the second data table corresponding to the query information as the data. 6. A data query device based on OLAP system, characterized in that, comprising: A transceiver module, configured to receive a data query request sent by a user terminal, where the data query request includes query information, a first data table identifier, and a second data table identifier; A processing module, configured to perform logical partition processing on the first data table corresponding to the first data table identifier according to the data query request, acquire at least two first partitions, and establish a corresponding A connection mapping relationship, the connection mapping relationship including: the boundary value of the first partition and the corresponding hash subtable; The processing module is further configured to partition the second data table corresponding to the second data table identifier, acquire at least two second partitions, and obtain the second partition from the second partition for each second partition. a foreign key value, said first foreign key value being within a boundary value range of said first partition; An acquisition module, configured to query the connection mapping relationship, and acquire the first hash subtable corresponding to the first foreign key value; The acquisition module is further configured to scan the first hash subtable to acquire data corresponding to the query information, and return the data to the user terminal through the transceiver module. 7. The device according to claim 6, wherein the processing module is specifically used for: performing partition processing on the first data table according to the inherent order of the first data table, and acquiring at least two first partitions; For each of the first partitions, perform a hash operation according to the primary key of the first partition, and establish a corresponding hash subtable; For each of the first partitions, a corresponding connection mapping relationship is established according to the hash subtable corresponding to the first partition. 8. The device according to claim 6 or 7, wherein the processing module is used for: If the first data table is in order, perform logical partition processing on the first data table according to the inherent order of the first data table, and obtain at least two of the first partitions; or, If the first data table is out of order, an ordered proxy column is added to the first data table as a primary key column, and the first data table is logically partitioned according to the order of the ordered proxy column, Obtain at least two of said first partitions. 9. The device according to claim 8, wherein the processing module is also used for: If the first data table is in order and the second data table is in order, the second data table is partitioned according to the inherent order and parallel processing capability of the second data table, and at least two second data tables are obtained. Partition; or, If the first data table is ordered and the second data table is out of order, partitioning the second data table according to parallel processing capability to obtain at least two second partitions; or, If the first data table is unordered and the second data table is unordered, then replace the original foreign key value in the second data table with the one corresponding to the ordered proxy column in the first data table new primary key value, and perform partition processing on the replaced second data table according to the parallel processing capability to obtain at least two second partitions. 10. The device according to any one of claims 6 to 9, wherein the acquiring module is specifically used for: Scanning the first hash sub-table, acquiring all data information in associated rows in the first data table and the second data table corresponding to the query information as the data. 11. A data query system based on an OLAP system, characterized by comprising: a user terminal and the data query device based on an OLAP system according to any one of claims 6-10.