JP2014081905A - Device for providing graphical interface for assisting preparation of logic formula - Google Patents

Abstract

PROBLEM TO BE SOLVED: To facilitate the preparation of a logic formula for retrieving data.SOLUTION: The device has: terms; means for storing a logic character string consisting of the combination of subexpression character strings in which the terms are combined by the logic operator; means for dividing the logic character string into the terms or dividing the terms as a subexpression tree consisting of the recursive structure of the subexpression tree in which the terms are combined by the logic operator; and number-of-cases storage means for storing the number of cases retrieved by the subexpression character string. Further, the device has display means for displaying the subexpression character string and the subexpression tree accompanied with the stored number of cases in the number-of-cases storage means, and includes means for selecting whether the subexpression tree is not displayed with the subexpression character string left as it is or whether the subexpression tree is displayed together with the subexpression character string. The user of the device can easily grasp the hierarchic structure of the logic formula, and can recognize the number of cases, and can edit the subexpression character string and the subexpression tree displayed by the display means. The device further includes means for retaining the input subexpression character string as a hysteresis.

Description

  The present invention relates to an apparatus for providing a graphical interface that assists in creating a logical expression for retrieving data.

  In recent years, in order to find necessary information from information held in the company or organization as well as information on the Internet, a method of specifying a keyword and searching for information corresponding to the keyword is often employed.

  However, more and more information is held, and finding desired information has become difficult in proportion to the amount of information.

  In general, not only simple keyword searches but also logical expressions including keywords can be described so that desired information can be specified as much as possible from such a large amount of information. The user searches for desired information while narrowing down information by connecting keywords with an AND condition or expanding a corresponding range by connecting with an OR condition.

