JPH03230273A - Holding system for retrieval condition formula - Google Patents

Abstract

PURPOSE:To improve the storing space efficiency of a data base and the execution efficiency of a retrieval condition formula by merging the retrieval condition formulas, forming one retrieval condition formula, further, rearranging the conditions in the order of the condition equipped with a little records to satisfy the conditions of respective elements in the retrieval condition formula, and holding the retrieval condition formula in the data base. CONSTITUTION:When the final retrieval condition formula is held in the end step of trial retrieval according to the instruction of a user, a retrieval condition formula merge means 6 rearranges the retrieval condition formulas extracted by a retrieval condition formula extracting means 5 in the order of a little records to satisfy the conditions and merges the finally effective retrieval condition formulas to one retrieval condition formula. A retrieval condition formula storing means 8 stores the retrieval condition formula, for which the finally effective retrieval condition formulas are merged to one by a retrieval condition formula merge means 6, into a data base 9. The data base 9 stores information as a retrieval object and the retrieval condition formula. Thus, the storing space efficiency of the data base and the execution efficiency of the retrieval condition formula can be improved.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a method for retaining search condition expressions, and in particular when searching for target information while changing search condition expressions through trial and error. The present invention relates to a method for retaining search condition expressions that retains valid search condition expressions and finally determined search condition expressions as historical information for later use.

[Prior Art] A conventional search condition expression retention method retains all search condition expressions executed through trial and error as they are.

[Problems to be Solved by the Invention] In the conventional method of retaining search condition expressions described above, search condition expressions that have been performed through trial and error are re-executed, resulting in poor access efficiency to the database and the creation of unnecessary search conditions. The disadvantage is that the expressions waste database storage space.

[Means for Solving the Problems] The search condition expression retention method of the present invention stores target information through trial and error while repeatedly adding and changing conditions to the search condition expression initially specified at the time of information retrieval. In the search condition expression retention method, which stores the search condition expression finally determined by searching, data search searches the database using the search condition expression specified by the user and returns information on the search results to the user. a stacking means for stacking pairs of the number of records satisfying each element of the search condition expression and the search condition expression specified by the user; a search condition expression extracting means for extracting from the stack a pair of a valid search condition expression that has led to the search condition expression and the number of records satisfying the search condition expression; and a search extracted by the search condition expression extraction means. a search condition expression merging means for arranging condition expressions in descending order of the number of records that satisfy the conditions and finally merging the valid search condition expressions into one search condition expression; and a search merged by the search condition expression merging means. The present invention is characterized by comprising a search condition expression storage means for storing and retaining the condition expression in a database.

[Example] Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention. This method of retaining search condition expressions is based on the user terminal 1. Input control means 2. Output means 3. Stacking means 4. Search condition expression extraction means 5. Search condition expression merging means 6. Data search means 7. Search condition expression storage means 8. It consists of a database 9.

The user terminal 1 inputs instructions from the user and displays information on search results.

The input control means 2 reads the search condition expression specified by the user and the user's instructions from the user terminal 1 and controls the search condition.

The output means 3 outputs the search result information to the user terminal 1 for display and returns it to the user.

The stacking means 4 stacks the number of records that satisfy the conditions of each element of the search condition expression and search condition expression specified by the user in the trial-and-error search stage in the specified order.

When the search condition expression extraction means 5 retains the final search condition expression according to the user's instructions at the end of the trial-and-error search, the search condition expression extraction means 5 satisfies the effective search condition expression and conditions that led to the current search condition expression. Extract pairs with the number of records from the stack in order.

When the search condition expression merging means 6 retains the final search condition expression according to the user's instruction at the end of the trial-and-error search, the search condition expression merging means 6 converts the search condition expression extracted by the search condition expression extraction means 5 into a search condition expression that satisfies the condition. The valid search condition expressions are finally merged into one search condition expression.

The data search means 7 accesses the database 9 by executing a search condition expression specified by the user from the user terminal 1.
Information on the search results is output to the user terminal 1 via the output means 3 and displayed, and returned to the user.

The search condition expression storage means 8 stores in the database 9 the search condition expression in which the effective search condition expressions are finally merged into one by the search condition expression merging means 6.

The database 9 stores information to be searched and search condition expressions.

Referring to FIG. 2, the operation of the search condition expression retention method of this embodiment will be described.

When this search condition expression holding method is activated and the user inputs an instruction for the current search condition expression from the user terminal 1, the input control means 2 reads the instruction from the user and (
Step 21), and it is determined whether the search is a trial-and-error search (Step 22).

If the instruction from the user is to continue the trial-and-error search, the data search means 7 searches the database according to the current search condition formula (step 23), and outputs the search results to the output means 3.
It is returned to the user by outputting and displaying it on the user terminal 1 via the user terminal 1 (step 24).

Next, the stack means 4 stacks the number of records that satisfy the condition search expression just executed and each element of the search condition expression (step 25).

