CN116401267A

CN116401267A - Method, device and equipment for generating structured query language database statement

Info

Publication number: CN116401267A
Application number: CN202310303219.8A
Authority: CN
Inventors: 许佳慧; 廖东阳; 林文奇
Original assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Current assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Priority date: 2023-03-23
Filing date: 2023-03-23
Publication date: 2023-07-07

Abstract

The application provides a method, a device and equipment for generating structured query language database sentences, and belongs to the technical field of computers and big data. Comprising the following steps: responding to a user dragging a new table node from a table node selection area to a node display area, and acquiring a graph range of the new table node and a graph range of an existing table node; if the graph range of the new table node is overlapped with the graph range of the existing table node, displaying at least one relation table node option at a preset position beside the existing table node; responding to the response range of a user dragging the new table node to any relation table node option and releasing the new table node, and generating a table node corresponding to any relation table node option between the new table node and the existing table node; and adding the fields corresponding to the node types to the contents of the table nodes according to the node types of the table nodes, and splicing the fields in sequence to obtain the structured query language database statement. The method solves the problem of low efficiency in writing SQL sentences.

Description

Method, device and equipment for generating structured query language database statement

Technical Field

The present invention relates to the field of computer and big data technologies, and in particular, to a method, an apparatus, and a device for generating a structured query language database statement.

Background

In the financial industry, business personnel usually need to use data to make decisions, but the data in a database cannot be directly used for data analysis, and the data can be used only by processing.

Presently, SQL (Structured Query Language, structured query language database) statements are commonly used in the art to process data in a database.

However, the inventors found that at least the following technical problems exist in the prior art: the business personnel have low efficiency in writing SQL statements.

Disclosure of Invention

The application provides a method, a device and equipment for generating structured query language database sentences, which are used for solving the problem that the efficiency of writing SQL sentences by service personnel is low.

In a first aspect, the present application provides a method for generating a structured query language database statement, including: responding to a user dragging a new table node from a table node selection area to a node display area, and acquiring a graph range of the new table node and a graph range of an existing table node, wherein the existing table node is an existing table node in the node display area when the new table node is dragged; if the graph range of the new table node is overlapped with the graph range of the existing table node, displaying at least one relation table node option at a preset position beside the existing table node; responding to the response range that a user drags a new table node to any relation table node option, releasing the new table node, and generating a table node corresponding to any relation table node option between the new table node and the existing table node; and adding the fields corresponding to the node types to the contents of the table nodes according to the node types of the table nodes, and splicing the fields in sequence to obtain the SQL statement of the structured query language database.

In one possible implementation, in response to a user dragging a new table node to a response range of any relationship table node option and releasing the new table node, generating a table node corresponding to any relationship table node option between the new table node and an existing table node, including: acquiring a real-time position of a mouse pointer; if the dragging signal of the mouse finger for the new table node is continuously received until the real-time position enters the response range of any relation table node option, generating a table node corresponding to any relation table node option between the new table node and the existing table node.

In one possible implementation, in response to a user dragging a new table node to a response range of any relationship table node option and releasing the new table node, generating a table node corresponding to any relationship table node option between the new table node and an existing table node, including: continuously acquiring the overlapping judgment range of the new table node; and generating an intersection set in response to the overlapping judging range and the response range of any relation table node option, and receiving a release signal of a mouse to generate a table node corresponding to any relation table node option between the new table node and the existing table node.

In one possible implementation, before acquiring the graph scope of the new table node and the graph scope of the existing table node in response to the user dragging the new table node from the table node selection area, the method further includes: and responding to the dragging of any type of table node from the table node selection area to the node display area by a user, and obtaining the existing table node.

In one possible implementation, the last table node in the pipeline of table nodes includes a table node add button; accordingly, after obtaining the existing table node in response to the user dragging any type of table node from the table node selection area to the node display area, further comprising: responding to the trigger operation of a user on the table node adding button, and acquiring the target node type of the last table node; displaying candidate node types according to the target node types; and in response to the triggering of the user on any node type in the candidate node types, adding the table node of any node type after the last table node.

In one possible implementation, displaying candidate node types according to the target node type includes: searching the corresponding relation between the node type and the candidate node type according to the target node type to obtain each candidate node type corresponding to the target node type; and displaying each candidate node type in the extending direction of the pipeline in the last table section.

In one possible implementation manner, after generating the table node corresponding to any relation table node option, the method further includes: responding to the triggering operation of a user to any table node, and reading the operation result from the first table node to any table node in a pipeline formed by all table nodes and the input data of any table node; and displaying the operation result and the input data in a result display area.

In one possible implementation, after dragging any type of table node from the table node selection area to the node display area in response to the user, obtaining an existing table node, the method further includes: responding to the received edit instruction corresponding to any table node input by a user, and displaying a configuration parameter input window of any table node; and receiving configuration data input by a user in a configuration parameter input window, and writing the configuration data into any table node.