JP 2012-78966 A

  In the method of describing a logical expression as a search keyword, there is a problem that when the logical expression becomes complicated, it is difficult to grasp the range of combination of AND conditions and OR conditions and the hierarchical relation of logical expressions. For the same reason, there is a problem that it is difficult to correct the logical expression.

  In addition, when narrowing down information or expanding the applicable range, the number of hits can be used as a judgment material, but in order to find the number of hits, it was necessary to actually perform a search. Even if the search is actually performed, only the number of cases corresponding to the entire logical expression is known, and the number of cases cannot be obtained for some of the logical expressions constituting the logical expression.

  The present invention provides a means for storing a logical expression character string composed of a combination of a database, a term, and a partial expression character string obtained by combining terms with a logical operator; It has a means to divide as a subexpression tree consisting of a recursive structure of subexpression trees combined with children.

  The number storage means for storing the number of cases when the partial expression character string is searched in the database, the partial expression character string, or the partial expression tree, or both the partial expression character string and the partial expression tree, Display means for displaying the number of cases stored in the number storage means.

  The display means includes means for selecting whether to leave the partial expression character string by the user's operation and hide the partial expression tree, or to display the partial expression tree together with the partial expression character string.

  The display means displays the partial expression tree as a binary tree.

  The display means displays the partial expression tree as an N-ary tree.

  The sub-character string displayed by the display means is stored as a history, and the display means further obtains and displays the history from the history storage means.

  The user can edit the partial expression character string displayed by the display means.

  The user can edit the partial expression tree displayed by the display means.

  By dividing the logical expression as a partial expression tree composed of a recursive structure of the partial expression tree and visually displaying it, the user can easily grasp the structure of a complicated logical expression.

  By dividing and displaying a logical expression as a partial expression character string, a user can decompose and understand a complicated logical expression. By displaying this sub-expression character string together with the sub-expression tree, there is an effect that the user can easily grasp the structure of a complicated logical expression.

  The sub-expression tree is displayed together with the number of cases when it is searched, so that the user can know the number of cases corresponding to the logical expression without actually performing the search. Since the sub-expression tree has a recursive structure, the user can grasp not only the total number of logical expressions used for the search but also the number of individual parts of the logical expression. Thereby, there is an effect that a judgment material for reviewing the logical expression can be obtained.

  The sub-expression tree can be selected by the user's operation to leave the sub-expression string and hide the sub-expression tree, or to display the sub-expression tree together with the sub-expression string. By hiding, it is possible to make it easier to comprehend complex logical expressions.

  Needless to say, the effect that the structure of the logical expression can be easily grasped is also effective when the logical expression is edited.

  The logical expression can be edited by either a method of editing the sub-expression character string or a method of editing the sub-expression tree. Therefore, there is an effect that editing can be performed by a more suitable method according to the situation.

  For example, in the method of editing a sub-expression character string, the logical expression is in text format, so a part of the logical expression is copied as text format with the clipboard function of the operating system and pasted to another place or a useful part It is possible to store the expression string in a text file format in the local file system. In the method of editing the sub-expression tree, it is possible to perform editing while visually grasping the structure of the logical expression. Further, the editing operation can be made possible by a pointing device such as a mouse.

  Since all or part of the partial expression tree can be saved as a history, it is easier to edit a logical expression by returning to the original if you make a mistake or by reusing a past useful partial expression string. There is an effect that can be made.

  Patent Document 1 “Japanese Patent Application Laid-Open No. 2012-78966” is an invention of an apparatus that supports the creation of a search query. A logical expression can be displayed and edited in a tree structure, but there is no means for displaying a partial expression character string. There is no way to hide unnecessary subexpression trees. In the present invention, it is possible to hide an unnecessary sub-expression tree and display only a sub-expression character string and the number of cases. In addition, there is no means for editing a logical expression with a character string. In the present invention, a partial character string can be edited.

  One of the best modes for carrying out the invention is shown in the drawings.

  FIG. 1 shows a search screen. The search screen includes a search text box (701), a logical expression creation auxiliary button (702), a search button (703), and a search result display section (704). When the user inputs a logical expression in the search text box (701) and presses the search button (703), the search result is displayed in the search result display section (704). When the user inputs a logical expression in the search text box (701) and presses the logical expression creation auxiliary button (702), if there is no grammatical error in the logical expression, the logical expression creation auxiliary dialog (705) is displayed. Is displayed. Note that the logical expression creation auxiliary button (702) may be pressed in the same manner when an arbitrary key such as a tab key is pressed.

  FIG. 2 shows a search screen in which a logical expression creation assistance dialog (705) is displayed after only a search keyword is entered as a logical expression in the search text box (701). The logical expression creation auxiliary dialog (705) is a dialog for visually displaying and editing the tree structure of the logical expression. The logical expression creation auxiliary dialog (705) includes a close button (706), an overall logical expression label (707), a history movement button (708), and a partial expression tree display section (709).

