JP6737734B2 - Query sentence search device, query sentence search method, and query sentence search program - Google Patents

Description

The present invention relates to a query sentence search device, a query sentence search method, and a query sentence search program that search for a query sentence that can be executed in a database system.

2. Description of the Related Art Conventionally, a query statement such as SQL (Structured Query Language) that can be executed in a database system is searched for a query statement in which the content of the query matches or is similar to a specific query statement. As a method for retrieving a query text that matches or is similar to a specific query text, there is a method of treating the query text as a character string and measuring the similarity of the character string. A method using the Levenshtein distance has been conventionally proposed as a method for measuring the similarity between character strings (see, for example, Patent Document 1). The Levenshtein distance indicates the number of edits required to convert a character string into a character string to be compared, and if it is 0, it means that the character string and the character string to be compared match. Showing. Also, the smaller the value of the Levenshtein distance, the higher the similarity between the character string and the character string to be compared.

JP, 2005-76064, A

However, since SQL, which is a query statement that can be executed in a database system, has a high degree of freedom in format, there are multiple expression methods even for query statements having the same content. For this reason, there is a problem in that it is not possible to accurately search for a query text in which the content of the query matches or is similar to the specific query text, depending on the similarity of the character strings.

Further, the query statement may include a syntax that specifies a join of a plurality of tables in the database system. However, when the entire query text is treated as one character string, it is not possible to perform a search considering the structure of the query text. Therefore, in the method of performing a search by measuring the degree of similarity of a character string indicating a query sentence, it is not possible to perform a search focusing on a part of the query sentence, such as a query sentence including a join process of predetermined tables. There is.

Therefore, the present invention has been made in view of these points, and a query statement search device, a query statement search method, and a query statement that can accurately search a query statement similar to a query statement that can be executed in a database system. The purpose is to provide a search program.

An inquiry statement search device according to a first aspect of the present invention includes an input acceptance unit that accepts an input of a search statement indicating an inquiry statement that can be executed in a database system, a plurality of inquiry statements executed in the database system, A specifying unit that refers to a storage unit that stores an execution plan of the query statement that corresponds to each of a plurality of query statements in association with each other, and specifies an execution plan that at least partially matches the execution plan that corresponds to the search statement. And an output unit that outputs the query statement stored in the storage unit in association with the specified execution plan as a search result.

The inquiry statement search device extracts a structure of an inquiry statement corresponding to the execution plan based on the execution plan stored in the storage unit, and the extracted structure and a table referred to in the inquiry statement. And a storage control unit that stores the search character string in the storage unit in association with the search character string and a query sentence corresponding to the search character string. The input receiving unit receives the search character string as the search sentence, and the identifying unit refers to the storage unit and identifies the search character string that at least partially matches the received search sentence. The output unit may output the inquiry sentence stored in the storage unit in association with the specified search character string as a search result.

The character string generation unit extracts a tree structure of a query statement corresponding to the execution plan based on the execution plan stored in the storage unit, and extracts the extracted tree structure from a root node. The search character string indicating the tree structure may be generated by scanning the order of travel and the order of return.

The input receiving unit receives an input of the inquiry sentence as the search sentence, the inquiry sentence search device further comprises a conversion unit for converting the input inquiry sentence into the search character string, the specifying unit, The storage character string may be referenced to identify the search character string that at least partially matches the converted search character string.

A query statement search method according to a second aspect of the present invention includes a step of accepting an input of a search statement that is executed by a computer and that indicates a query statement that can be executed in a database system, and a plurality of query statements executed in the database system. And an execution plan of the query statement corresponding to each of the plurality of query statements are stored in association with each other, and an execution plan at least partially matching the execution plan corresponding to the search statement is specified. And a step of outputting the inquiry statement stored in the storage unit in association with the specified execution plan as a search result.

A query statement search program according to a third aspect of the present invention includes a computer, an input accepting unit that accepts an input of a search statement indicating a query statement that can be executed in a database system, and a plurality of query statements executed in the database system. Specifying a execution plan that at least partially matches the execution plan corresponding to the search statement by referring to a storage unit that associates and stores the execution plan of the query statement corresponding to each of the plurality of query statements And an output unit that outputs the query statement stored in the storage unit in association with the specified execution plan as a search result.

According to the present invention, there is an effect that a query sentence similar to a query sentence that can be executed in a database system can be accurately searched.

