WO2016112502A1

WO2016112502A1 - Method, apparatus and computing device for storing query result

Info

Publication number: WO2016112502A1
Application number: PCT/CN2015/070656
Authority: WO
Inventors: 张军; 林晓勇
Original assignee: 华为技术有限公司
Priority date: 2015-01-14
Filing date: 2015-01-14
Publication date: 2016-07-21
Also published as: CN107735781B; CN107735781A

Abstract

Provided are a method and apparatus for storing a query result. The method comprises: determining multiple query tables corresponding to a first query request, wherein the first query request is used for requesting to perform a correlated subquery on the multiple query tables (S110); determining a target query table from the multiple query tables, wherein the target query table is a fact table of at least one query table in the multiple query tables except the target query table, and a fact table of the target query table does not exist in the multiple query tables (S120); determining a major key of a first table according to the target query table, wherein the first table is used for storing a query result corresponding to the first query request (S130); and storing the query result into the first table according to the major key of the first table (S140). The method and apparatus for storing a query result can avoid the problem in the prior art that the query efficiency is low when a correlated subquery is performed on the first tabled, thus improving the correlated subquery efficiency.

Description

Method and device for storing query result, computing device

Technical field

The present invention relates to the field of databases and, more particularly, to methods and apparatus, computing devices that store query results.

Background technique

Transaction Processing Performance Council Benchmark ^TM H (TPC-H) is mainly used to simulate the real business application environment, including simulating dynamic query of real business transaction database as a reference for decision support and database application system.

TPC-H mainly involves the following concepts:

a fact table for storing at least one fact record, each fact record corresponding to a row in the fact table, and including a key value column and a metric value column, wherein the value in the key value column corresponds to a dimension of the fact record, for example, a commodity origin , item price, item quantity, transaction date, item type, item name, etc.; the value in the metric column corresponds to the subject matter of the fact table, for example, sales or sales volume, and so on.

A dimension table for storing the dimension characteristics of the fact record. The dimension table may include a name column and an attribute column. For example, the origin of the product includes three columns, a place name (locationName), a place number (locationId), and an address (Address). ), where the origin name is the name column, the origin number and address are attribute columns. The key-value column in the fact table can correspond to the attribute column in the dimension table, and each key-value column in the fact table can correspond to a dimension table.

Temporary table for storing temporary data. The temporary table can be roughly divided into a transaction-level temporary table and a session-level temporary table, wherein the transaction-level temporary table is automatically deleted after the transaction is committed, and the session-level temporary table is deleted after the session ends.

The primary key, which uniquely identifies a column in the table, any two rows in a table have different primary key values, and the primary key does not allow null values. In general, the primary key of a table is the first column of the table.

Foreign key, used to join two tables, if the column M in the table A corresponds to the column N in the table B, that is, the column M and the column N correspond to the same attribute, for example, both correspond to the order number, and the column M For the primary key in Table A, column N is the foreign key in Table B. The foreign key of the fact table corresponds to the primary key of the dimension table.

In the database system, when multiple tables are associated with complex queries, if the data volume of multiple tables is large, a query statement can be decomposed into multiple query sub-statements and massively parallelized. The Massively Parallel Processing (MPP) mechanism distributes the plurality of query sub-statements to a plurality of nodes of the cluster. Each node can query according to the received query sub-statement, and store the query result corresponding to the query sub-statement into the temporary table. After the plurality of nodes complete the query, the query statement may be used to perform an associative query on the temporary table obtained by each node to obtain a final query result.

Take TPC-H's Q7 query and SQL as an example. If you want to query the delivery date between 1995 and 1997, and one of the supplier's country and the customer's country is France, the other is the German transaction record. You can use the query as shown in Table 1.

Table 1 TPC-H Q7 query statement example

Among them, in the SQL language, "select[A]from[TABLE B]where[C]" indicates that the data of the column A corresponding to the record matching the query condition C is selected from the table B. The above example involves a complex query, wherein the query table involved in the subquery in the complex query includes: a supplier table, a line item table, an orders table, a customer table, and a A country table named n1 and another country table named n2. The query result obtained by the subquery is inserted into the shipping table, and then the data of the columns supp_nation, cust_nation, l_year, and the data of the column revenue obtained by summing the data of the column volume are selected from the table shipping.

In order to improve query efficiency, the query statement corresponding to the above complex query may be decomposed into two query sub-sentences, wherein the first query sub-sentence is as shown in Table 2, and is used for table orders, table n1, table n2, and table customer. Perform an associative query and insert the query result into the temporary table q7_tmp_order_customer; the second query sub-statement is shown in Table 3, for the table lineitem, Table n1, table n2, and table supplier perform association query, and insert the query result into the temporary table q7_tmp_lineitem_supplier. Finally, the temporary table q7_tmp_order_customer and q7_tmp_lineitem_supplier can be correlated by the query statement shown in Table 4 to obtain the final query result.

Table 2 first query substatement

Table 3 second query substatement

Table 4 Query statements for associating queries between two temporary tables

Table 5 Temporary table q7_tmp_lineitem_supplier example

Where "insert into[table A]" indicates that the query result is inserted into the table A. However, since the primary key of the temporary table is not specified when the temporary table is created, the query result corresponding to the query substatement is stored. When stored in a temporary table, the node will actively add a non-meaningful primary key to the temporary table. For example, as shown in Table 5, the node uses the column ID whose value is the row number as the primary key of the temporary table q7_tmp_lineitem_supplier, and uses the query result as Columns other than the primary key are inserted into the temporary table. In this way, when performing an associative query on multiple temporary tables, there may be duplicate values in one or more of the multiple temporary tables, and each record needs to be filtered during the query process, resulting in the efficiency of the multi-table associated query. low. In order to solve the above problem, an index can be created for one column in at least one temporary table, but since the temporary table is only used by the current query, the cost of creating the index is high, and in addition, since the data of the temporary table needs to be inserted frequently, the index may be caused. Invalid.

Summary of the invention

The embodiments of the present invention provide a method, a device, and a computing device for storing query results, which can avoid the problem of low query efficiency when performing related queries in the prior art.

The first aspect provides a method for storing a query result, including: determining a plurality of query tables corresponding to the first query request, wherein the first query request is used to request an association query for the plurality of query tables; Determining a target query table in the plurality of query tables, wherein the fact table of the target query table does not exist in the plurality of query tables, and the target query table is at least one of the plurality of query tables except the target query table Querying a fact table of the table; determining, according to the target query table, a primary key of the first table, wherein the first table is configured to store a query result corresponding to the first query request; and the query result is obtained according to the primary key of the first table Stored to the first table.

In a first possible implementation manner, the storing the query result to the first table according to the primary key of the first table includes: storing the query result in a column cluster manner according to the primary key of the first table To the first table.