The close button (706) is a button for ending the logical expression creation assistance dialog (705). The overall logical expression label (707) displays the logical expression as a result of editing in the logical expression creation assistance dialog (705) and the number of cases corresponding to the result of searching with the logical expression. The history movement button (708) is a button for tracing the history of the edit contents of the logical expression. When the left button of the history movement button (708) is pressed, the previous state can be restored.
By pressing the right button of the history movement button (708), it is possible to proceed again from the previous state to the state after editing. The partial expression tree display section (709) is an area where logical expressions are visually displayed in a recursive structure of the partial expression tree.

  When the logical expression to be displayed is only a search keyword, the sub-expression tree display section (709) displays a frame (710) indicating the range of the logical expression, and an operation button in the frame (710) indicating the range of the logical expression. (711), a term and operator selection box (712), a term input box (713), and a term display label (714) are displayed. The operation button (711) is a button that can call an operation that can be performed on the logical expression. The types of operations include “replacement”, “deletion”, “copy”, “cut”, and “paste”. In the term and operator selection box (712), any of AND, OR, NOT, and term can be selected, and the term is initially selected. The term input box (713) is a text box for inputting a search keyword. The term display label (714) displays the search keyword and the number of hits when searching with the search keyword.

  When one of AND, OR, and NOT is selected in the term and operator selection box (712), the selected operator and a new search keyword input line are added. FIG. 3 shows a search screen on which a logical expression creation assistance dialog is displayed immediately after AND is selected. Here, a tree open / close button (715), a logical operator selection box (716), and a partial expression edit button (718) are displayed.

  When the tree open / close button (715) is pressed, the logical operator selection box (716), the partial expression display label (717), and the partial expression edit button (718) are left and other elements are hidden as shown in FIG. When the tree open / close button (715) is pressed again, the non-displayed items are displayed and the state returns to the state shown in FIG. The logical operator selection box (716) can select the relationship between the upper and lower search keywords from AND, OR, and NOT. The sub-expression display label (717) displays the sub-expression character string and the number of cases corresponding to the search. The partial expression edit button (718) is a button for directly editing the partial expression character string. When the partial expression edit button (718) is pressed, as shown in FIG. 5, the partial expression display label (717) is changed to an inputable partial expression input box (719). In the partial expression input box (719), a logical expression can be directly input. When the input is finished and the edit end button (720) is pressed, a tree structure is created again according to the input logical expression. If there is an error in the input logical expression, an error to that effect can be displayed.

  The frame (710) indicating the range of logical expressions can be nested. As a result, the tree structure of the logical expression is displayed hierarchically. FIG. 6 is an example of a screen in which an OR condition is added to FIG. This nesting can be done in any number of stages.

  Details of the operation button (711) will be described. The operation button (711) has a different range to be operated depending on the displayed position. In the case of the operation button (711) on the left of the term, the operation target is the term in the same row. In the case of the operation button (711) on the left of the logical operator, the portion surrounded by a frame (710) indicating the range of the logical expression including itself is the target of the operation. When the operation button (711) is pressed, an operation selection menu (721) is displayed. In the operation selection menu (721), “replace”, “delete”, “copy”, “cut”, and “paste” are displayed, and the operation selected by the user is executed. When “exchange” is selected, the first item and the second item are exchanged around the logical operator. When “Delete” is selected, the logical expression in the range to be operated is deleted. At this time, unnecessary logical operators are also deleted. When “Copy” is selected, the logical expression in the range to be operated is copied onto the memory. When “Cut” is selected, the logical expression in the range to be operated is deleted and copied to the memory. When “Paste” is selected after “Copy” or “Cut” is performed in advance, the logical expressions copied on the memory are connected with an AND condition.

  Further, when a pointing device such as a mouse is used for the user interface, it may be possible to move a logical expression by drag and drop. In this case, when the left button of the mouse is pressed on the operation button (711), the pointer is moved (dragged) to the position to be moved, and the left button is released (dropped), the logical expression is displayed at the position indicated by the pointer. Moving.

  The user can combine the above-mentioned operations such as selection of terms and logical operators, editing of terms, selection of logical operators, selection of logical operators, editing, replacement, deletion, copying, cutting, and pasting of subexpression character strings. Edit the expression. When the desired logical expression is completed, when the entire logical expression label (707) is pressed, the logical expression is input to the search text box (701), and the search is executed. Further, not only the whole logical expression but also a part of the logical expression can be similarly searched by pressing the partial expression display label (717).

  An apparatus for realizing the present invention includes a search screen (200), a WEB browser (100) that displays the search screen (200), a screen distribution device (300) that stores the search screen (200), and a logical expression. A logical expression analysis device (400) for analyzing the number of cases, a number search device (500) for obtaining the corresponding number of logical expressions, and a search device (600) for performing a search using logical expressions. A block diagram showing the relationship between these devices is shown in FIG.

  The user acquires the search screen (200) from the screen distribution device (300) using the WEB browser (100). The WEB browser displays a search screen (200). When a user inputs a logical expression into the search text box (701) of the search screen (200) and presses the 702 creation auxiliary button, the search text is searched using the logical expression transmission logic (201) of the search screen (200). The logical expression input in the box (701) is asynchronously transmitted to the logical expression analyzer (400). Asynchronous refers to a communication method in which other processing can be executed while waiting for a communication response, and if there is a response while other processing is being performed, reception processing is executed.

  The logical expression analyzer (400) converts the logical expression into a logical expression structured in a binary tree. A logical expression structured in a binary tree is a binary tree having a search keyword in each branch of the binary tree and a logical operator in a clause. A conceptual diagram of a logical expression structured in a binary tree is shown in FIG.

  The logical expression analyzer (400) converts the sent logical expression into a logical expression structured into a binary tree as follows in accordance with the flow shown in FIGS. 20-1 and 20-2. The logical expression analyzer (400) first prepares a stack for storing the binary tree in the pre-processing S01. Next, the logical expression sent by the word decomposition process S02 is read character by character from the front, and the word is extracted from the character string. If there are no words, the process ends. If the word is “(”, the stack creation process S03 stacks a new binary tree on the stack and returns to the word decomposition process S02. If the word is “)” and two or more binary trees are stacked on the stack, the stack is extracted. In step S04, one binary tree is extracted from the stack, and the extracted binary tree is set in the branch tree branch of the next stack. If the word is not any, the determined word is set as a search keyword on the branch of the binary tree.

  Next, reading is continued until a character other than a blank is found in the word decomposition process S06. If there is no word, the process ends. If there is a word, the process is switched depending on the type of word. When the word is “AND”, “OR” or “NOT”, the priority is compared with the previous operator, and if the priority is low or the same, the clause of the operator is created by the clause creation processing S07. Then, the previous section is set in the created section branch, and the process returns to the word decomposition process S02. If the priority is high, a clause for the operator is created by the clause creation processing S08, replaced with the last set branch, the branch is moved below the clause, and the processing returns to the word decomposition processing S02. If there is no word, it is assumed that “AND” exists, and the priority is compared with the previous operator. If the priorities are low or the same, a clause for an AND operator is created by clause creation processing S07, the previous clause is set to the branch of the created clause, and the process returns to word branch B02. If the priority is high, a clause of the AND operator is created by the clause creation process S08, replaced with the last set branch, the branch is moved below the clause, and the process returns to the word branch B02.

  The logical expression analyzer (400) returns the logical expression structured in the binary tree to the search screen (200). Any format can be returned, but JSON is used in this embodiment. FIG. 9 shows a logical expression structured in a binary tree expressed in JSON.

  When the search screen (200) receives the logical expression structured in the binary tree, the search screen (200) displays it on the screen using the binary tree display logic (202).

  The binary tree display logic (202) converts a logical expression clause structured in the received binary tree into an HTML element representing a frame (710) indicating a range of the logical expression, and an operator set in the clause as a logical operator. The search keyword set in the branch is converted into an HTML element representing a selection box (716) and an HTML element representing a term input box (713) and a term display label (714). At the same time, an operator is taken out from the clause of the logical expression structured in the binary tree, and a logical expression that is shaped by connecting with the branch search keyword is obtained, and the HTML element representing the subexpression display label (717) is obtained. Convert.

  The search screen (200) asynchronously transmits the shaped logical formula obtained from the logical formula structured in the binary tree to the number search device (500). The number search device (500) performs a search using the transmitted logical expression and returns the number of cases. The search screen (200) displays the number of returned items on the whole logical expression label (707), the term display label (714), and the partial expression display label (717). FIG. 10 shows a sequence from inputting a logical expression to the text box to displaying the number of cases.

  The processing from the analysis of the logical expression to the display of the number of cases is similarly performed when the partial expression character string and the partial expression tree are edited. In addition, when there are changes in a plurality of sub-expression character strings and sub-expression trees, processing is performed asynchronously and in parallel for each changed portion.