It is a figure which shows the outline of the inquiry sentence search system which concerns on 1st Embodiment. It is a figure which shows the structure of the inquiry sentence search device which concerns on 1st Embodiment. It is a figure which shows an example of the inquiry history information which concerns on 1st Embodiment. It is a figure which shows an example (the 1) of an inquiry sentence. It is a figure which shows an example (the 2) of an inquiry sentence. It is a figure which shows an example (the 3) of an inquiry sentence. It is a figure which shows an example (the 4) of an inquiry sentence. It is a figure which shows the execution plan corresponding to the inquiry sentence shown to FIG. 4A. It is a figure which shows the execution plan corresponding to the inquiry sentence shown in FIG. 4B. It is a figure which shows the execution plan corresponding to the inquiry sentence shown in FIG. 4C. It is a figure which shows the execution plan corresponding to the inquiry sentence shown in FIG. 4D. 5B is a diagram showing an execution plan tree corresponding to the execution plan shown in FIG. 5A. FIG. FIG. 6 is a diagram showing an execution plan tree corresponding to the execution plan shown in FIG. 5B. FIG. 6 is a diagram showing an execution plan tree corresponding to the execution plan shown in FIG. 5C. It is a figure which shows the execution plan tree corresponding to the execution plan shown in FIG. 5D. FIG. 6B is a diagram showing a search character string corresponding to the execution plan tree shown in FIG. 6A. FIG. 7 is a diagram showing a search character string corresponding to the execution plan tree shown in FIG. 6B. It is a figure which shows the character string for a search corresponding to the execution plan tree shown in FIG. 6C. It is a figure which shows the character string for a search corresponding to the execution plan tree shown in FIG. 6D. It is a figure which shows an example of the information for a search which concerns on 1st Embodiment. FIG. 5 is a diagram showing mutual Levenshtein distances of the inquiry sentences shown in FIGS. 4A to 4D. 3 is a flowchart showing a processing flow of the inquiry sentence search device relating to generation of search information according to the first embodiment. It is a flow chart which shows a flow of processing of an inquiry sentence search device concerning search of an inquiry sentence concerning a 1st embodiment. It is a figure which shows the structure of the inquiry sentence search device which concerns on 2nd Embodiment.

<First Embodiment>
[Outline of inquiry text search system S]
FIG. 1 is a diagram showing an outline of an inquiry sentence search system S according to the first embodiment. The inquiry text search system S includes the inquiry text search device 1, the database system 2, and the terminal 3, and is a system for searching an inquiry text corresponding to the processing indicated by the search text.

The inquiry text search device 1 is communicatively connected to the database system 2 and the terminal 3 via a communication network such as a LAN or the Internet. The inquiry statement search device 1 acquires an inquiry statement executed in the database system 2 and an execution plan corresponding to the inquiry statement from the database system 2 ((1) in FIG. 1).

Based on the execution plan acquired from the database system 2, the query statement search device 1 analyzes the structure of the query statement corresponding to the execution plan ((2) in FIG. 1). The query text search device 1 generates a search character string corresponding to the analyzed structure, and stores the search character string and the query text in the storage unit in association with each other ((3) in FIG. 1).

The inquiry text search device 1 acquires a search character string as a search text from the terminal 3 ((4) in FIG. 1). The query text search device 1 identifies a search character string similar to the acquired search character string from the search character strings stored in the storage unit ((5) in FIG. 1). The inquiry sentence search device 1 identifies the inquiry sentence corresponding to the identified search character string ((6) in FIG. 1). The inquiry statement search device 1 outputs the specified inquiry statement to the terminal 3 as a search result corresponding to the search statement ((7) in FIG. 1).

In this way, the query text search device 1 identifies a search text string similar to the search text based on the search text string generated by analyzing the execution plan. It is possible to accurately search for a query sentence similar to.
The configuration of the inquiry sentence search device 1 will be described below.

[Configuration Example of Query Text Retrieval Device 1]
FIG. 2 is a diagram showing the configuration of the inquiry sentence search device 1 according to the first embodiment.
The inquiry sentence search device 1 includes a storage unit 11 and a control unit 12.

The storage unit 11 is, for example, a ROM (Read Only Memory) and a RAM (Random Access Memory). The storage unit 11 stores various programs for operating the query sentence search device 1. The storage unit 11 makes the control unit 12 of the query sentence search device 1 function as an acquisition unit 121, a character string generation unit 122, a storage control unit 123, an input reception unit 124, a specification unit 125, and an output unit 126, which will be described later. Store the sentence search program.