In a second aspect, the present application provides a structured query language database statement generation apparatus, including: and the graph range acquisition module is used for responding to the dragging of a new table node from the table node selection area to the node display area by a user and acquiring the graph range of the new table node and the graph range of an existing table node, wherein the existing table node is the existing table node in the node display area when the new table node is dragged. And the option display module is used for displaying at least one relation table node option at a preset position beside the existing table node if the graph range of the new table node is overlapped with the graph range of the existing table node. And the table node generating module is used for responding to the response range that the user drags the new table node to any relation table node option, releasing the new table node and generating the table node corresponding to any relation table node option between the new table node and the existing table node. The statement obtaining module is used for adding the content of each table node into the fields corresponding to the node types according to the node types of each table node and splicing the fields in sequence to obtain the SQL statement of the structured query language database.

In a third aspect, the present application provides an electronic device, comprising: a processor, and a memory communicatively coupled to the processor. The memory stores computer-executable instructions. The processor executes the computer-executable instructions stored in the memory to cause the processor to perform the structured query language database statement generation method as described in the first aspect.

In a fourth aspect, the present application provides a computer-readable storage medium having stored therein computer-executable instructions which, when executed by a processor, are adapted to carry out a structured query language database statement generation method as described in the first aspect.

In a fifth aspect, the present application provides a computer program product comprising a computer program which, when executed by a processor, implements a structured query language database statement generation method as described in the first aspect.

According to the method, the device and the equipment for generating the structured query language database statement, when a user drags a new table node from a table node selection area, the graph range of the new table node and the graph range of the existing table node are obtained, the relational table node options are displayed beside the existing table node under the condition that the graph ranges are overlapped, the corresponding table node is generated between the new table node and the existing table node under the condition that the user drags the new table node to the response range of the relational table node option and releases the response range, and according to the node type of each table node, the content of each table node is added with the corresponding field of the node type and spliced in sequence to obtain the SQL statement, so that the steps of generating the table node are reduced, the writing speed of the SQL statement is increased, and the effect of data processing speed is improved.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.

FIG. 1 is a schematic diagram of an application scenario of a method for generating a structured query language database statement according to an embodiment of the present application;

FIG. 2 is a schematic diagram of an SQL statement generation interface according to an embodiment of the present disclosure;

FIG. 3 is a flowchart illustrating a method for generating a structured query language database statement according to an embodiment of the present application;

FIG. 4 is a second schematic diagram of an SQL statement generation interface according to an embodiment of the present disclosure;

FIG. 5 is a third schematic diagram of an SQL statement generation interface according to an embodiment of the present disclosure;

fig. 6 is a schematic diagram of a candidate node type display manner according to an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a device for generating a structured query language database statement according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Specific embodiments thereof have been shown by way of example in the drawings and will herein be described in more detail. These drawings and the written description are not intended to limit the scope of the inventive concepts in any way, but to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments.

Detailed Description

Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present application as detailed in the accompanying claims.

Data is very important in the financial industry, and business personnel in the financial industry need to make accurate judgment through analysis and calculation of the data. However, the data volume is huge, and corresponding tools are needed for analyzing the data. The data in the data is processed by adopting SQL sentences.

However, if the SQL statement is adopted to process the data, the business personnel are required to be familiar with the writing rules of the SQL statement, the SQL statement writing capability is high, and generally, the business personnel do not have the corresponding capability, so that the problems of low speed and low efficiency of writing the SQL statement are caused.

In order to solve the technical problems, the inventor proposes the following technical ideas: and adding additional functions to the table nodes in the pipeline formed by the table nodes in a visual programming mode, and adding new table nodes through the additional functions.

The method and the device are applied to scenes generated for SQL sentences. In the technical scheme of the application, the related information such as financial data or user data is collected, stored, used, processed, transmitted, provided, disclosed and the like, which accords with the regulations of related laws and regulations and does not violate the popular regulations of the public order.

Fig. 1 is an application scenario schematic diagram of a method for generating a structured query language database statement according to an embodiment of the present application. As in fig. 1, in this scenario, it includes: a terminal device 101.

In a specific implementation process, the terminal device 101 may be a computer, a tablet computer, a notebook computer, etc., and is configured to receive a control signal of a user, generate table nodes according to the control signal, and generate SQL statements according to a single or multiple table nodes.

With continued reference to FIG. 1. As shown in fig. 1, the scenario may further include a server 102, where the server 102 may be a single server or a cluster formed by a plurality of servers. The terminal device 101 may also receive a control signal of a user, send a corresponding signal to the server 102 according to the control signal, generate a corresponding table node by the server, generate an SQL statement according to a single or multiple table nodes, and send the obtained information of the table node and the SQL statement to the terminal device 101 by the server 102.