Based on the first embodiment, an example in which the history of retrieved logical expressions can be saved and reused is shown.
In addition to the apparatus prepared in the first embodiment, an apparatus (900) for storing a logical expression is provided. Also, a logical expression save button (724) is provided in the header portion of the search result display section (704) of the search screen, and a saved logical expression display button (725) is added to the logical expression creation assistance dialog (705). Further, a stored logical expression list display panel (726) is prepared to display a list of stored logical expressions. This screen image is shown in FIG. 11, FIG. 12 and FIG.

  As shown in the first embodiment, when the user inputs a logical expression in the search text box (701) on the search screen and presses the search button (703), the search result is displayed on the search result display unit (704). Is done. At this time, the search screen transmits the logical expression to the search device 600 and simultaneously stores the transmitted logical expression as a history in the memory of the Web browser. Further, when a logical expression storage button (724) provided in the search result display section (704) is pressed, the logical expression searched at this time is transmitted to the apparatus 900 for storing the logical expression, and the apparatus for storing the logical expression 900 stores the received logical expression.

  When using the stored logical expression, the user presses the stored logical expression display button (725) to display the stored logical expression list display panel (726). The saved logical expression list display panel (726) includes a selection tab (727), a logical expression list (728), a logical expression copy button (729), and a delete button (730).

  The selection tab (727) is used to switch between a list of logical expressions automatically saved when the search is executed and a list of logical expressions explicitly saved by the user pressing the logical expression save button (724). Tab button. The logical expression list (728) is an area in which a list of stored logical expressions is displayed. Selecting the History tab displays a list of logical expressions stored in the browser memory. When the favorite tab is selected, the search screen acquires the logical expressions stored from the apparatus 900 for storing logical expressions, and a list of the acquired logical expressions is displayed. There is no difference between the items displayed in the list of automatically saved formulas and the list of explicitly saved formulas. When the user selects a logical expression to be inserted from the logical expression list (728) and presses the logical expression copy button (729), the selected saved logical expression is copied onto the memory. When the user depresses the operation button (711) at the position to be inserted and selects "Paste", the logical expressions copied on the memory are connected by the AND condition. If there is an unnecessary logical expression in the list of logical expressions displayed in the logical expression list (728), it can be deleted by pressing the delete button (730).

  Further, when a pointing device such as a mouse is used for the user interface, it may be possible to insert a logical expression stored by drag and drop. In this case, press the left mouse button on the logical expression displayed in the logical expression list (728), move (drag) the pointer over the term or sub-expression character string you want to insert, and click the left button. When released (dropped), the selected logical expression is connected to the term or sub-expression character string at the location indicated by the pointer using an AND condition.

  Based on the second embodiment, an example in which the sub-expression character string can be stored and reused is shown.

  In addition to the device prepared in the second embodiment and the changed screen, a partial expression saving button (731) is provided in the logical expression creation assistance dialog (705). This screen image is shown in FIG.

  When the user saves the subexpression save button (731) displayed in the vicinity of the subexpression character string for the subexpression character string that the user wants to reuse, the subexpression that is a logical expression in the device that stores 900 subexpressions. The string is sent and saved.

  When using the saved logical expression, as in the second embodiment, the user presses the saved logical expression display button (725) to display the saved logical expression list display panel (726).

  The selection tab (727) is a list of logical expressions that are automatically saved when the search is executed, and is explicitly saved by the user pressing the logical expression save button (724) or the partial expression save button (722). A tab button for switching a list of logical expressions. The logical expression list (728) is an area in which a list of stored logical expressions is displayed. When the favorite tab is selected, the search screen acquires the logical expressions stored from the apparatus 900 for storing logical expressions, and a list of the acquired logical expressions is displayed. There is no difference between the items displayed in the list of automatically saved formulas and the list of explicitly saved formulas. When the user selects a logical expression to be inserted from the logical expression list (728) and presses the logical expression copy button (729), the selected saved logical expression is copied onto the memory. When the user depresses the operation button (711) at the position to be inserted and selects "Paste", the logical expressions copied on the memory are connected by the AND condition. If there is an unnecessary logical expression in the list of logical expressions displayed in the logical expression list (728), it can be deleted by pressing the delete button (730).

  Further, when a pointing device such as a mouse is used for the user interface, it may be possible to insert a logical expression stored by drag and drop. In this case, press the left mouse button on the logical expression displayed in the logical expression list (728), move (drag) the pointer over the term or sub-expression character string you want to insert, and click the left button. When released (dropped), the selected logical expression is connected to the term or sub-expression character string at the location indicated by the pointer using an AND condition.

  Based on the first embodiment, an example in which the logical expression is improved to be structured into an N-ary tree will be described. In the method shown in the first embodiment, the tree structure representing the logical expression is a binary tree. Although the binary tree has a simple structure and is easy to implement, there is a problem that the hierarchy becomes deep when there are many search keywords to enumerate. In this embodiment, this problem is solved by using an N-ary tree as a tree structure representing a logical expression.

  FIG. 13 shows an example of a logical expression creation assistance dialog when a logical expression is structured into an N-ary tree. In the frame (801) indicating the range of the logical expression, only up to two terms or subexpression trees can be described in the first embodiment, but in this example, N terms or subexpression trees can be described. . Accordingly, the meaning of the operator selected in the logical operator selection box (802) is not a relationship between two terms or subexpression trees but a relationship between N terms or subexpression trees. Accordingly, the display position of the partial expression display label (803) is the first line in the frame indicating the range of the logical expression.

  When a new term is added because it is an N-ary tree, it is added in the same row as another term in the frame (801) indicating the range of the logical expression, or a frame (801) indicating the range of the new logical expression It is necessary to select whether to add one lower level. Therefore, as an option of the operation selection menu (804), an addition in the same row and an addition in the lower level are prepared.

  As in the first embodiment, the apparatus that implements the fourth embodiment includes a WEB browser (100) that displays the search screen (200), a screen distribution apparatus (300) that stores the search screen (200), and a logical expression. A logical expression analysis apparatus (400) for analysis, a number search apparatus (500) for obtaining the number of corresponding logical expressions, and a search apparatus (600) for performing a search using a logical expression are provided. Of these, the search screen (200) and logical expression analyzer (400) need to be changed.

  The user acquires the search screen (200) from the screen distribution device (300) using the WEB browser (100). The WEB browser displays a search screen (200). When a user inputs a logical expression into the search text box (701) of the search screen (200) and presses the 702 creation auxiliary button, the search text is searched using the logical expression transmission logic (201) of the search screen (200). The logical expression input in the box (701) is asynchronously transmitted to the logical expression analyzer (400).

  The logical expression analyzer (400) converts the logical expression into a logical expression structured in an N-ary tree. A logical expression structured in an N-ary tree is an N-ary tree having a search keyword in each branch of the N-ary tree and a logical operator in a clause. A conceptual diagram of a logical expression structured in an N-ary tree is shown in FIG.

  The logical expression analyzer (400) converts the sent logical expression into a logical expression structured into an N-ary tree as follows according to the flow shown in FIGS. 21-1 and 21-2. . The logical expression analyzer (400) first prepares a stack for storing the N-ary tree in the pre-processing S21. Next, the logical expression sent by the word decomposition process S22 is read character by character from the front, and the word is extracted from the character string. If there are no words, the process ends. When the word is “(”, a new N-ary tree is stacked on the stack by the stack creation process S23 and the process returns to the word decomposition process S22. When the word is “)” and two or more N-ary trees are stacked on the stack, One N branch tree is extracted from the stack by stack extraction processing S24, and the extracted N branch tree is set to the branch of the N tree of the next stack. If the word is not any, the determined word is set as a search keyword on the branch of the N-ary tree.

  Next, reading is continued until a character other than a blank is found in the word decomposition process S26, and if there is no word, the process ends. If there is a word, the process is switched depending on the type of word. When the word is “AND”, “OR” or “NOT”, the priority is compared with the previous operator. If the priority is low, the clause of the operator is created by the clause creation processing S27, and the created clause is created. The previous section is set to the branch of, and the process returns to the word decomposition process S22. If the priority is high, a clause for the operator is created by the clause creation processing S28, replaced with the last set branch, the branch is moved below the clause, and the processing returns to the word decomposition processing S22. If the operators are the same, an empty branch is added, and the process returns to the word decomposition process S22. If there is no word, it is assumed that “AND” exists, and the priority is compared with the previous operator. If the priority is low, a clause for the AND operator is created by the clause creation process S27, the previous clause is set to the branch of the created clause, and the process returns to the word branch B22. If the priority is high, a clause of the AND operator is created by the clause creation processing S28, replaced with the last set branch, the branch is moved below the clause, and the process returns to the word branch B22. If the operators are the same, an empty branch is added, and the process returns to the word decomposition process S22.