In combination with the foregoing possible implementation manner, in the second possible implementation, the determining the target query table from the multiple query tables includes: determining at least one first associated query condition corresponding to the first query request, where The first associated query condition is composed of a first column in the first query table and a second column in the second query table, the plurality of query tables including the first query table and the first query table different from the first query table a second query table; determining an association relationship between the first query table and the second query table corresponding to the at least one first associated query condition; and according to the relationship between the first query table and the second query table, The target lookup table is determined in the first lookup table and the second lookup table.

In combination with the foregoing possible implementation manner, in a third possible implementation manner, determining the association relationship between the first query table and the second query table includes: determining a first column of the first query table Whether it is the primary key of the first query table; if the first column of the first query table is the primary key of the first query table, determining that the second query table is the fact table of the first query table; if the first query The first column of the table is a foreign key of the first query table, and the first query table is determined to be a fact table of the second query table.

In combination with the foregoing possible implementation manner, in a fourth possible implementation manner, the first query request corresponds to a first associated query condition, and the third determining sub-unit is specifically configured to: if the second determining sub-unit determines the first The second lookup table is the fact table of the first query table, and the second query table is determined to be the target query table; if the second determining subunit determines that the first query table is the fact table of the second query table, The first query table is determined to be the target query table.

In combination with the foregoing possible implementation manner, in a fifth possible implementation, the first query request corresponds to multiple first associated query conditions; and according to the relationship between the first query table and the second query table, Determining the target query table from the first query table and the second query table, comprising: establishing an association relationship tree according to an association relationship between the first query table and the second query table, wherein, if the second The query table is a fact table of the first query table, and the second query table is a parent node of the first query table; the root node of the relationship tree is determined as the target query table.

In combination with the foregoing possible implementation manner, in a sixth possible implementation manner, determining the primary key of the first table according to the target query table includes: determining whether the target query table exists in multiple columns corresponding to the query result The non-federated primary key; if the non-federal primary key of the target query table exists in the plurality of columns, the non-union primary key of the target query table is determined as the primary key of the first table.

In combination with the foregoing possible implementation manner, in a seventh possible implementation manner, determining the primary key of the first table according to the target query table, further includes: if the target query table does not exist in the multiple columns Determining, by the primary key, a second query request corresponding to the first query request, the second query request is used to request an association query for the first table and the second table; and determining, according to the second query request, the first table Primary key.

In combination with the foregoing possible implementation manners, in the eighth possible implementation, the determining, by the second query request, the primary key of the first table includes: determining at least one second associated query condition corresponding to the second query request The second associated query condition is composed of a third column of the first table and a fourth column of the second table; determining a second target associated query condition from the at least one second associated query condition, the second The target association query condition includes a primary key of the second table; the third column of the first table included in the second target association query condition is determined as a primary key of the first table.

The second aspect provides an apparatus for storing a query result, including: a first determining unit, configured to determine a plurality of query tables corresponding to the first query request, where the first query request is used to request a pair The plurality of lookup tables are associated with the query; the second determining unit is configured to determine a target query table from the plurality of query tables determined by the first determining unit, where the target query table does not exist in the plurality of query tables a fact table, and the target query table is a fact table of at least one query table of the plurality of query tables except the target query table; and a third determining unit, configured to determine the target query table according to the second determining unit Determining a primary key of the first table, wherein the first table is configured to store a query result corresponding to the first query request; and the storage unit is configured to use the primary key of the first table determined by the third determining unit to query the query The result is stored to the first table.

In a first possible implementation, the storage unit is configured to: store the query result in the column cluster to the first table according to the primary key of the first table determined by the third determining unit.

In combination with the foregoing possible implementation manner, in a second possible implementation manner, the second determining unit includes: a first determining sub-unit, configured to determine at least one first associated query condition corresponding to the first query request, where The first associated query condition is composed of a first column in the first query table and a second column in the second query table, the plurality of query tables including the first query table and the first query table different from the first query table a second determining sub-unit, configured to determine an association relationship between the first query table and the second query table corresponding to the at least one first associated query condition determined by the first determining sub-unit; a determining subunit, configured to determine the target query table from the first query table and the second query table according to the association relationship between the first query table and the second query table determined by the second determining subunit .

In combination with the foregoing possible implementation manner, in a third possible implementation, the second determining sub-unit is specifically configured to: determine whether the first column in the first query table is a primary key of the first query table; The first column in the first query table is the primary key of the first query table, and the second query table is determined to be the fact table of the first query table; if the first column in the first query table is the first query The foreign key of the table determines that the first lookup table is a fact table of the second lookup table.

In combination with the foregoing possible implementation manner, in a fifth possible implementation, the first query request is corresponding to multiple first associated query conditions; the third determining sub-unit is specifically configured to: determine, according to the second determining sub-unit Establishing an association relationship between the first query table and the second query table a tree, wherein the second query table is a fact table of the first query table, the second query table is a parent node of the first query table; and the root node of the relationship tree is determined as the target query table .

In combination with the foregoing possible implementation manner, in a sixth possible implementation manner, the third determining unit includes: a fourth determining sub-unit, configured to determine whether the target query table is not present in the multiple columns corresponding to the query result a first determining sub-unit, configured to determine, when the fourth determining sub-unit determines that the non-co-primary primary key of the target query table exists in the plurality of columns, determining the non-union primary key of the target query table as the first table Primary key.

In conjunction with the foregoing possible implementation manner, in a seventh possible implementation, the third determining unit further includes: a sixth determining subunit, configured to determine, if the fourth determining subunit, the target does not exist in the multiple columns Querying a non-joined primary key of the table, determining a second query request corresponding to the first query request, the second query request is used to request an association query for the first table and the second table; and the seventh determining subunit is configured to: Determining the primary key of the first table according to the second query request determined by the sixth determining subunit.

With reference to the foregoing possible implementation manners, in the eighth possible implementation, the seventh determining sub-unit is specifically configured to: determine at least one second associated query condition corresponding to the second query request, where the second associated query The condition is composed of a third column of the first table and a fourth column of the second table; determining a second target associated query condition from the at least one second associated query condition, the second target associated query condition including the second a primary key of the table; determining a third column of the first table included in the second target association query condition as a primary key of the first table.

In a third aspect, a computing device is provided, comprising: a processor, a memory, and a bus; the memory is configured to store a computer to execute instructions, the processor is coupled to the memory via the bus, and when the computing device is running, the processor The computer-executed instructions stored in the memory are read to perform the method of storing the query results in the first aspect or any of the possible implementations of the first aspect.