It will be appreciated that the structure illustrated in the embodiments of the present application does not constitute a specific limitation on the method of generating the structured query language database statement. In other possible embodiments of the present application, the architecture may include more or fewer components than those illustrated, or some components may be combined, some components may be separated, or different component arrangements may be specifically determined according to the actual application scenario, and the present application is not limited herein. The components shown in fig. 1 may be implemented in hardware, software, or a combination of software and hardware.

The following describes the technical solutions of the present application and how the technical solutions of the present application solve the above technical problems in detail with specific embodiments. The following embodiments may be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.

Fig. 2 is a schematic diagram of an SQL statement generation interface provided in an embodiment of the present application. As shown in FIG. 2, the SQL statement generation interface includes a table node selection area, a node display area, and may also include a result display area. The user may select a table node from the table node selection area and drag to the node display area, causing the node display area to increment the table node. As shown in FIG. 2, the user drags table node 1 to the node display area, which increases table node 1. Table nodes 1 through n represent various types of table nodes in the embodiments of the present application, and are not specific table node types. The "+ symbols in the added table nodes will be described in the subsequent embodiments.

Fig. 3 is a flowchart of a method for generating a structured query language database statement according to an embodiment of the present application. The execution subject of the embodiment of the present application may be the terminal device 101 in fig. 1 or a system composed of the terminal device 101 and the server 102, which is not particularly limited in this embodiment. As shown in fig. 2, the method includes:

s301: in response to a user dragging a new table node from a table node selection area to a node display area, a graphical range of the new table node and a graphical range of an existing table node, wherein the existing table node is an existing table node in the node display area when the new table node is dragged, are obtained.

In this step, the table node selection area provides a plurality of different table nodes from which a user can select any type of table node to drag to the node display area. After table node 1 has been dragged to the node display area in fig. 2, if another table node is dragged, table node 1 is already an existing table node. The graph range of table node 1 may be a box range of table node 1.

Other table nodes may be dragged by the user, which is not particularly limited in the embodiment of the present application. The graph range may be confirmed by a diagonal point, or an area surrounded by four sides displayed by the table node may be determined as the graph range.

For example, in response to a user dragging table node 4 from a table node selection area to a node display area, a graphical range of table node 4 and a graphical range of existing table node 2 are acquired. For another example, in response to a user dragging a table node 5 from a table node selection area to a node display area, a graphical range of the table node 5 and a graphical range of an existing table node 3 are acquired. Also for example, in response to a user dragging table node 3 from the table node selection area to the node display area, the graphical range of table node 3 and the graphical range of existing table node 5 are acquired.

S302: and if the graph range of the new table node is overlapped with the graph range of the existing table node, displaying at least one relation table node option at a preset position beside the existing table node.

In this step, any pixel in the graph range of the new table node enters the graph range of the existing table node, and at least one relation table node option is displayed at a preset position beside the existing table node.

The preset position may be a neighboring position of the existing table node, such as an upper position, a lower position, a left position, or a right position. The relationship table node option may be "merge" or "associate" and the like, and may have other names.

Fig. 4 is a second schematic diagram of an SQL statement generation interface according to an embodiment of the present application. As shown in fig. 4, there are currently table nodes 1 and 3 in the node display area, the table nodes 1 and 3 are connected by the association table node, the new table node is table node 4, and in the case that the graphic range of table node 4 overlaps with the graphic range of table node 3, two relationship table node options "merge" and "associate" are displayed above table node 3. The manner of generating the association table node between node 1 and table node 3 may be described as follows in step S303.

S303: and responding to the response range that the user drags the new table node to any relation table node option, releasing the new table node, and generating the table node corresponding to any relation table node option between the new table node and the existing table node.

In this step, the new table node is dragged to the response range of any relation table node option, which may be that the graph range of the new table node covers the graph range of the relation table node exceeding the preset proportion. The preset ratio is, for example, 20%, 30%, 50%, etc. Releasing the new table node may be from continuously receiving a user drag signal to the new table node to not receiving the drag signal.

Fig. 5 is a third schematic diagram of an SQL statement generation interface provided in an embodiment of the present application. As shown in fig. 5, after the user drags table node 4 to the response range of the "merge" relationship table node option corresponding to table node 3 and releases the new table node, a merge table node is generated between table node 3 and table node 4. Similarly, the association table node between the table node 1 and the table node 3 may be generated between the table node 3 and the table node 1 after the user drags the table node 3 to the response range of the "association" relationship table node option corresponding to the table node 1 and releases the new table node.

S304: and adding the fields corresponding to the node types to the contents of the table nodes according to the node types of the table nodes, and splicing the fields in sequence to obtain the SQL statement of the structured query language database.

In this step, the node type of each table node and the content of each table node may be obtained first, then the field corresponding to the node type is searched, and the content of the table node and the field are spliced to obtain the SQL statement.

The manner of splicing the contents and fields of the table node may correspond to the type of the table node. For example, add "where" before a field sets a table node, "where" or "home" before a screening table node, and "order by" before a field ordering node.