The logical expression analyzer (400) returns the logical expression structured in the N-ary tree to the search screen (200). Any format can be returned, but JSON is used in this embodiment. An example of a logical expression structured in an N-ary tree expressed in JSON is shown in FIG.

  The search screen (200) displays a logical expression structured on the returned N-ary tree on the screen. The search screen (200) obtains a logical expression shaped from a logical expression structured in an N-ary tree and transmits the obtained logical expression to the number search device (500) asynchronously. The number search device (500) performs a search using the transmitted logical expression and returns the number of cases. The search screen (200) displays the number of returned items on the term display label (805) and the partial expression display label (803).

  The processing from the analysis of the logical expression to the display of the number of cases is similarly performed when the partial expression character string and the partial expression tree are edited. In addition, when there are changes in a plurality of sub-expression character strings and sub-expression trees, processing is performed asynchronously and in parallel for each changed portion.

  An example in which a field name can be specified for a term based on the first embodiment will be described.

  When the search target data is stored by being divided into fields for each attribute, the search can be performed more accurately by specifying the field name and performing the search.

  FIG. 16 shows a logical expression creation auxiliary dialog in which a field name can be specified as a term. A field name input box (806) is newly provided before the term input box.

  As in the first embodiment, the apparatus that implements the fifth embodiment includes a WEB browser (100) that displays the search screen (200), a screen distribution apparatus (300) that stores the search screen (200), and a logical expression. A logical expression analysis apparatus (400) for analysis, a number search apparatus (500) for obtaining the number of corresponding logical expressions, and a search apparatus (600) for performing a search using a logical expression are provided. Of these, the search screen (200) and logical expression analyzer (400) need to be changed.

  The user acquires the search screen (200) from the screen distribution device (300) using the WEB browser (100). The WEB browser displays a search screen (200). When a user inputs a logical expression into the search text box (701) of the search screen (200) and presses the 702 creation auxiliary button, the search text is searched using the logical expression transmission logic (201) of the search screen (200). The logical expression input in the box (701) is asynchronously transmitted to the logical expression analyzer (400).

  The logical expression analyzer (400) converts the logical expression into a logical expression structured in a binary tree. A logical expression structured in a binary tree is a binary tree having field names and search keywords in each branch of the binary tree and logical operators in clauses. The processing of the logical expression analyzer (400) in the fifth embodiment is almost the same as that in the first embodiment, except that each branch has not only a search keyword but also a field name. In addition to the processing of the first embodiment, if the field name is omitted, the field name is complemented. The logical expression analyzer (400) returns the logical expression structured in the binary tree to the search screen (200). Any format can be used, but JSON is used as in the fourth embodiment. FIG. 17 shows an example of a JSON expression of a logical expression in which a field can be specified.

  The search screen (200) displays a logical expression structured on the returned binary tree on the screen. At this time, the field name is also displayed by being separated by a delimiter before the search keyword.

  The search screen (200) obtains a logical expression shaped from a logical expression structured in a binary tree, and asynchronously transmits the obtained logical expression to the number search device (500). The number search device (500) performs a search using the transmitted logical expression and returns the number of cases. The search screen (200) displays the number of returned items on the whole logical expression label (707), the term display label (714), and the partial expression display label (717).

  The processing from the analysis of the logical expression to the display of the number of cases is similarly performed when the partial expression character string and the partial expression tree are edited. In addition, when there are changes in a plurality of sub-expression character strings and sub-expression trees, processing is performed asynchronously and in parallel for each changed portion.

  Note that it is possible to configure the system by combining some or all of the above-described embodiments. In addition, although the embodiment in the web system is mainly described, it is also possible to implement it by an applet by Java, a native application by C language or the like. Furthermore, it is possible to apply not only HTTP but also various protocols as communication protocols.