Based on the foregoing technical solution, the method and device for storing a query result and the computing device provided by the embodiment of the present invention determine a target query table from a plurality of query tables corresponding to the first query request, where the target query table is the multiple query a fact table of at least one query table other than the target query table, and a fact table of the target query table does not exist in the plurality of query tables, and determining a first one for storing the query result according to the target query table The primary key of the table can avoid the problem that the query efficiency is low when the related query of the first table is subsequently performed due to the column having no practical meaning as the primary key of the first table in the prior art, thereby improving the efficiency of the related query.

DRAWINGS

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings to be used in the embodiments of the present invention or the description of the prior art will be briefly described below. Obviously, the drawings described below are only the present invention. For some embodiments, other drawings may be obtained from those of ordinary skill in the art without departing from the drawings.

FIG. 1 is a schematic flowchart of a method for storing a query result according to an embodiment of the present invention.

FIG. 2 is another schematic flowchart of a method for storing a query result according to an embodiment of the present invention.

FIG. 3 is a schematic diagram of an association tree in an example of a method for storing a query result according to an embodiment of the present invention.

FIG. 4 is a schematic diagram of another association tree in an example of a method for storing a query result according to an embodiment of the present invention.

FIG. 5 is a schematic block diagram of an apparatus for storing a query result according to an embodiment of the present invention.

FIG. 6 is a schematic block diagram of another apparatus for storing a query result according to an embodiment of the present invention.

FIG. 7 is a schematic block diagram of a computing device provided by an embodiment of the present invention.

detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are a part of the embodiments of the present invention, but not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts shall fall within the scope of the present invention.

It should be understood that the technical solutions of the embodiments of the present invention can be applied to various database systems, for example, a Relational Database Management System (RDBMS), a non-relational (NoSQL) database system, and a massively parallel processing database (Massively). Parallel Processing Database, MPP-DB, and the like, which are not limited by the embodiment of the present invention.

It should be understood that the embodiment of the present invention is described by using a Structured Query Language (SQL) language as an example. However, the embodiment of the present invention may also adopt other languages, for example, an object-oriented query language (Hibernate Query Language, HQL). The embodiment of the present invention does not limit this.

FIG. 1 is a schematic flowchart of a method 100 for storing a query result according to an embodiment of the present invention. The method 100 may be performed by a device that stores a query result. Specifically, the device for storing the query result may be specifically a standalone device or a module in the device, for example, the device for storing the query result. It may be a stand-alone or a cluster node, but the embodiment of the present invention is not limited thereto.

S110. Determine a plurality of query tables corresponding to the first query request, where the first query request is used to request an association query for the plurality of query tables.

The device storing the query result may receive a first query request from the client, wherein the first query request from the client may be forwarded to the device storing the query result by the network device or other device. The first query request may request an association query for the plurality of query tables. For example, the query statement corresponding to the first query request may be as shown in any table in Tables 1 to 4. The first query request may be an independent query, or may be a subquery of a complex query, which is not limited by the embodiment of the present invention.

The device storing the query result may determine, according to the first query request, a plurality of query tables corresponding to the first query request, and perform an associative query on the plurality of first tables. At this time, the query statement corresponding to the first query request may include a where statement, and the query condition defined by the where statement may include an associated query condition. The associated query condition may be composed of column M in table A and column N in table B, and column M and column N may be connected by an equal sign in the query statement, for example, in the query condition shown in Table 1, the query statement The "where s_suppkey=l_suppkey" corresponds to an associated query condition, which is composed of the column suction key in the table supplier and the column suppkey in the table lineitem, but the embodiment of the present invention is not limited thereto.

S120. Determine a target query table from the plurality of query tables, where the target query table is a fact table of at least one query table of the plurality of query tables except the target query table, and the plurality of query tables are There is no fact table for the target lookup table.

The plurality of lookup tables include the target lookup table. The target query table may be a fact table of one or more other tables in the plurality of query tables, but the fact table of the target query table is not included in the plurality of query tables. Specifically, the device that stores the query result may determine the target query table from the plurality of query tables according to the query condition included in the first query request, but the embodiment of the present invention is not limited thereto.

S130. Determine, according to the target query table, a primary key of the first table, where the first table is configured to store a query result corresponding to the first query request.

The means for storing the query result can determine to store the query result to the first table in a plurality of ways. Optionally, the first query request may request to store the query result of the associated query for the plurality of query tables to the first table, where the first table may be a normal table or a temporary table, and correspondingly, the first query request The corresponding query statement may include an insert into statement, and the device storing the query result determines the first table according to the first query request. Alternatively, the device storing the query result may The first table may be a temporary table, but the embodiment of the present invention is not limited thereto.

S140. Store the query result to the first table according to the primary key of the first table.

The query result may include data of a plurality of columns corresponding to the target record in the plurality of query tables, wherein the data of the plurality of columns corresponding to the target record may include data of at least one column in the target record, or The data obtained by performing the mathematical operation on the data of the at least one column in the target record may be an index value or a character string, which is not limited in the embodiment of the present invention.

Therefore, according to the method for storing the query result, the target query table is determined from the plurality of query tables corresponding to the first query request, wherein the target query table is the target query table among the plurality of query tables. a fact table of at least one query table, and a fact table of the target query table does not exist in the plurality of query tables, and determining a primary key of the first table for storing the query result according to the target query table, can avoid existing In the technology, the column with no practical meaning is used as the primary key of the first table, which causes the query efficiency to be low when the related query is performed on the first table, thereby improving the efficiency of the related query.

In the embodiment of the present invention, the plurality of columns corresponding to the query result may include the primary key of the first table, and correspondingly, in S140, the device storing the query result may include the plurality of columns corresponding to the query result. The other column than the primary key of the first table is inserted into the first table in the form of a non-primary key. Optionally, if the primary key of the first table corresponding to the query result has a duplicate value, the device storing the query result may store a plurality of columns corresponding to the query result in a column family manner, so that the The primary key in the first table does not have a duplicate value, but the embodiment of the present invention is not limited thereto.

Optionally, S140, storing the query result to the first table according to the primary key of the first table, including:

The query result is stored in the first table in the form of a column cluster according to the primary key of the first table.

For example, the temporary table q7_tmp_order_customer obtained by the first query sub-statement shown in Table 2 may be stored in the form of a column cluster shown in Table 6, and the temporary table q7_tmp_lineitem_supplier obtained by the second query sub-statement shown in Table 3 may be The column cluster form shown in Table 7 is stored.

Table 6 Temporary table q7_tmp_order_customer stored as a column cluster

Table 7 Temporary table q7_tmp_lineitem_supplier stored as a column cluster

Optionally, as another embodiment, before the query result is inserted and stored in the first table, the device storing the query result may determine whether the first table exists, and if the first table does not exist, The means for storing the query result may first establish the first table, then insert the query result into the first table and store the first table. If the first table already exists, the device storing the query result may directly insert the query result into the first table, or first delete the first table and re-establish the first table, and then insert the query result into the newly created first The first table is stored in a table, but the embodiment of the invention is not limited thereto.