The generated SQL statement is, for example, generated by chaining standard SQL statements in the following order according to the input information of the nodes in the node display area: the content of the Select + "field setting table node", the content of the From + "merging table node/association table node", the content of the where + "field screening table node", the content of the Group by + "packet aggregation table node", the content of the high + "field screening table node", the content of the Order by + "field sorting table node", and the content of the Limit + "data interception table node". The "Select", "From", "Group" and the like may be fields added according to the node type, and the contents of each table node include contents inherent to each table node, and may also include contents input by a user.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, when a user drags a new table node from a table node selection area, a graph range of the new table node and a graph range of an existing table node are obtained, when the graph ranges overlap, a relational table node option is displayed beside the existing table node, when the user drags the new table node to a response range of the relational table node option and releases the response range, a corresponding table node is generated between the new table node and the existing table node, and according to a node type of each table node, the contents of each table node are added with a field corresponding to the node type and spliced in sequence, so as to obtain an SQL statement, thereby realizing the steps of reducing the generation of the table node, increasing the writing speed of the SQL statement, and improving the data processing speed.

In a possible implementation manner, in the step S303, in response to the user dragging the new table node to the response range of any relation table node option, and releasing the new table node, generating a table node corresponding to any relation table node option between the new table node and the existing table node, including:

s303A1: the real-time position of the mouse pointer is acquired.

In this step, a preset program or script may be used to obtain the real-time position of the mouse pointer. The real-time position may be a position coordinate with respect to the display interface, or a position coordinate with respect to a predetermined point in the generation interface.

S303A2: if the dragging signal of the mouse finger for the new table node is continuously received until the real-time position enters the response range of any relation table node option, generating a table node corresponding to any relation table node option between the new table node and the existing table node.

In this step, the real-time position enters the response range of any relational table node option, and the coordinates of the real-time position may enter from outside the response range and stay in the response range, or may be in the case that the coordinates of the real-time position are in the response range.

The response range may be a graphical range of the relational table node option, or may be a selected area in the graphical range of the relational table node option.

For example, when the table node 3 in fig. 5 is dragged, the position of the mouse pointer enters the display area of the "merge" relationship table node option, and when a signal for releasing the mouse is received, the merge table node is generated. Other table nodes are similar to the present embodiment and are not described herein.

As can be seen from the description of the foregoing embodiment, in the embodiment of the present application, by acquiring the real-time position of the mouse pointer, after the real-time position of the mouse pointer enters the response range of the relational table node option and releases the dragged table node, the table node corresponding to the relational table node is generated, so that whether the new table node enters the response range of the relational table node option is determined by the mouse position, and thus, the corresponding table node is generated when the new table node enters the response range of the relational table node option, thereby increasing the speed of adding the table node and improving the speed of generating the SQL statement.

S303B1: the overlapping decision range of the new table node is continuously acquired.

In this step, the overlap determination range of the new table node may be the graph range of the new table node or may be a fixed area in the graph range of the new table node. Since the new table node is being dragged, the overlap determination range of the new table node may be changed.

S303B2: and generating an intersection set in response to the overlapping judging range and the response range of any relation table node option, and receiving a release signal of a mouse to generate a table node corresponding to any relation table node option between the new table node and the existing table node.

In this step, the overlap determination range and the response range of any relation table node option may intersect, and any pixel in the overlap determination range may enter the response range, or any pixel in the response range may enter the overlap determination range. The release signal of the mouse may be that the continuous drag signal disappears. The manner of generating the corresponding table node is described in the above step S303, and will not be described in detail here.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, by continuously obtaining the overlapping determination range of a new table node, and generating a table node corresponding to a table node option under the condition that the overlapping determination range and the response range of the table node option generate an intersection and a release signal of a mouse is received, the effect of increasing the speed of adding the table node and increasing the speed of generating an SQL statement is achieved.

In one possible implementation manner, before the step S301 of obtaining the graph range of the new table node and the graph range of the existing table node in response to the user dragging the new table node from the table node selection area, the method further includes:

s310: and responding to the dragging of any type of table node from the table node selection area to the node display area by a user, and obtaining the existing table node.

This step is similar to what is shown in fig. 2, in that any type of table node can be dragged by the table node selection area to the node display area, and after a new table node is dragged, an existing table node in the node display area is determined as an existing table node.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, by providing a table node capable of being dragged in a table node selection area, by responding to a user dragging any type of table node from the table node selection area to a node display area, an existing table node is obtained, and increasing table nodes in the case that no table node exists in the node display area is implemented, and since multiple types of table nodes are provided in the table node selection area, the time for the user to generate the table node can be reduced, thereby accelerating the generation speed of SQL statements.

In one possible implementation, the last table node in the pipeline of table nodes includes a table node add button.