Image of search screen Image of search screen displaying formula creation assistance dialog Image diagram of the search screen displaying the logical expression creation assistance dialog immediately after selecting AND Image of the formula creation assistant dialog with the tree closed Image diagram of the dialog box for creating a formula when the formula can be edited Conceptual diagram of formula creation auxiliary dialog with added conditions Block diagram of components necessary to implement the present invention Conceptual diagram of a logical expression structured in a binary tree Example of a logical expression structured in a binary tree expressed in JSON Sequence from entering the formula in the text box to displaying the number of records Image of search screen with the Add Formula Save button Image diagram of the formula creation auxiliary dialog with the button to insert a saved formula Image diagram of formula creation auxiliary dialog showing saved formula list display pane Image of logical formula creation support dialog with a partial formula save button Image of the formula creation auxiliary dialog when the formula is structured into an N-ary tree Conceptual diagram of a logical expression structured in an N-ary tree Example of a logical expression structured in a binary tree expressed in JSON Image diagram of the formula creation auxiliary dialog that allows field names to be specified for terms Example of JSON representation of logical expression that allows field specification Flow chart of processing to convert logical expression to binary tree (first half) Flow chart of processing to convert logical expression to binary tree (second half) Flow chart of processing to convert logical expression to N-ary tree (first half) Flow chart of processing to convert logical expression to N-ary tree (second half)