The control unit 12 is, for example, a CPU (Central Processing Unit). The control unit 12 controls various functions of the query sentence search device 1 by executing various programs stored in the storage unit 11. The control unit 12 functions as the acquisition unit 121, the character string generation unit 122, the storage control unit 123, the input reception unit 124, the identification unit 125, and the output unit 126 by executing the inquiry sentence search program.

The acquisition unit 121 acquires a query statement and an execution plan from the database system 2. The inquiry sentence is an inquiry sentence such as SQL executed in the database system 2. The execution plan is information generated when the database system 2 executes the process corresponding to the inquiry sentence. The acquisition unit 121 associates the acquired inquiry sentence with the execution plan corresponding to the inquiry sentence and causes the storage unit 11 to store them as inquiry history information. FIG. 3 is a diagram showing an example of inquiry history information. As shown in FIG. 3, it can be confirmed that the inquiry statement and the execution plan are stored in association with each other.

4A to 4D are diagrams illustrating examples of inquiry sentences. Here, the inquiry statement shown in FIG. 4B is an inquiry statement for outputting the same data as the inquiry statement shown in FIG. 4A, and is an expression different from the inquiry statement shown in FIG. 4A.

5A to 5D are diagrams showing execution plans corresponding to the inquiry statements shown in FIGS. 4A to 4D. In FIG. 5, the first character string “Sort” and the character string after “−>” indicate a node as a process executed by the query statement. Further, the character string following the node including the character string "Scan" (hereinafter, also referred to as Scan node) indicates the table name of the referenced table. Here, it can be confirmed that the execution plan shown in FIG. 5A and the execution plan shown in FIG. 5B are the same execution plan, although the query statement is an expression different from the query statement shown in FIG. 4A.

The character string generation unit 122 generates a search character string based on the execution plan acquired by the acquisition unit 121. Specifically, the character string generation unit 122, based on the execution plan stored in the storage unit 11, a table indicating a node included in the process included in the execution plan and a table referred to in the process corresponding to the execution plan. Extract the name. The character string generation unit 122 extracts the tree structure of the query statement corresponding to the execution plan based on the description order of the code indicating the execution plan acquired by the acquisition unit 121 and the extracted node and table name. The character string generation unit 122 generates an execution plan tree that is a tree-structured graph.

6A to 6D are diagrams showing execution plan trees corresponding to the execution plans shown in FIGS. 5A to 5D. In the execution plan tree, the abbreviations of the processes in each node are shown in parentheses. For example, the abbreviation of the process “Sort” corresponding to the root node is “S”, and the abbreviation of the process “Group Aggregate” is “GA”. Further, in the execution plan tree, the table name is shown below the Scan node. Here, it can be confirmed that the execution plan tree shown in FIG. 6A and the execution plan tree shown in FIG. 6B have the same structure.

The character string generation unit 122 generates a search character string indicating a tree structure by scanning the extracted execution plan tree indicating the tree structure from the root node in the order of going and returning. That is, the character string generation unit 122 searches for a character string in which the abbreviations of the nodes detected when the execution plan tree is scanned from the root node in the order of travel and the order of return are arranged in the order of detection. Generate as.

Here, the character string generation unit 122 assigns serial numbers to nodes for which processing is duplicated. For example, both the node N1 and the node N2 shown in FIG. 6A are “Sort(S)”. Therefore, the character string generation unit 122 sets the abbreviation of the node N1 as “S1” and the abbreviation of the node N2 as “S2”. Further, the character string generation unit 122 associates the abbreviation corresponding to the Scan node with the table name of the table referred to in the Scan node.

7A to 7D are diagrams showing search character strings corresponding to the execution plan trees shown in FIGS. 6A to 6D. As shown in FIG. 7, in the search character string, it can be confirmed that the abbreviations of the nodes are listed in the order in which the nodes are detected. Further, it can be confirmed that the search character string shown in FIG. 7A and the search character string shown in FIG. 7B have the same content.

The character string generation unit 122 generates a search character string for all the inquiry sentences included in the inquiry history information stored in the storage unit 11.
The storage control unit 123 associates the search character string generated by the character string generation unit 122 with the inquiry sentence corresponding to the search character string, and causes the storage unit 11 to store the search information as search information. FIG. 8 is a diagram showing an example of search information according to the first embodiment. As shown in FIG. 8, it can be confirmed that the query text and the search conversion character string are stored in association with each other.