The pipeline may be named as a pipeline, and may be a processing flow formed by all table nodes, for example, a pipeline formed by table node 1, associated table node, table node 3, merged table node and table node 4 in fig. 5. The table node adding button may be "" in fig. 2, 4, 5, and other shapes, such as square, triangle, etc., which are not particularly limited in the embodiments of the present application.

Accordingly, after step S310 is performed to obtain the existing table node in response to the user dragging any type of table node from the table node selection area to the node display area, the method further includes:

s311: and responding to the trigger operation of the user on the table node adding button, and acquiring the target node type of the last table node.

In this step, the target node type may be the node type of the last table node. The trigger operation of the table node adding button may be a click or a long press of the table node adding button. The last table node can be the last added table node, or the last table node according to the connection relation and the data transmission trend of each table node. The node type obtaining manner may be to read a type identifier in the table node, take the node type corresponding to the type identifier as the node type of the last table node, or take the table node type dragged from the table node selection area as the node type of the corresponding table node.

For example, in response to a user triggering a table node add button for table node 1 in FIG. 2, the node type is obtained. For another example, the node type of table node 4 is obtained in response to a user triggering a table node add button of table node 4 in FIG. 5.

S312: and displaying the candidate node types according to the target node types.

In this step, the target node type may search for a corresponding candidate node type, and display the candidate node type in the node display area.

Fig. 6 is a schematic diagram of a candidate node type display manner according to an embodiment of the present application. As shown in fig. 6, after a user triggers a table node add button of a field screening table node, candidate node types displayed next to the field screening table node include: the node type of the field screening table node is the target node type, and the target node type is the field screening or field screening table node.

S313: and in response to the triggering of the user on any node type in the candidate node types, adding the table node of any node type after the last table node.

In this step, the trigger for any node type may be clicking, long pressing, or dragging, etc. for any node type.

For example, in fig. 6, if the user clicks on the field ordering candidate node type, the field ordering table node is added after the field filtering table node, and if the user triggers the data interception field ordering candidate node type, the data interception table node is added after the field filtering table node. Other cases of triggering candidate node types are similar and will not be described in detail herein.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, a last table node in a pipeline formed by table nodes includes a table node add button, and a node type of the last table node is acquired in response to a trigger of the table node add button by a user, a corresponding candidate node type is displayed by the node type, and after any node type in the candidate node types is triggered by the user, a table node of the node type is added after the last table node.

In one possible implementation, after dragging a new table node, obtaining a node type of the new table node, and displaying candidate node types after the new table node according to the node type, wherein new table nodes of different types correspond to different candidate node types.

In a possible implementation manner, in step S312, the candidate node types are displayed according to the target node type, which specifically includes:

S3121: and searching the corresponding relation between the node type and the candidate node type according to the target node type to obtain each candidate node type corresponding to the target node type.

In this step, the correspondence between the node type and the candidate node type may be stored using a table or a dictionary.

The correspondence between the node type and the candidate node type may be as shown in table 1. The detailed description column in table 1 also shows the specific roles of the various types of tables. In a specific implementation process, the correspondence between the node type and the candidate node type may not include a detailed description column.

TABLE 1 correspondence of node types to candidate node types

S3122: and displaying each candidate node type in the extending direction of the pipeline in the last table section.

In this step, the extending direction along the pipeline may be the data transfer direction, similar to the step S311 described above, and will not be described here again.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, by searching the correspondence between the node types and the candidate node types, each candidate node type corresponding to the target node type is obtained, and each corresponding candidate node type is displayed and output, after a user triggers any node type in the candidate node types, a table node of the node type is added after the last table node, so that alternative table nodes are provided, the time for the user to select an appropriate table node is reduced, and thus the speed for generating an SQL statement is improved.

In a possible implementation manner, after generating the table node corresponding to any of the relational table node options in step S303, the method further includes:

s314: and responding to the triggering operation of a user on any table node, and reading the operation result from the first table node to any table node in the pipeline formed by all table nodes and the input data of any table node.

In this step, the triggering operation on any table node may be clicking, long pressing, or the like. The running result of the first table node to any table node in the pipeline may include: and the running result of each table node from the first table node to any table node with punishment. Or, the operation result of any one of the triggered table nodes is obtained through the processing from the first table node to any one of the triggered table nodes. The input data of any table node may be the read output result of the last node of any table node. The running result and the reading mode of the input data can be read by adopting a preset script or program.

S315: and displaying the operation result and the input data in a result display area.

In this step, the operation result and the input data may be displayed in a region of the result display area, or may be displayed in a scrollable manner in the result display area.

As can be seen from the description of the above embodiments, in the embodiments of the present application, by responding to the trigger of a user on any table node, the operation result of the first table node in the pipeline formed by each table node to any table node and the input data of any table node are read, and the operation result and the input data are displayed in the result display area, so that the user can conveniently determine whether the pipeline formed by each table node meets the expected effect of the user, and conveniently query the input and output of each table node, thereby adjusting the table node, and further obtaining the SQL statement meeting the requirement, and increasing the generation speed of the SQL statement.