DESCRIPTION OF SYMBOLS 100 WEB browser 200 Search screen 300 Screen distribution apparatus 400 Logical expression syntax analysis apparatus 500 Number search apparatus 600 Search apparatus 900 Apparatus for storing partial expressions

Claims (8)

A database,
Means for storing a logical expression character string composed of a combination of a term and a partial expression character string obtained by combining terms with logical operators;
Means for dividing the logical expression string as a sub-expression tree composed of a term or a recursive structure of a sub-expression tree obtained by combining terms with logical operators;
Number storage means for storing the number of cases when the partial expression character string is searched in the database;
In the information processing apparatus provided with display means for displaying the partial expression character string, or the partial expression tree, or both of the partial expression character string and the partial expression tree with the number of cases stored in the number storage means,
An information processing apparatus comprising: means for selecting whether to display the partial expression tree together with the partial expression character string, or to display the partial expression tree together with the partial expression character string by the user operation   The information processing apparatus according to claim 1, wherein the display unit displays the partial expression tree as a binary tree.   The information processing apparatus according to claim 1, wherein the display unit displays the partial expression tree as an N-ary tree.   4. The information processing according to claim 1, further comprising means for storing the partial expression character string displayed by the display means as a history, wherein the display means further acquires and displays the history from the means for saving as the history. apparatus   5. The information processing apparatus according to claim 1, wherein a user can edit the partial expression character string displayed by the display means.   6. The information processing apparatus according to claim 1, wherein a user can edit the partial expression tree displayed by the display means. An editing program that is executed in an information processing apparatus having a database and edits a logical expression by a user operation,
The program is
Storing a logical expression character string composed of a combination of a term and a subexpression character string obtained by combining terms with logical operators;
Splitting the logical expression string as a subexpression tree consisting of a term or a recursive structure of subexpression trees combining terms with logical operators;
Storing the number of cases when the partial expression character string is searched in the database;
Displaying the sub-expression string, or the sub-expression tree, or both the sub-expression string and the sub-expression tree, with the number of cases stored in the number storage means;
An editing program comprising a step for selecting whether to display a subexpression tree together with a subexpression character string, or to display a subexpression tree together with a subexpression character string by leaving a subexpression character string by a user operation A logical expression editing method for editing a logical expression by a user's operation in an information processing apparatus having a database,
The logical expression editing method is:
Storing a logical expression character string composed of a combination of a term and a subexpression character string obtained by combining terms with logical operators;
Splitting the logical expression string as a subexpression tree consisting of a term or a recursive structure of subexpression trees combining terms with logical operators;
Storing the number of cases when the partial expression character string is searched in the database;
Displaying the sub-expression string, or the sub-expression tree, or both the sub-expression string and the sub-expression tree, with the number of cases stored in the number storage means;
A logical expression editing method comprising a step of selecting whether to display a subexpression tree together with a subexpression character string, or to display a subexpression tree together with a subexpression character string by leaving a subexpression character string by a user operation.

Images