In S120, the device storing the query result may determine the target query table from the plurality of lookup tables in a plurality of manners. As an optional embodiment, the device storing the query result may determine the target query table from the plurality of query tables according to the at least one first associated query condition corresponding to the first query request.

Optionally, as shown in FIG. 2, S120, determining a target query table from the plurality of lookup tables, including:

S121. Determine at least one first associated query condition corresponding to the first query request, where the first associated query condition is formed by a first column in the first query table and a second column in the second query table, where the multiple The lookup table includes the first lookup table and the second lookup table different from the first lookup table;

S122. Determine an association relationship between the first query table and the second query table corresponding to the first associated query condition.

S123. Determine the target query table from the first query table and the second query table according to the association relationship between the first query table and the second query table.

Specifically, in the query statement corresponding to the first query request, the first column of the first query table and the second column of the second query table may be connected by an equal sign. Taking the second query sub-sentence shown in Table 3 as an example, the query sub-statement includes two associated query conditions, that is, the associated query condition "l_suppkey=s_suppkey" consisting of the column suppkey of the table lineitem and the column suppkey of the table supplier. The associated query condition "s_nationkey=n1.n_nationkey" consists of the column nationkey in the table supplier and the column nationkey in the table n1. The means for storing the query result may determine the target lookup table from the table lineitem, the table supplier, and the table n1.

Optionally, as another embodiment, S122, determining an association relationship between the first query table and the second query table, including:

Determining whether the first column of the first lookup table is a primary key of the first lookup table;

If the first column of the first query table is the primary key of the first query table, determining that the second query table is a fact table of the first query table;

If the first column of the first query table is a foreign key of the first query table, determining that the first query table is a fact table of the second query table.

If the device storing the query result determines that the first column is the primary key of the first query table, it indicates that the second column is a foreign key of the second query table, and at this time, the device storing the query result may determine the first A lookup table is a dimension table of the second lookup table, and the second lookup table is a fact table of the first lookup table. Optionally, if the device storing the query result determines that the first column is a foreign key of the first query table, indicating that the second column is a primary key of the second query table, and at this time, the device storing the query result The first query table may be determined as a fact table of the second query table, and the second query table is a dimension table of the first query table.

Alternatively, the device storing the query result may also determine whether the second column is the second query table a primary key, if the second column is the primary key of the second lookup table, the means for storing the query result may determine that the first lookup table is a fact table of the second lookup table; and if the second column is the first The device that stores the result of the query may determine that the second lookup table is a fact table of the first lookup table, but the embodiment of the present invention is not limited thereto.

It should be understood that, in the embodiment of the present invention, unless explicitly stated or directly from the context, the term "primary key" may refer to a column capable of uniquely identifying a row, that is, a non-joined primary key. In this case, the primary key corresponds to one column, and may also mean capable of A plurality of columns that uniquely identify one row or a column that can uniquely identify a row together with other columns, that is, one of a joint primary key or a joint primary key. In this case, the primary key corresponds to one of the plurality of columns or columns, which is not limited in this embodiment of the present invention. .

If the first query request corresponds to a first associated query condition, and the device storing the query result determines that the second query table is a fact table of the first query table, the device storing the query result may determine the second query The table is the target query table. If the first query request corresponds to the plurality of first associated query conditions, the device storing the query result may determine an association relationship between the two query tables in each of the first associated query conditions, and according to the plurality of first The association relationship between the two query tables in each of the first associated query conditions in the associated query condition is determined, and the target query table is determined. Still taking the second query sub-sentence shown in FIG. 3 as an example, the device storing the query result may determine an association relationship between the table lineitem and the table supplier and an association relationship between the table supplier and the table n1. The typical form of the table lineitem can be as shown in Table 8, wherein orderkey and linenumber are used as the joint primary key of the table lineitem, and an orderkey value and a linenumber value can jointly identify one row in the table. The typical form of the table supplier can be as shown in Table 9, where suppkey is the non-union primary key of the table supplier, which can identify one row in the table separately. A typical form of the table nation named table n1 can be as shown in Table 10, where nationkey is the primary key of table n1. At this point, it can be known from Table 8 and Table 9, that suppkey is the foreign key of the table lineitem and is the primary key of the table supplier, then the table lineitem is the fact table of the table supplier; as shown in Table 9 and Table 10, the nationkey is the table. The foreign key of the supplier is the primary key of the table n1, and the table supplier is the fact table of the table n1. In the three lookup tables of table lineitem, supplier and n1, the table lineitem is the fact table of the table supplier, and the fact table of the table lineitem does not exist in the table lineitem, supplier and n1, therefore, the device storing the query result can determine the table Lineitem is the target query table.

Figure 8 table lineitem example

Figure 9 table supplier example

Figure 10 Table nation example

Optionally, in another embodiment, the first query request corresponds to a first associated query condition;

Correspondingly, the S123 determines the target query table from the first query table and the second query table according to the association relationship between the first query table and the second query table, including:

If the second lookup table is a fact table of the first lookup table, determining that the second lookup table is the target lookup table;

If the first lookup table is a fact table of the second lookup table, it is determined that the first lookup table is the target lookup table.

Optionally, as another embodiment, if the first query request corresponds to multiple first associated query conditions, the association relationship between the first query table and the second query table is obtained from the first query. The target query table is determined in the table and the second query table, including:

And establishing, according to the association relationship between the first query table and the second query table, the second query table is the first query table, and the second query table is the first Query the parent node of the table;

The root node of the association tree is determined as the target query table.

When the association tree is established, the device storing the query result may use the fact table as the parent node of the dimension table, and one node may have multiple child nodes. At this time, since the parent node of the root node does not exist in the relationship tree, that is, the fact table of the root node is not included in the relationship tree, and the child node of the root node exists in the relationship tree, that is, the root node exists. The dimension table, therefore, the device storing the query result can determine the root node of the association tree as the target query table. Still taking the second query sub-sentence shown in Table 3 as an example, according to the table factitem is the fact table of the table supplier and the table supplier is the fact table of the table n1, the device storing the query result can establish the association as shown in FIG. The relationship tree, wherein the line item table is the root node of the relationship tree, and therefore, the device storing the query result may determine that the table lineitem is the target query table corresponding to the second query sub-statement. Similarly, the association tree shown in FIG. 4 can be established according to the first query sub-statement shown in Table 2, wherein the root node of the association relationship tree is an orders table, so the storage query node The device may determine that the table orders are the target query tables corresponding to the first query sub-statement shown in Table 2, but the embodiment of the present invention is not limited thereto.

Optionally, as another embodiment, S130, determining, according to the target query table, the primary key of the first table, including:

Determining whether a non-union primary key of the target query table exists in multiple columns corresponding to the query result;

If the non-union primary key of the target query table exists in the plurality of columns, the non-union primary key of the target query table is determined as the primary key of the first table.

Specifically, the device storing the query result may determine whether the primary key of the target query table is a federated primary key or a non-unified primary key. If the primary key of the target query table is a joint primary key, the device storing the query result may determine the corresponding query result. A non-federated primary key for the target query table does not exist in more than one column. Taking the second query sub-sentence shown in Table 3 as an example, the target query table corresponding to the second query sub-statement is a table lineitem, and the primary key of the table lineitem is a joint primary key composed of orderkey and linenumber, then the stored query The resulting device may determine a non-joined primary key that does not include the table orders in the plurality of columns corresponding to the query result, but the embodiment of the present invention is not limited thereto.

Optionally, if the primary key of the target query table is a non-union primary key, the device storing the query result may further determine whether a non-union primary key of the target query table exists in the multiple columns corresponding to the query result. Taking the first query sub-sentence shown in Table 2 as an example, the target query table corresponding to the first query sub-statement is the table orders, and the primary key of the table orders is orderkey, then the device storing the query result can determine the first Whether the plurality of columns o_orderkey, n1.n_name, and n2.n_name corresponding to a query sub-statement includes the primary key orderkey of the table orders. Since the plurality of columns includes o_orderkey, the device storing the query result may use o_orderkey as the primary key of the temporary table q7_tmp_order_customer, but the embodiment of the present invention is not limited thereto.

Optionally, as another embodiment, S130, determining a primary key of the first table according to the target query table, further includes:

If the non-joined primary key of the target query table does not exist in the multiple columns corresponding to the query result, determining a second query request corresponding to the first query request, the second query request is used to request the first table and the first query The second table performs an associated query;

According to the second query request, the primary key of the first table is determined.

If the non-federated primary key of the target query table does not exist, that is, the primary key of the target query table is specifically a union primary key, or if the primary key of the target query table is a non-union primary key, but the multiple columns corresponding to the query result do not include the The non-union primary key of the target query table, and the non-union primary key of the target query table does not exist in the multiple columns corresponding to the query result. At this point, the device that stores the query result can be confirmed Determining whether there is a second query request corresponding to the first query request, if there is no second query request corresponding to the first query request, the device storing the query result may use a column having no meaning as the first The primary key of a table. If there is a second query request corresponding to the first query request, the device storing the query result may determine the primary key of the first table according to the second query request. Specifically, the second query request is used to perform an associative query on the first table and the second table, for example, the first table is a temporary table q7_tmp_lineitem_supplier, and the query statement shown in Table 4 is used for the temporary tables q7_tmp_order_customer and q7_tmp_lineitem_supplier The association query is performed. Therefore, the query statement shown in Table 4 can be used as the second query request corresponding to the first query request shown in Table 3. At this time, the device storing the query result may determine the primary key of the temporary table q7_tmp_lineitem_supplier according to the query statement shown in Table 4, but the embodiment of the present invention is not limited thereto.

The means for storing the query result may determine the primary key of the first table according to the second query request in a plurality of manners. As an optional embodiment, determining the primary key of the first table according to the second query request includes:

Determining at least one second associated query condition corresponding to the second query request, wherein the second associated query condition is composed of a third column of the first table and a fourth column of the second table;

Determining, from the at least one second associated query condition, a second target associated query condition, the second target associated query condition including a primary key of the second table;

The third column of the first table included in the second target association query condition is determined as the primary key of the first table.

The second associated query condition may be composed of a third column of the first table and a fourth column of the second table, and the device storing the query result may be from the at least one second associated query condition corresponding to the second query request Determining a second target association query condition, wherein the second target association query condition is composed of a third column of the first table and a fourth column of the second table, and the fourth column is a primary key of the second table. The device storing the query result may determine the third column of the first table in the second target association query condition as the primary key of the first table, but the embodiment of the present invention is not limited thereto.

The second query request may be specifically used to request an association query for the first table and the at least one second table. Optionally, as another embodiment, if the number of the second table is multiple, the device storing the query result may be from the multiple before the device storing the query result determines the second target association query condition Determining, in the second table, the second target table, wherein the second target table is a fact table of at least one of the plurality of second tables, and the fact that the second target table does not exist in the plurality of second tables table. At this time, the device storing the query result may determine the second target query condition from the at least one second associated query condition corresponding to the second query request, where the second target query bar The device is composed of a primary key of the second target table and a third column of the first table, and the device storing the query result may use the third column of the first table in the second target query condition as the first table The primary key, but the embodiment of the present invention is not limited thereto.

Taking the second query sub-sentence shown in Table 3 as an example, the query statement shown in Table 4 is the second query request corresponding to the second query sub-sentence, and the second query request is used for the first table. (The temporary table q7_tmp_lineitem_supplier, named table n2) and a second table (temporary table q7_tmp_order_customer, named table n1) for the associated query. At this time, the query statement shown in Table 4 includes three second associated query conditions, "n2.l_orderkey=n1.o_orderkey", "n1.cust_nation=n2.cust_nation", and "n1.supp_nation=n2.supp_nation", The second target association query condition in the three second association query conditions is “n2.l_orderkey=n1.o_orderkey”, and the target association query condition is formed by the primary key o_orderkey of the table n1 and the column l_orderkey of the table n2, then the The device storing the query result may use the l_orderkey as the primary key of the temporary table q7_tmp_lineitem_supplier. At this time, the primary key l_orderkey of the temporary table q7_tmp_lineitem_supplier corresponds to the primary key o_orderkey of the temporary table q7_tmp_order_customer, and there is no duplicate data in both. At this time, when the related query shown in Table 4 is performed, the direct query can be performed without establishing an index, thereby Improve query efficiency and speed.

It should be noted that the examples of Tables 1 to 4 are intended to assist those skilled in the art to better understand the embodiments of the present invention and are not intended to limit the scope of the embodiments of the present invention. It will be obvious to those skilled in the art that various modifications and changes can be made in accordance with the examples shown in Tables 1 through 4, and such modifications or variations are also within the scope of the embodiments of the present invention.

It should be understood that the size of the sequence numbers of the above processes does not imply a sequence of executions, and the order of execution of the processes should be determined by its function and internal logic, and should not be construed as limiting the implementation of the embodiments of the present invention.

It should also be understood that in the embodiments of the present invention, the terms "first", "second", and "third" are used only to distinguish different contents, and should not be construed as limiting the embodiments of the present invention. Embodiment of the present invention The first table and the second table are only for distinguishing different tables. The first column in the first query table and the second column in the second query table are only for distinguishing among the related query conditions belonging to the first query table. Query the column and the query column belonging to the second query table. Similarly, the third column in the first table and the fourth column in the second table are only for distinguishing different columns, and the respective columns are not in the table. The specific location creates a limit.