In a possible implementation manner, after the step S310, the method further includes changing the name state of the table node that is double-clicked to an editable state in response to a double-click operation of any table node by the user. And receiving the table node name input by the user, and taking the table node name as the name of the table node which is double-clicked. If the relation table node is double-clicked, a configuration parameter input window of the relation table node can be displayed so as to receive configuration parameters input by a user and re-edit input information. The renaming of the table nodes and the reconfiguration of the parameters are realized, so that the user can conveniently identify the contents of each table node and adjust the output effect of the pipeline.

Where a relationship table node is, for example, a merge table node or an association table node.

In a possible implementation manner, after the step S310, a configuration parameter input window for displaying the dragged table node is further included, so that the user can edit the new table node after dragging the new table node to the node display area.

In a possible implementation manner, after step S310 is performed to obtain an existing table node in response to the user dragging any type of table node from the table node selection area to the node display area, the method further includes:

s316: and responding to the received editing instruction corresponding to any table node input by a user, and displaying a configuration parameter input window of any table node.

In this step, the edit command may be to click an edit button after selecting any table node, or may be to double click or long press. The content in the configuration parameter input window or the content that can be input corresponds to the type of the table node.

S317: and receiving configuration data input by a user in a configuration parameter input window, and writing the configuration data into any table node.

In this step, the user may click on any text box in the configuration parameter input window, input data is received, and the input data is written into the table node content corresponding to the text box. Or receiving the click of the user on the option in the configuration parameter input window to obtain corresponding configuration data, and writing the configuration data into the table node content corresponding to the option.

Such as field screening table nodes, field ordering table nodes, data interception table nodes, packet aggregation table nodes, etc. See table 2 for a more detailed description of table nodes and what the user may enter.

Table 2 table nodes and corresponding input schematic tables.

As can be seen from the description of the foregoing embodiments, in the embodiments of the present application, after receiving an edit instruction of a table node input by a user, a configuration parameter input window of the table node is displayed, configuration data input by the user in the configuration parameter input window is received, and the configuration data is written into the edited table node, so that writing or rewriting of contents of the table node is realized, and a user can change the contents of the table node according to own needs.

Of all the nodes, the association table node and the merging table node can appear multiple times, the screening table node can appear twice, the window operation can be performed once before the grouping aggregation node, the moving operation can be performed once after the grouping aggregation node. In addition, other nodes may appear once in the SQL generation module.

In a possible implementation manner, after the step S304, the method further includes, in response to receiving a running instruction of the user, running an SQL statement to obtain a pipeline running result, and displaying the pipeline running result in a result display area. Where the pipeline running results may be field information and result data of the query and process. The user can conveniently know the overall operation condition of the pipeline, so as to determine whether to adjust the pipeline.

In one possible implementation manner, the table node selection area further includes table structures, fields, data types and description information of the fields corresponding to each table node type.

In one possible implementation manner, after a new table node is dragged from the table node selection area, physical table information under the data source can be obtained, and according to the physical table information under the data source, an SQL statement of single table query, for example, "select from table1", is obtained, and a user can query the SQL statement output by the SQL generation module at the front end interface. Obtaining a table structure of a single table query result, namely an original table structure of the table node, in a result display area; and executing the SQL sentence output by the node display area to obtain the result data of the single-table query.

Fig. 7 is a schematic structural diagram of a structured query language database statement generating device according to an embodiment of the present application. As shown in fig. 7, the structured query language database statement generation apparatus 700 includes: a graphics range acquisition module 701, an option display module 702, a table node generation module 703, and a sentence acquisition module 704.

The graphic range obtaining module 701 is configured to obtain, in response to a user dragging a new table node from the table node selection area to the node display area, a graphic range of the new table node and a graphic range of an existing table node, where the existing table node is an existing table node in the node display area when the new table node is dragged.

The option display module 702 is configured to display at least one relational table node option at a preset position beside an existing table node if the graphic range of the new table node overlaps with the graphic range of the existing table node.

The table node generating module 703 is configured to generate a table node corresponding to any one of the relationship table node options between the new table node and the existing table node in response to the user dragging the new table node to the response range of any one of the relationship table node options and releasing the new table node.

The statement obtaining module 704 is configured to add, according to the node types of the table nodes, the content of each table node to the fields corresponding to the node types, and splice the fields sequentially, so as to obtain the structured query language database SQL statement.

The device provided in this embodiment may be used to implement the technical solution of the foregoing method embodiment, and its implementation principle and technical effects are similar, and this embodiment will not be described herein again.

In one possible implementation, the table node generating module 703 is specifically configured to obtain a real-time position of the mouse pointer. If the dragging signal of the mouse finger for the new table node is continuously received until the real-time position enters the response range of any relation table node option, generating a table node corresponding to any relation table node option between the new table node and the existing table node.