If the instruction from the user is to end a trial-and-error search,
Next, it is determined whether or not it is necessary to retain the final search condition expression (step 26), and if it is necessary to retain it, the input control means 2
Then, the search condition expression extracting means 5 extracts from the stack the valid search condition expressions that led to the current search condition expression (step 27).

Here, the process of extracting a valid search condition expression from the stack by the search condition expression extraction means 5 will be explained with reference to FIG.

In FIG. 3, 001 to 004 are numbers given to each search condition expression, and these numbers can be specified in the search condition expression. For example, the search condition expression indicated by 002 is equivalent to (affiliation=“Kaihara”) AND (age≧25).

Assuming that the current search condition expression is the search condition expression indicated by number 004, the search condition expression extraction means 5 extracts the number 003 of the valid search condition expression that appears within the specified search condition expression 004.
Find out. Next, the search condition expression extracting means 5 finds the valid search condition expression number 001 in the valid search condition expressions 〇〇3. Since there is no number indicating a valid search condition expression in the valid search condition expression OO1, the search condition expression extraction means 5 extracts the number 00.
4. Extract from the stack the number of records that satisfy the conditions of the effective search condition expression and each element of the effective search condition expression indicated by 003 and 001.

The search condition expression merging means 6 merges the last valid search condition expressions by first replacing the numbers in each last valid search condition expression with the actual last valid search condition expressions. For example, search condition expression 004.00 shown in FIG.
3 and 001 are the final valid search condition expressions at the end of the trial-and-error search, the search condition expression merging means 6 replaces number 003 in the final valid search condition expression 〇〇4 with the final valid search condition expression Replace the valid search condition expression 0 expression %) ) with the number O in this final valid search condition expression.
Replace O1 with the final valid search condition expression affiliation=“Kaihara” which is equivalent to number 001. As a result, the final valid search condition expression 004.
003 and 001 are one search condition expression (Affiliation = “Kaihara”) AND (Age ≧ 30) AND (Gender = “Male”)
) AND (salary ≥ 300,000). Next, the conditions for each element of the search condition expression are as follows: Affiliation=“Kaihara”9 Age≧30. Gender = “Male” Salary ≧3
The conditions are rearranged in descending order of the number of records that satisfy 00.000.

The number of records that satisfy the conditions of each element in this embodiment is as follows.

Affiliation = “Kaihara” ... 500 Age ≧ 30
...1.000 Gender = "Male" ...2
．． 000 Salary≧300,000...800 The number that satisfies the conditions of each of these elements is obtained at the stage of extracting valid search condition expressions from the stack. As a result, the merged search condition expressions are finally rearranged as follows.

(Affiliation = “Kaihara”) AND (Salary≧300,000) AND (Age≧30) AND (Gender = “Male”)
It is well known that the AND operation of a plurality of conditions is most efficient when executed in the order of decreasing number of conditions that satisfy the conditions.

Next, the final search condition expression is stored in the database (stack 29), and finally the stack is discarded (step 30).

[Effects of the Invention] As explained above, the present invention, in a trial-and-error search, merges valid search condition expressions finally determined at the end of the trial-and-error search into one search condition expression, Furthermore, by rearranging the conditions for each element of the search condition expression in order of decreasing number of records and storing the search condition expression in the database, the storage space efficiency of the database and the execution efficiency of the search condition expression can be improved. This has the effect of making improvements possible.

Brief Description of the Drawings Figure 1 is a block diagram of an embodiment of the present invention, Figure 2 is a flowchart showing the operation of the embodiment, and Figure 3 is a diagram illustrating a search condition expression in the embodiment. It is.

1... User terminal, 2... Input control means, 3...
Output means, 4... Stack means, 5... Search condition expression extraction means, 6... Search condition expression merging means, 7... Data search means, 8... Search condition expression storage means, 9.・・・
database.

Claims (1)

[Claims] The search condition expression finally determined by repeatedly adding and changing conditions to the search condition expression specified at the time of information retrieval and searching for the target information through trial and error is retained. A data retrieval means that searches a database according to a search condition expression specified by a user and returns information on the search results to the user, and a data retrieval means that satisfies the conditions of each element of the search condition expression. A stacking means for stacking the number of records and a search condition expression specified by the user in pairs, and a stacking means for stacking the number of records and the search condition expression specified by the user, and the effective search condition expression that reached the current search condition expression at the end of the trial-and-error search according to the user's instructions, and the relevant search condition expression. a search condition expression extracting means for extracting pairs of records satisfying the search condition expression from the stack; and search condition expressions extracted by the search condition expression extraction means in descending order of the number of records satisfying the condition. A search condition expression merging means that arranges and finally merges valid search condition expressions into one search condition expression, and a search condition expression storage that stores and retains the search condition expressions merged by this search condition expression merging means in a database. A method for holding a search condition expression, comprising: means.