The method for storing the query result according to the embodiment of the present invention is described in detail above with reference to FIG. 1 to FIG. 4, and an apparatus for storing the query result according to an embodiment of the present invention will be described below with reference to FIG. 5 to FIG.

FIG. 5 schematically illustrates an apparatus 200 for storing query results in accordance with an embodiment of the present invention. As shown in FIG. 5, the apparatus 200 includes:

The first determining unit 210 is configured to determine a plurality of query tables corresponding to the first query request, where the first query request is used to request an associated query for the plurality of query tables;

a second determining unit 220, configured to determine a target query table from the plurality of query tables determined by the first determining unit 210, wherein a fact table of the target query table does not exist in the plurality of query tables, and the target query The table is a fact table of at least one query table of the plurality of query tables except the target query table;

The third determining unit 230 is configured to determine a primary key of the first table according to the target query table determined by the second determining unit 220, where the first table is configured to store a query result corresponding to the first query request;

The storage unit 240 is configured to store the query result to the first table according to the primary key of the first table determined by the third determining unit 230.

Therefore, the apparatus for storing a query result according to an embodiment of the present invention determines a target query table from a plurality of query tables corresponding to the first query request, wherein the target query table is the target query table of the plurality of query tables. a fact table of at least one query table, and a fact table of the target query table does not exist in the plurality of query tables, and determining a primary key of the first table for storing the query result according to the target query table, can avoid existing In the technology, the column with no practical meaning is used as the primary key of the first table, which causes the query efficiency to be low when the related query is performed on the first table, thereby improving the efficiency of the related query.

Optionally, as another embodiment, the apparatus 200 may further include:

a receiving unit, configured to receive the first query request from the client before the first determining unit 210 determines the plurality of query tables corresponding to the first query request;

The query unit is configured to perform an associative query on the plurality of lookup tables according to the first query request received by the receiving unit.

At this time, the storage unit 240 is specifically configured to store the query result obtained by the query unit to the first table.

Optionally, the storage unit 240 is configured to: store the query result to the first table in a column cluster manner according to the primary key of the first table determined by the third determining unit 230.

Optionally, as another embodiment, the second determining unit 220 includes:

a first determining subunit, configured to determine at least one first associated query condition corresponding to the first query request, where the first associated query condition is determined by a first column in the first query table and a second query table a second column, the plurality of lookup tables including the first lookup table and the second lookup table different from the first lookup table;

a second determining subunit, configured to determine an association relationship between the first query table and the second query table corresponding to the first associated query condition determined by the first determining subunit;

a third determining subunit, configured to determine the target from the first query table and the second query table according to the association relationship between the first query table and the second query table determined by the second determining subunit Query the table.

Optionally, as another embodiment, the second determining subunit is specifically configured to:

Correspondingly, the third determining subunit is specifically configured to:

If the second determining subunit determines that the second query table is a fact table of the first query table, determining that the second query table is the target query table;

And if the second determining subunit determines that the first query table is a fact table of the second query table, determining that the first query table is the target query table.

Optionally, in another embodiment, the first query request corresponds to multiple first associated query conditions. In this case, the third determining sub-unit is specifically configured to:

Determining between the first lookup table and the second lookup table according to the second determining subunit And establishing a relationship tree, where the second query table is a fact table of the first query table, and the second query table is a parent node of the first query table;

The root node of the association tree is determined as the target query table.

Optionally, as another embodiment, the third determining unit 230 includes:

a fourth determining subunit, configured to determine whether a non-union primary key of the target query table exists in multiple columns corresponding to the query result;

And a fifth determining subunit, configured to determine, as the fourth determining subunit, the non-union primary key of the target query table in the plurality of columns, and determine the non-union primary key of the target query table as the primary key of the first table.

Optionally, in another embodiment, the third determining unit further includes:

a sixth determining subunit, configured to: if the fourth determining subunit determines that the non-joined primary key of the target query table does not exist in the plurality of columns, determine a second query request corresponding to the first query request, the second query The request is used to request an association query for the first table and the second table;

And a seventh determining subunit, configured to determine a primary key of the first table according to the second query request determined by the sixth determining subunit.

Optionally, in another embodiment, the seventh determining subunit is specifically configured to:

The apparatus 200 for storing query results according to an embodiment of the present invention may correspond to an execution body of the method 100 of storing a query result according to an embodiment of the present invention, and storing the above and other operations of the respective modules in the apparatus 200 of the query result and/or The functions are respectively implemented in order to implement the corresponding processes of the respective methods in FIG. 1 to FIG. 4, and are not described herein for brevity.

Therefore, the apparatus for storing a query result according to an embodiment of the present invention determines a target query table from a plurality of query tables corresponding to the first query request, wherein the target query table is the target query table of the plurality of query tables. a fact table of at least one query table, and a fact table of the target query table does not exist in the plurality of query tables, and determining a primary key of the first table for storing the query result according to the target query table, can avoid existing In the technology, the column that has no practical meaning is used as the primary key of the first table. The problem of inefficient query is caused by subsequent association query on the first table, thereby improving the efficiency of the associated query.

FIG. 6 schematically illustrates another apparatus 300 for storing query results in accordance with an embodiment of the present invention. As shown in FIG. 6, the apparatus 300 includes:

The processor 310 is configured to: determine a plurality of query tables corresponding to the first query request, where the first query request is used to request an associated query for the plurality of query tables; and determine a target query table from the plurality of query tables The fact table of the target query table does not exist in the plurality of query tables, and the target query table is a fact table of at least one query table of the plurality of query tables except the target query table; according to the target Querying a table, determining a primary key of the first table, where the first table is configured to store a query result corresponding to the first query request;

The memory 320 is configured to store the query result to the first table according to the primary key of the first table determined by the processor 310.

It should be understood that, in the embodiment of the present invention, the processor 310 may be a central processing unit ("CPU"), and the processor 310 may also be other general-purpose processors, digital signal processors (DSPs). , an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, and the like. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like.

The memory 320 can include read only memory and random access memory and provides instructions and data to the processor 310. A portion of the memory 320 may also include a non-volatile random access memory. For example, the memory 320 can also store information of the device type.

In the implementation process, each step of the foregoing method may be completed by an integrated logic circuit of hardware in the processor 310 or an instruction in a form of software. The steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor. Software modules can be located in random access memory, flash memory, read-only memory, programmable only Read memory or electrically erasable programmable memory, registers, etc. are well-known storage media in the field. The storage medium is located in the memory 320, and the processor 310 reads the information in the memory 320 and combines the hardware to perform the steps of the above method. To avoid repetition, it will not be described in detail here.