The input receiving unit 124 receives an input of a search sentence indicating a query sentence that can be executed in the database system 2. In the present embodiment, the input reception unit 124 receives a search character string as a search sentence from the terminal 3.

The identifying unit 125 refers to the storage unit 11 that stores the plurality of query statements executed in the database system 2 and the execution plans of the query statements corresponding to the plurality of query statements in association with each other, and the input receiving unit 124. The execution plan corresponding to at least a part of the execution plan corresponding to the search statement received by is specified.

In the present embodiment, the identifying unit 125 refers to the search character string that constitutes the search information stored in the storage unit 11 and uses the search text that is at least partially matched with the search text accepted by the input accepting unit 124. Specify the character string. Specifically, the specifying unit 125 has at least a part of the search sentence received by the input receiving unit 124, and includes only the same table as the table included in the search sentence received by the input receiving unit 124. Specify the character string for use. Here, when comparing the search character strings, the identifying unit 125 compares the search character strings with the serial numbers attached to the respective abbreviations removed.

For example, when the input receiving unit 124 receives the search character string corresponding to the inquiry sentence illustrated in FIG. 4A, that is, the search character string illustrated in FIG. 7A as the search sentence, the specifying unit 125 determines that the search character string. The search character string shown in FIG. 7A and the search character string shown in FIG. 7B are specified as the search character strings matching with. Therefore, if the execution plans are the same, the identifying unit 125 can search for the same query statement even if the expressions are different.

As another example, consider using a search character string corresponding to the query text shown in FIG. 4C, that is, a part of the search text string shown in FIG. 7C as a search text. When attention is focused on the process of joining the region table and the state table and the process of joining the result of the join and the customer table, in the execution plan tree shown in FIG. 6C, the second node “Nested Loop” from the root node is displayed. The following subtrees are applicable. The search sentence is expressed as follows.

NL BS BS HJ H SS1 SS1 H SS2 SS2 HJ NL
BS→customer, SS1→region, SS2→nation

The specifying unit 125 specifies the search character string shown in FIG. 7C and the search character string shown in FIG. 7D as the search character string that at least partially matches the above-mentioned search sentence. This indicates that although the entire query statement does not match, it is possible to search for similar query statements that share a part of the structure when the query statement is represented in the execution plan tree.

In order to compare with the technique of measuring the similarity between character strings, which is a conventional technique, the Levenshtein distance between the inquiry sentence shown in FIG. 4A and the inquiry sentences shown in FIGS. 4B to 4D is shown. FIG. 9 is a diagram showing mutual Levenshtein distances of the inquiry sentences shown in FIGS. 4A to 4D.

The smaller the Levenshtein distance, the higher the similarity of the character string. In the case of the same inquiry sentence, the Levenshtein distance is 0. In FIG. 9, the Levenshtein distance between the inquiry sentence shown in FIG. 4A and the inquiry sentence shown in FIG. 4C is small, and the similarity between these inquiry sentences is high. However, since the inquiry text shown in FIG. 4A and the inquiry text shown in FIG. 4B show the same processing content, the inquiry text shown in FIG. 4A and the inquiry text shown in FIG. 4B are actually similar to each other. ing.

In addition, the Levenshtein distances of the inquiry sentence shown in FIG. 4C and the inquiry sentence shown in FIG. 4D are the Levenshtein distance between the inquiry sentence shown in FIG. 4B and the inquiry sentence shown in FIG. 4C, and the inquiry sentence shown in FIG. 4B. The Levenshtein distance is larger than the inquiry sentence shown in FIG. 4D, and the similarity is low. However, since the query text shown in FIG. 4C and the query text shown in FIG. 4D include common processing, the query text as a whole does not match, but it can be said that the similarity is high. Therefore, it can be confirmed that the accuracy of the search result of the degree of similarity based on the Levenshtein distance is lower than the accuracy of the search result in the query sentence search device 1 according to the present embodiment.

The output unit 126 outputs the query statement stored in the storage unit 11 in association with the specified execution plan as a search result. In the present embodiment, the output unit 126 outputs the inquiry sentence associated with the search character string specified by the specifying unit 125 in the search information stored in the storage unit 11 to the terminal 3 as a search result.

[Processing flow for generating search information]
Next, the flow of processing in the inquiry text search device 1 will be described. First, a flow of processing of the inquiry sentence search device 1 related to generation of search information will be described. FIG. 10 is a flowchart showing a processing flow of the inquiry sentence search device 1 related to generation of search information according to the first embodiment.