In one possible implementation, the table node generating module 703 is specifically configured to continuously obtain the overlapping determination range of the new table node. And generating an intersection set in response to the overlapping judging range and the response range of any relation table node option, and receiving a release signal of a mouse to generate a table node corresponding to any relation table node option between the new table node and the existing table node.

In one possible implementation, the structured query language database statement generation device 700 further includes: the table node obtains module 705.

The table node obtaining module 705 is configured to obtain an existing table node in response to a user dragging any type of table node from the table node selection area to the node display area.

The structured query language database statement generation apparatus 700 further comprises: the table node adding module 706.

The table node adding module 706 is configured to obtain the target node type of the last table node in response to a trigger operation of the user to add a button to the table node. And displaying the candidate node types according to the target node types. And in response to the triggering of the user on any node type in the candidate node types, adding the table node of any node type after the last table node.

In one possible implementation, the table node adding module 706 is specifically configured to search, according to the target node type, a correspondence between the node type and the candidate node type, and obtain each candidate node type corresponding to the target node type. And displaying each candidate node type in the extending direction of the pipeline in the last table section.

In one possible implementation, the structured query language database statement generation device 700 further includes: the result display module 707.

And the result display module 707 is configured to read an operation result from the first table node to any table node in the pipeline formed by the table nodes and input data of any table node in response to a trigger operation of a user on any table node. And displaying the operation result and the input data in a result display area.

In one possible implementation, the structured query language database statement generation device 700 further includes: a data write module 708.

The data writing module 708 is configured to display a configuration parameter input window of any table node in response to receiving an edit instruction corresponding to any table node input by a user. And receiving configuration data input by a user in a configuration parameter input window, and writing the configuration data into any table node.

In order to achieve the above embodiments, the present application further provides an electronic device.

Referring to fig. 8, a schematic structural diagram of an electronic device 800 suitable for implementing embodiments of the present application is shown, where the electronic device 800 may be a terminal device or a server. The terminal device may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a personal digital assistant (Personal Digital Assistant, PDA for short), a tablet (Portable Android Device, PAD for short), a portable multimedia player (Portable Media Player, PMP for short), an in-vehicle terminal (e.g., an in-vehicle navigation terminal), and the like, and a fixed terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 8 is only an example and should not impose any limitation on the functionality and scope of use of the embodiments of the present application.

As shown in fig. 8, the electronic device 800 may include a processor (e.g., a central processing unit, a graphics processor, etc.) 801, and a Memory 802 communicatively connected to the processor, which may perform various appropriate actions and processes according to a program stored in the Memory 802, a computer-executed instruction, or a program loaded from a storage 808 into a random access Memory (Random Access Memory, abbreviated as RAM) 803, implementing the structured query language database statement generation method in any of the above embodiments, where the Memory may be a Read Only Memory (ROM). In the RAM803, various programs and data required for the operation of the electronic device 800 are also stored. The processing device 801, the memory 802, and the RAM803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.

In general, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 807 including, for example, a liquid crystal display (Liquid Crystal Display, LCD for short), a speaker, a vibrator, and the like; storage 808 including, for example, magnetic tape, hard disk, etc.; communication means 809. The communication means 809 may allow the electronic device 800 to communicate wirelessly or by wire with other devices to exchange data. While fig. 8 shows an electronic device 800 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.

In particular, according to embodiments of the present application, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via communication device 809, or from storage device 808, or from memory 802. When being executed by the processing device 801, performs the above-described functions defined in the methods of the embodiments of the present application.

It should be noted that the computer readable storage medium described in the present application may be a computer readable signal medium or a computer storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present application, however, a computer-readable signal medium may include a data signal that propagates in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable storage medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

The computer-readable storage medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.

The computer-readable storage medium carries one or more programs which, when executed by the electronic device, cause the electronic device to perform the methods shown in the above-described embodiments.