Optionally, as another embodiment, the apparatus 200 may further include:

a receiver, configured to receive the first query request from the client before the processor 310 determines the plurality of query tables corresponding to the first query request;

Correspondingly, the processor 310 is further configured to perform an association query on the plurality of lookup tables according to the first query request received by the receiver.

At this time, the memory 320 is specifically configured to store the query result obtained by the processor 310 to the first table.

Optionally, the memory 320 is specifically configured to: store the query result to the first table in a column cluster manner according to the primary key of the first table determined by the processor 310.

Optionally, as another embodiment, the processor 310 is specifically configured to:

Determining at least one first associated query condition corresponding to the first query request, wherein the first associated query condition is composed of a first column in the first query table and a second column in the second query table, the multiple queries The table includes the first lookup table and the second lookup table different from the first lookup table;

Determining an association relationship between the first query table and the second query table corresponding to the first associated query condition;

Determining the target query table from the first query table and the second query table according to the association relationship between the first query table and the second query table.

Correspondingly, the processor 310 is specifically configured to:

If it is determined that the second query table is a fact table of the first query table, determining that the second query table is the target query table;

If it is determined that the first query table is a fact table of the second query table, determining that the first query table is The target query table.

Optionally, in another embodiment, the first query request corresponds to multiple first associated query conditions. In this case, the processor 310 is specifically configured to:

The root node of the association tree is determined as the target query table.

Optionally, as another embodiment, the processor 310 is further configured to:

If it is determined that the non-union primary key of the target query table exists in the plurality of columns, the non-union primary key of the target query table is determined as the primary key of the first table.

Optionally, as another embodiment, the processor 310 is further configured to:

If it is determined that the non-joined primary key of the target query table does not exist in the plurality of columns, determining a second query request corresponding to the first query request, the second query request is used to request to perform the first table and the second table Associated query;

Optionally, in another embodiment, the processor 310 is specifically configured to:

The apparatus 300 for storing query results according to an embodiment of the present invention may correspond to an execution body of the method 100 of storing a query result according to an embodiment of the present invention, and storing the above and other operations of the respective modules in the apparatus 300 of the query result and/or The functions are respectively implemented in order to implement the corresponding processes of the respective methods in FIG. 1 to FIG. 4, and are not described herein for brevity.

Therefore, the apparatus for storing a query result according to an embodiment of the present invention determines a target query table from a plurality of query tables corresponding to the first query request, wherein the target query table is the target query table of the plurality of query tables. a fact table of at least one query table, and a fact table of the target query table does not exist in the plurality of query tables, and determining a number for storing the query result according to the target query table The primary key of a table can avoid the problem that the query efficiency is low when the related query of the first table is subsequently performed due to the column having no practical meaning as the primary key of the first table in the prior art, thereby improving the efficiency of the associated query.

FIG. 7 schematically illustrates a computing device 400 in accordance with an embodiment of the present invention. As shown in FIG. 7, the computing device 400 includes a processor 402, a memory 404, and a bus 410. The processor 402 and the memory 404 implement a communication connection with each other through the bus 410.

The processor 402 can be a general-purpose central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), or one or more integrated circuits for executing related programs. The technical solution provided by the embodiment of the present invention is implemented.

The memory 404 may be a read only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). Memory 404 can store operating systems and other applications. When the technical solution provided by the embodiment of the present invention is implemented by software or firmware, the program code for implementing the technical solution provided by the embodiment of the present invention is stored in the memory 404 and executed by the processor 402.

In particular, the memory 404 can be used to store executable instructions, as well as to store various information, such as query results. The processor 402 can read the information stored by the memory 404 via the bus system 410 or store the query results to the memory 404. Moreover, when the computing device 400 is running, the processor 402 can execute executable instructions stored by the memory 404 to determine a plurality of lookup tables corresponding to the first query request, wherein the first query request is for requesting the plurality of lookup tables The query table performs an association query; the target query table is determined from the plurality of query tables, wherein the fact table of the target query table does not exist in the plurality of query tables, and the target query table is the plurality of query tables a fact table of at least one query table other than the target query table; determining, according to the target query table, a primary key of the first table, wherein the first table is configured to store a query result corresponding to the first query request; The primary key of the table stores the query result to the first table.

Optionally, as shown in FIG. 7, the computing device can also include an input/output interface 406 and a communication interface 408. The input/output interface 406 is for receiving input data and information, and outputting data such as operation results.

Communication interface 408 enables communication between computing device 400 and other devices or communication networks using transceivers such as, but not limited to, transceivers.

Bus 410 may include a path for communicating information between various components of computing device 400, such as processor 402, memory 404, input/output interface 406, and communication interface 408.

The hardware structure shown in FIG. 7 and the foregoing description are applicable to performing various methods for storing query results provided by the embodiments of the present invention. For example, the various method flows shown in FIG. 1 to FIG. 4 are omitted for brevity. .

It should be noted that although the computing device 400 illustrated in FIG. 7 only shows the processor 402, the memory 404, the input/output interface 406, the communication interface 408, and the bus 410, those skilled in the art will appreciate in a particular implementation. The computing device 400 also includes other devices necessary to achieve proper operation. Also, those skilled in the art will appreciate that computing device 400 may also include hardware devices that implement other additional functions, depending on the particular needs. Moreover, those skilled in the art will appreciate that computing device 400 may also only include the components necessary to implement embodiments of the present invention, and does not necessarily include all of the devices shown in FIG.

It should be understood that in the embodiments of the present invention, the term and/or merely an association relationship describing the associated object indicates that there may be three relationships. For example, A and/or B may indicate that A exists separately, and A and B exist simultaneously, and B cases exist alone. In addition, the character / in this paper generally indicates that the contextual object is an OR relationship.

Those skilled in the art will appreciate that the various method steps and elements described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both, in order to clearly illustrate hardware and software. Interchangeability, the steps and composition of the various embodiments have been generally described in terms of function in the foregoing description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. Different methods may be used to implement the described functionality for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

A person skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, or an electrical, mechanical or other form of connection.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present invention.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention contributes in essence or to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium. A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .

The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any equivalent person can be easily conceived within the technical scope of the present invention by any person skilled in the art. Modifications or substitutions are intended to be included within the scope of the invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

A method for storing query results, comprising:

Determining, by the first query request, a plurality of query tables, where the first query request is used to request an association query on the plurality of query tables;

Determining, from the plurality of query tables, a target query table, wherein the fact table of the target query table does not exist in the plurality of query tables, and the target query table is the plurality of query tables except a fact table of at least one lookup table other than the target lookup table;

Determining, according to the target query table, a primary key of the first table, where the first table is configured to store a query result corresponding to the first query request;