First, the acquisition unit 121 acquires a query statement and an execution plan from the database system 2 (S10), and stores the query statement and the execution plan in the storage unit 11.
Next, the character string generation unit 122, based on the execution plan stored in the storage unit 11, the node indicating the process included in the execution plan and the table name of the table referred to in the process corresponding to the execution plan. Extract (S20).

Next, the character string generation unit 122 generates an execution plan tree based on the extracted node and table name (S30).
Subsequently, the character string generation unit 122 generates a search character string based on the generated execution plan tree (S40), and associates the search character string with the query statement corresponding to the search character string. It is stored as search information (S50).

The character string generation unit 122 determines whether or not the search character string has been generated for all the inquiry sentences stored in the storage unit 11 (S60). If the character string generation unit 122 determines that the search character strings have been generated for all the query sentences, it ends the processing according to this flowchart, and if it determines that the search character strings have not been generated for all the query sentences, The processing moves to S20.

[Process flow related to query text search]
Next, a processing flow of the inquiry sentence search device 1 related to the inquiry sentence search will be described. FIG. 11 is a flowchart showing the flow of processing of the inquiry sentence search device 1 relating to the inquiry sentence search according to the first embodiment.

First, the input receiving unit 124 receives a search character string as a search sentence (S110).
Subsequently, the identifying unit 125 refers to the search character string that constitutes the search information stored in the storage unit 11, and the search character string that at least partially matches the search sentence received by the input reception unit 124. Is specified (S120).

Subsequently, the output unit 126 identifies the inquiry sentence associated with the search character string identified by the identifying unit 125 in the search information stored in the storage unit 11 (S130). Then, the output unit 126 outputs the specified inquiry sentence to the terminal 3 as a search result (S140).

[Effects of First Embodiment]
As described above, the query statement search device 1 according to the first embodiment accepts an input of a search statement indicating a query statement that can be executed in the database system 2, receives a plurality of query statements executed in the database system 2, and Of the query statement, the execution plan of the query statement is stored in association with each other, and the execution plan at least partially matching the execution plan corresponding to the search statement is identified and identified. The query statement stored in the storage unit 11 in association with the execution plan is output as a search result.

By doing so, the query statement search device 1 can handle the query statements showing the same processing content with different expression forms of the query statement as the query statement showing the same processing content based on the execution plan. As a result, the query text search device 1 can accurately search for a query text that is similar in structure to the query text indicated by the search text.

<Second Embodiment>
[Accept input of inquiry text as search text. ]
Next, the second embodiment will be described. In the first embodiment, the input of the search character string is accepted as the search text. On the other hand, the inquiry sentence search device 1 according to the second embodiment is different from the inquiry sentence search device 1 according to the first embodiment in that an inquiry sentence input as a search sentence is accepted. The inquiry sentence search device 1 according to the second embodiment will be described below. The description of the same parts as those in the first embodiment will be appropriately omitted.

FIG. 12 is a diagram showing the configuration of the inquiry sentence search device 1 according to the second embodiment. As shown in FIG. 12, the inquiry sentence search device 1 according to the second embodiment further includes a conversion unit 127.
In the second embodiment, the input receiving unit 124 receives input of an inquiry sentence as a search sentence from the terminal 3.

The conversion unit 127 converts the input inquiry sentence into a search character string. For example, the conversion unit 127 transmits the input inquiry sentence to the database system 2 and requests acquisition of the execution plan of the inquiry sentence. When the query text is input, the database system 2 creates an execution plan for the query text and sends the execution plan to the query text search device 1.

Upon receiving the execution plan from the database system 2, the conversion unit 127 extracts a node indicating a process included in the execution plan and a table name of a table referred to in the process corresponding to the execution plan, based on the execution plan. .. The conversion unit 127 generates the execution plan tree of the query statement corresponding to the execution plan, based on the description order of the received code indicating the execution plan and the extracted node and table name. The conversion unit 127 converts the input query sentence into a search character string by generating a search character string based on the execution plan tree.

The identifying unit 125 refers to the search character string that constitutes the search information stored in the storage unit 11, and determines a search character string that at least partially matches the search character string converted by the conversion unit 127. Identify.
The output unit 126 outputs the inquiry sentence associated with the search character string specified by the specifying unit 125 in the search information stored in the storage unit 11 to the terminal 3 as a search result.

[Effects of Second Embodiment]
As described above, the inquiry statement search device 1 according to the second embodiment accepts an input of an inquiry statement as a search statement, converts the entered inquiry statement into a search character string, and stores the search in the storage unit 11. The search information is referenced to identify a search character string that at least partially matches the converted search character string.