Computer program code for carrying out operations of the present application may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a local area network (Local Area Network, LAN for short) or a wide area network (Wide Area Network, WAN for short), or it may be connected to an external computer (e.g., connected via the internet using an internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules involved in the embodiments described in the present application may be implemented by software, or may be implemented by hardware. Where the names of the elements do not constitute a limitation on the module itself in some cases, for example, the options display module may also be described as a "relational table node options display module".

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

The present application further provides a computer readable storage medium, in which computer executing instructions are stored, when a processor executes the computer executing instructions, the technical scheme of the method for generating a structured query language database statement in any of the foregoing embodiments is implemented, and the implementation principle and the beneficial effects are similar to those of the method for generating a structured query language database statement, which can be referred to herein without redundant description.

In the context of this application, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the technical scheme of the method for generating a structured query language database statement in any of the foregoing embodiments is implemented, and the implementation principle and the beneficial effects are similar to those of the method for generating a structured query language database statement, and can be referred to the implementation principle and the beneficial effects of the method for generating a structured query language database statement, which are not described herein again.

The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this application is not limited to the specific combinations of features described above, but it is intended to cover other embodiments in which any combination of features described above or equivalents thereof is possible without departing from the spirit of the disclosure. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.

Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.

It is to be understood that the present application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims

1. A method for generating a structured query language database statement, comprising:

responding to a user dragging a new table node from a table node selection area to a node display area, and acquiring a graph range of the new table node and a graph range of an existing table node, wherein the existing table node is an existing table node in the node display area when the new table node is dragged;

if the graph range of the new table node is overlapped with the graph range of the existing table node, displaying at least one relation table node option at a preset position beside the existing table node;

responding to the response range that a user drags the new table node to any relation table node option, releasing the new table node, and generating a table node corresponding to any relation table node option between the new table node and the existing table node;

and adding the fields corresponding to the node types to the contents of the table nodes according to the node types of the table nodes, and splicing the fields in sequence to obtain the SQL statement of the structured query language database.

2. The method of claim 1, wherein generating a table node corresponding to any relationship table node option between the new table node and the existing table node in response to a user dragging the new table node to a response range of the any relationship table node option and releasing the new table node, comprises:

acquiring a real-time position of a mouse pointer;

if the drag signal of the mouse finger for the new table node is continuously received until the real-time position enters the response range of any relation table node option, generating a table node corresponding to any relation table node option between the new table node and the existing table node.

3. The method of claim 1, wherein generating a table node corresponding to any relationship table node option between the new table node and the existing table node in response to a user dragging the new table node to a response range of the any relationship table node option and releasing the new table node, comprises:

continuously acquiring the overlapping judgment range of the new table node;

and generating an intersection set according to the overlapping judging range and the response range of any relation table node option, receiving a release signal of a mouse, and generating a table node corresponding to any relation table node option between the new table node and the existing table node.

4. The method of claim 1, further comprising, prior to the obtaining the new table node graphical range and the existing table node graphical range in response to the user dragging a new table node from the table node selection area:

and responding to the fact that a user drags any type of table node from the table node selection area to the node display area, and obtaining the existing table node.

5. The method of claim 4, wherein a last table node in the pipeline of table nodes comprises a table node increment button;

accordingly, after the existing table node is obtained in response to the user dragging any type of table node from the table node selection area to the node display area, the method further comprises:

responding to the trigger operation of a user on the table node adding button, and acquiring the target node type of the last table node;

displaying candidate node types according to the target node types;

and responding to the trigger of a user on any node type in the candidate node types, and adding the table node of any node type after the last table node.

6. The method of claim 5, wherein displaying candidate node types according to the target node type comprises:

Searching the corresponding relation between the node type and the candidate node type according to the target node type to obtain each candidate node type corresponding to the target node type;

and displaying each candidate node type in the extending direction of the pipeline of the last table section.

7. The method of any one of claims 1 to 6, further comprising, after said generating a table node corresponding to said any one of the relational table node options:

responding to the triggering operation of a user to any table node, and reading the operation result from the first table node to any table node in a pipeline formed by all table nodes and the input data of any table node;

and displaying the operation result and the input data in a result display area.

8. The method of any of claims 4 to 6, further comprising, after said responding to a user dragging any type of table node from a table node selection area to a node display area to obtain said existing table node:

responding to receiving an edit instruction corresponding to any table node input by a user, and displaying a configuration parameter input window of any table node;

and receiving configuration data input by a user in the configuration parameter input window, and writing the configuration data into any table node.

9. A structured query language database statement generation apparatus, comprising:

a graph range obtaining module, configured to obtain a graph range of a new table node and a graph range of an existing table node in a node display area when a user drags the new table node from the table node selection area to the node display area, where the existing table node is an existing table node in the node display area when the new table node is dragged;

the option display module is used for displaying at least one relation table node option at a preset position beside the existing table node if the graph range of the new table node is overlapped with the graph range of the existing table node;

the table node generation module is used for responding to the response range that a user drags the new table node to any relation table node option, releasing the new table node and generating a table node corresponding to any relation table node option between the new table node and the existing table node;

the statement obtaining module is used for adding the content of each table node into the fields corresponding to the node types according to the node types of each table node and splicing the fields in sequence to obtain the SQL statement of the structured query language database.

10. An electronic device, comprising: a processor, and a memory communicatively coupled to the processor;

the memory stores computer-executable instructions;

the processor executing computer-executable instructions stored in the memory, causing the processor to perform the structured query language database statement generation method of any one of claims 1 to 8.

11. A computer readable storage medium having stored therein computer executable instructions which when executed by a processor are for implementing the structured query language database statement generation method of any one of claims 1 to 8.

12. A computer program product comprising a computer program which, when executed by a processor, implements the structured query language database statement generation method of any one of claims 1 to 8.