The query result is stored to the first table according to the primary key of the first table.
The method according to claim 1, wherein the storing the query result to the first table according to the primary key of the first table comprises:

The query result is stored in the first table in a column cluster manner according to the primary key of the first table.
The method according to claim 1 or 2, wherein the determining the target query table from the plurality of lookup tables comprises:

Determining at least one first associated query condition corresponding to the first query request, where the first associated query condition is formed by a first column in the first query table and a second column in the second query table, The plurality of lookup tables include the first lookup table and the second lookup table different from the first lookup table;

Determining an association relationship between the first query table and the second query table corresponding to the at least one associated query condition;

Determining the target query table from the first query table and the second query table according to an association relationship between the first query table and the second query table.
The method according to claim 3, wherein the determining the association relationship between the first query table and the second query table corresponding to the at least one associated query condition comprises:

Determining whether the first column in the first query table is a primary key of the first query table;

If the first column in the first query table is the primary key of the first query table, determining that the second query table is a fact table of the first query table;

Determining the first if the first column in the first lookup table is a foreign key of the first lookup table The lookup table is a fact table of the second lookup table.
The method according to claim 4, wherein the first query request corresponds to a first associated query condition;

Determining, according to the association relationship between the first query table and the second query table, the target query table from the first query table and the second query table, including:

If the second lookup table is a fact table of the first lookup table, determining that the second query table is the target lookup table;

And if the first query table is a fact table of the second query table, determining that the first query table is the target query table.
The method according to claim 3 or 4, wherein the first query request corresponds to a plurality of first associated query conditions;

Determining, according to the association relationship between the first query table and the second query table, the target query table from the first query table and the second query table, including:

Establishing an association relationship tree according to the association relationship between the first query table and the second query table, where the second query table is a fact table of the first query table, the second query The table is the parent node of the first query table;

The root node of the association tree is determined as the target lookup table.
The method according to any one of claims 1 to 6, wherein the determining the primary key of the first table according to the target query table comprises:

Determining whether a non-union primary key of the target query table exists in a plurality of columns corresponding to the query result;

If the non-union primary key of the target query table exists in the plurality of columns, determining the non-union primary key of the target query table as the primary key of the first table.
The method according to claim 7, wherein the determining the primary key of the first table according to the target query table further comprises:

Determining, according to the non-joined primary key of the target query table, the second query request corresponding to the first query request, where the second query request is used to request the first table and The second table performs an associated query;

Determining a primary key of the first table according to the second query request.
The method according to claim 8, wherein the determining the primary key of the first table according to the second query request comprises:

Determining at least one second associated query condition corresponding to the second query request, wherein the second associated query condition is composed of a third column of the first table and a fourth column of the second table;

Determining, from the at least one second associated query condition, a second target association query condition, where the second target association query condition includes a primary key of the second table;

The third column of the first table included in the second target association query condition is determined as the primary key of the first table.
An apparatus for storing a query result, comprising:

a first determining unit, configured to determine a plurality of query tables corresponding to the first query request, where the first query request is used to request an associated query for the multiple query tables;

a second determining unit, configured to determine a target query table from the plurality of query tables determined by the first determining unit, wherein a fact table of the target query table does not exist in the plurality of query tables, and The target query table is a fact table of at least one query table of the plurality of query tables except the target query table;

a third determining unit, configured to determine a primary key of the first table according to the target query table determined by the second determining unit, where the first table is configured to store a query result corresponding to the first query request;

a storage unit, configured to store the query result to the first table according to the primary key of the first table determined by the third determining unit.
The device according to claim 10, wherein the storage unit is specifically configured to:

And storing, according to the primary key of the first table determined by the third determining unit, the query result to the first table in a column cluster manner.
The apparatus according to claim 10 or 11, wherein the second determining unit comprises:

a first determining sub-unit, configured to determine at least one first associated query condition corresponding to the first query request, where the first associated query condition is included in a first column and a second query table in the first query table The second column is configured, the plurality of lookup tables including the first lookup table and the second lookup table different from the first lookup table;

a second determining subunit, configured to determine an association relationship between the first query table and the second query table corresponding to the at least one associated query condition determined by the first determining subunit;

a third determining subunit, configured to determine the first query table according to the second determining subunit And the association relationship with the second query table, determining the target query table from the first query table and the second query table.
The apparatus according to claim 12, wherein the second determining subunit is specifically configured to:

Determining whether the first column in the first query table is a primary key of the first query table;

If the first column in the first query table is the primary key of the first query table, determining that the second query table is a fact table of the first query table;

If the first column in the first query table is a foreign key of the first query table, determining that the first query table is a fact table of the second query table.
The apparatus according to claim 13, wherein the first query request corresponds to a first associated query condition;

The third determining subunit is specifically configured to:

If the second determining subunit determines that the second query table is a fact table of the first query table, determining that the second query table is the target query table;

And if the second determining subunit determines that the first query table is a fact table of the second query table, determining that the first query table is the target query table.
The apparatus according to claim 12 or 13, wherein the first query request corresponds to a plurality of first associated query conditions;

The third determining subunit is specifically configured to:

Establishing an association relationship tree according to the association relationship between the first query table and the second query table determined by the second determining subunit, where the second query table is the first query table a fact table, the second query table is a parent node of the first query table;

The root node of the association tree is determined as the target lookup table.
The apparatus according to any one of claims 10 to 15, wherein the third determining unit comprises:

a fourth determining subunit, configured to determine whether a non-joined primary key of the target query table exists in multiple columns corresponding to the query result;

a fifth determining subunit, configured to determine, as the first determining subunit, a non-union primary key of the target query table in the plurality of columns, determining a non-union primary key of the target query table as the first The primary key of the table.
The apparatus according to claim 16, wherein said third determining unit further include:

a sixth determining subunit, configured to: if the fourth determining subunit determines that the non-joined primary key of the target query table does not exist in the plurality of columns, determine a second query request corresponding to the first query request, The second query request is used to request an association query for the first table and the second table;

a seventh determining subunit, configured to determine a primary key of the first table according to the second query request determined by the sixth determining subunit.
The apparatus according to claim 17, wherein the seventh determining subunit is specifically configured to:

Determining at least one second associated query condition corresponding to the second query request, wherein the second associated query condition is composed of a third column of the first table and a fourth column of the second table;

Determining, from the at least one second associated query condition, a second target association query condition, where the second target association query condition includes a primary key of the second table;

The third column of the first table included in the second target association query condition is determined as the primary key of the first table.
A computing device, comprising: a processor, a memory, and a bus;

The memory is configured to store computer execution instructions, the processor is coupled to the memory via the bus, and when the computing device is in operation, the processor reads the computer execution instructions stored in the memory to The method of any one of claims 1 to 9.