By doing so, even if the user of the terminal 3 cannot generate the search character string corresponding to the inquiry sentence, by inputting the inquiry sentence to the inquiry sentence search device 1, the inquiry sentence and the processing content are You can search for similar query sentences.

Although the present invention has been described using the embodiments, the technical scope of the present invention is not limited to the scope described in the above embodiments. It is apparent to those skilled in the art that various modifications and improvements can be added to the above-described embodiment. For example, the plurality of embodiments described above may be combined.

Further, in the above-described embodiment, the inquiry text search device 1 compares the search character string received from the terminal 3 with the search character string included in the search information to thereby obtain the search character string received from the terminal 3. A search character string similar to the character string is specified, but the present invention is not limited to this. For example, the inquiry statement search device 1 may store the inquiry statement and the execution plan in the storage unit 11 in association with each other, and receive a character string indicating at least a part of the execution plan from the terminal 3. Then, the inquiry statement search device 1 may specify an execution plan that at least partially matches the received character string, and output the inquiry statement corresponding to the specified execution plan as the search result.

In this case, the inquiry statement search device 1 may accept the inquiry statement and convert the inquiry statement into an execution plan. Then, the query statement search device 1 may specify an execution plan that at least partially matches the converted execution plan, and output a query statement corresponding to the specified execution plan as a search result.

Further, in particular, the specific embodiment of the dispersion/integration of the devices is not limited to the one shown in the above, and any or all of them may be arbitrarily added depending on various additions or functional loads. It can be functionally or physically distributed/integrated in units.

DESCRIPTION OF SYMBOLS 1... Query sentence retrieval device, 11... Storage unit, 12... Control unit, 121... Acquisition unit, 122... Character string generation unit, 123... Storage control unit, 124...・Input receiving unit, 125...Specification unit, 126...Output unit, 127...Conversion unit, 2...Database system, 3...Terminal, S...Inquiry sentence search system

Claims (6)

An input receiving unit that receives an input of a search statement indicating a query statement that can be executed in the database system,
With reference to a storage unit that stores a plurality of query statements executed in the database system and an execution plan of the query statement corresponding to each of the plurality of query statements in association with each other, an execution plan corresponding to the search statement and An identification unit that identifies execution plans that at least partially match,
An output unit that outputs the query statement stored in the storage unit in association with the identified execution plan as a search result,
An inquiry sentence search device comprising: Based on the execution plan stored in the storage unit, a structure of a query statement corresponding to the execution plan is extracted, and a search character string indicating the extracted structure and a table referred to in the query statement A character string generation unit that generates
The storage control unit further stores the search character string and an inquiry sentence corresponding to the search character string in the storage unit in association with each other,
The input receiving unit receives the search character string as the search sentence,
The identifying unit refers to the storage unit and identifies the search character string that at least partially matches the received search sentence,
The output unit outputs the query statement stored in the storage unit in association with the specified search character string, as a search result,
The inquiry sentence search device according to claim 1. The character string generation unit extracts a tree structure of a query statement corresponding to the execution plan based on the execution plan stored in the storage unit, and extracts the extracted tree structure from a root node. Generating the search character string indicating a tree structure by scanning the order of going and the order of returning,
The inquiry sentence search device according to claim 2. The input receiving unit receives an input of the inquiry sentence as the search sentence,
Further comprising a conversion unit for converting the input query text into the search character string,
The specifying unit refers to the storage unit and specifies the search character string that at least partially matches the converted search character string,
The inquiry sentence search device according to claim 2. Computer running,
A step of receiving an input of a search statement indicating a query statement that can be executed in the database system,
With reference to a storage unit that stores a plurality of query statements executed in the database system and an execution plan of the query statement corresponding to each of the plurality of query statements in association with each other, an execution plan corresponding to the search statement and Identifying execution plans that at least partly match,
Outputting a query statement stored in the storage unit in association with the specified execution plan as a search result,
A query text search method comprising: Computer,
An input receiving unit that receives an input of a search statement indicating a query statement that can be executed in the database system,
With reference to a storage unit that stores a plurality of query statements executed in the database system and an execution plan of the query statement corresponding to each of the plurality of query statements in association with each other, an execution plan corresponding to the search statement and An identification unit that identifies execution plans that at least partially match, and
An output unit that outputs the query statement stored in the storage unit in association with the specified execution plan as a search result,
Query search program to function as.

Images