JPH11259512A - Data retrieval system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data retrieval system capable of protecting retrieval conditions and the location of a retrieving person as confidential information leaked to a third party by data base tracing and line tracing, etc., of a conventional data retrieval server. SOLUTION: A condition concealing part 103 conceals retrieval conditions based on the contents of files 108 and 109 against a basic retrieval language generated in a basic retrieval language generation part from retrieval data inputted form a user terminal equipment 112 or against a basic language divided by a retrieval language division part 104, or imparts additional conditions by an additional condition/ retrieval language generation part 105 and requests a data access part 106 to access the data retrieval server. The data access part 106 retrieves data directly or through a substituting server 130 through the retrieval language for which the conditions are concealed in such a manner. Retrieved results are narrowed down by a data editing part 107, unnecessary retrieved results are eliminated and are sent to the user terminal equipment 112.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search system capable of protecting search conditions as confidential information from a third party by hiding the search conditions in a data search device, and more particularly to an external mainframe or an external mainframe. In a data search system for searching data of a data search server such as a workstation from a data search device such as a client computer connected by a communication line such as a LAN or the Internet, a data search device uses search conditions and the location of a searcher as confidential information. And a data retrieval system that can be concealed and protected from third parties.

[0002]

2. Description of the Related Art Conventionally, data search in a data search system such as a database search system or a document management system is executed by a user designating search conditions for narrowing down data and issuing a search request. Search condition is S
It is described in a search language such as QL, and the data is narrowed down by the data search server. On the other hand, the data retrieval server acquires trace information such as a database trace or a line trace performed by a user for the purpose of recovery from a failure, acquisition of statistical information, and the like.

[0003]

The prior art described above is
The problem that personal privacy, search conditions that should be confidential company information, and the location of the searcher were leaked to a third party such as a system administrator due to trace information such as a database trace or a line trace. Have a point.

An object of the present invention is to solve the above-mentioned problems of the prior art, and to provide a data search system capable of concealing search conditions in a data search device and protecting confidential information from a third party.

[0005]

SUMMARY OF THE INVENTION According to the present invention, there is provided a data search apparatus wherein a data search device and a data search server are connected via a communication line, and the data search device searches for data in the data search server. In the system, the search is performed by concealing or obscuring all or part of the search conditions input to the data search device as confidential information in the data search device, and the search result is narrowed down by the data search device.

It is another object of the present invention to provide a data search apparatus in which the input search conditions are deleted from all the input search conditions by deleting the search conditions to be concealed in advance. To hide or blur search conditions by adding extra search conditions to the input search conditions, or by splitting the input search conditions into multiple search languages This is achieved by:

Further, the object is to provide a proxy server between the data search device and the data search server, to have the proxy server access the data search server, and to hide the location of the searcher. This is achieved by:

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, an embodiment of a data search system according to the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of a data search system according to an embodiment of the present invention. FIG. 2 is a flowchart for explaining the processing operation of a condition concealing unit. FIG. 4 is a flowchart for explaining the details of the creation process; FIG. 4 is a diagram for explaining the configuration of a security condition table created by reading the security condition file;
FIG. 5 is a diagram for explaining the configuration of a similar condition table created by reading a similar condition file, and FIG. 6 is a diagram for explaining a specific example of data search performed using the embodiment of the present invention. FIG. 7 is a diagram for explaining the configuration of an additional condition table created by reading the additional condition file. In FIG. 1, 100 is a data search device, 101 is a GUI analysis unit, 102 is a basic search language generation unit, 103 is a condition hiding unit, 104 is a search language division unit, 105 is an additional condition / search language generation unit, and 106 is data An access unit, 107 is a data editing unit, 108 is a confidential condition file, 109 is a similar condition file, 110 is an additional condition file, 111 is a data storage file, 112 is a user terminal device, 120 is a communication line, 130 is a proxy server, and 140 Is a data search server.

As shown in FIG. 1, in a data search system according to an embodiment of the present invention, a data search device 100 such as a client computer and a data search server 140 having a database or a document management system are composed of L
It is configured by being connected by a communication line 120 such as an AN and the Internet. Also, a plurality of proxy servers 130 that perform access requests from the data search device 100 on behalf of the data search server 140 may be connected to the same network such as a LAN and the Internet.

The data search device 100 includes a GUI analysis unit 1
01, the basic search language generation unit 102, and the condition hiding unit 10
3, a search language dividing unit 104, an additional condition / search language generating unit 105, a data access unit 106, and a data editing unit 107. The data search device 100 is connected with a confidential condition file 108, a similar condition file 109, an additional condition file 110, and a data storage file 111.
2 are connected.

In the data search apparatus 100 configured as described above, the GUI analysis unit 101 analyzes search conditions specified by the user for data search from the user terminal device 112, and uses the analysis result as a basic search language. Generator 1
02 is notified. The basic search language generation unit 102 generates a basic search language from the received analysis result. Normally, the data search device 100 accesses data at this stage. In the embodiment of the present invention, the search condition is deleted / divided before the data search, and the search condition is concealed and blurred. .

For this reason, when there are a plurality of proxy servers 130 or when the user specifies to divide the search language, control is first passed to the search language dividing unit 104. The search language dividing unit 104 divides a condition for each OR logical operator in the search condition, and recreates a search language for each of the divided conditions. When the search language does not need to be divided, or after the search language is divided by the search language dividing unit 104, the control is passed to the condition hiding unit 103.

The condition concealing unit 103 includes the basic search language from the basic search language generation unit 102 or the divided search language from the search language division unit 104 and the secret search condition in the confidential condition file 108 and the similar condition file 109. A search condition expression in which the original condition is hidden by the confidential condition determination rule created based on the information is created, and the condition expression for the search is passed to the data access unit 106.

As a result, control is passed to the data access unit 106, and the data access unit 106
0 or directly accesses the data search server 140. The search data obtained as a result of the search by the data search server 140 has been searched based on a search condition formula in which the original condition is hidden, and includes unnecessary search data. Upon receiving such search data, the data access unit 106 of the data search device 100 updates the search result at the time when one access is completed.
Hand over to 07. The data editing unit 107 performs editing for narrowing down data based on the original conditional expression created by the basic search language generation unit 102, and outputs a target search result to the user terminal device 1.
Hand over to 12.

The outline of the operation of the system shown in FIG. 1 has been described above. Next, the details of the processing operation of the condition concealing unit 103 in the data search device 100 will be described with reference to the flowchart shown in FIG. The operation of each of the following functional units will be described in detail.

(1) The condition hiding unit 103 divides the conditional expression in the search language passed from the basic language generation unit 102 or the search language division unit 104 for each OR logical operator. If the conditional expression has already been divided for each OR logical operator by the search language dividing unit 104, this processing is not performed (step 201).

(2) Next, a security condition is checked for each of the divided conditional expressions. Therefore, it is checked whether the divided condition is a single condition. For a single condition,
Since this condition is always necessary, the condition is left as it is, and the process returns from step 208 to step 202 to perform the processing of the next conditional expression (step 202).

(3) Next, whether or not there is a confidential condition specified by the user in the conditional expression is checked using the contents of the confidential condition file 108. Therefore, confidentiality condition file 1
08 is read to create a confidential condition table. As shown in FIG. 4, this confidential condition table includes a table name / document name area 401 and a column name / constant area 402, and specifies a column or a constant to be hidden for each table or document. If the condition specified in the confidential condition table exists in the conditional expression, the corresponding condition is deleted from the conditional expression. The confidential condition in the confidential condition file 108 is as follows.
Search conditions that should be hidden in the data search device as a system or search conditions that should be hidden in the user or the data search device are registered in advance as confidential conditions (step 203).

(4) As a result of deleting the condition in step 203, it is checked whether or not only one condition remains in the conditional expression. If only one condition remains, this condition is a necessary condition, so the concealment process ends, and the process returns from step 208 to step 202 to perform the process of the next conditional expression (step 204).

(5) Next, it is checked whether or not there is a condition that can be converted from the similar condition file 109 into a similar word or a broader term. Therefore, the similar condition file 109 is read and a similar condition table is created. As shown in FIG. 5, the similar condition table includes a table name area 501 in which a target table name and a document name are specified, a lower concept word area 504.
And a broader concept word area 506, to which a length part LLA 503 and an LLB 505 are respectively added. Further, when the target data is a column such as a database, a column name area 502 is added. ing. Then, a condition that can be converted is searched for from the constants specified in the table name area 501, the column name area 502, and the lower concept word area 504, and if there is, the constant of the condition is replaced with a higher concept word and other conditions are deleted. Then, the conditional expression is re-created (step 205).

(6) It is checked whether or not the conditional expression re-created in step 205 has been converted into a broader concept word. If the conditional expression has been converted into a broader concept word, the concealment process is terminated, and step 208 Then, the process returns to step 202 to perform the processing of the next conditional expression (step 206).

(7) If the conditional expression re-created in step 205 is not converted to a broader term in the check in step 206, the condition to be deleted is determined based on the confidential condition determining rule, and the conditional expression is re-created (Step 20
7).

(8) Since the concealment processing of one conditional expression is completed by the above-described processing, the processing of the conditional expressions for all the OR operators is returned to step 202, and is sequentially performed (step 208).

Next, the details of the process of re-creating the conditional expression based on the confidential condition determination rule in step 207 described above will be described with reference to the flow shown in FIG.

(1) First, an AND operator is searched for in a conditional expression, and it is checked whether or not there is an AND operator (steps 301 and 302).

(2) In the check of step 302,
If it is determined that there is a D operator, a process of deleting all the remaining one of the conditions except for one condition for each AND operator is started. In the embodiment of the present invention, rules for determining conditions to be left in this processing are determined in consideration of the efficiency of data search, and the priority of the conditions to be left is determined by an index condition included in each condition divided for each AND operator. , =, <,>. When concealment is prioritized, the priority may be reversed. Note that these index conditions are registered in the system in advance, and may include indexes other than =, <,>. Then, first, an index condition in the conditional expression is searched, and it is checked whether or not there is a condition specified in the index sequence (steps 303 and 304).

(3) If the condition specified in the index column exists in the check in step 304, the condition of the index column is set as a condition to remain, and if no condition exists in the index column, the priority of the condition to remain is set. Are determined as =, <,>, and the conditions to be left are determined (steps 306 and 30).
5).

(4) After determining the conditions to be left in steps 306 and 305, conditions other than the conditions to be left are deleted and a conditional expression is recreated (step 307).

(5) If it is determined in step 302 that there is no AND operator in the conditional expression, the condition is
It is checked whether it is an IKE predicate or not, and if it is a IKE predicate, the pattern character string is cut in half and the conditional expression is recreated. For example, if the pattern string is “Chuo-ku, Osaka”
, The pattern character string is set to “Osaka City”, and a character string containing “Osaka City” is searched (Step 3).
08, 309).

(6) If the condition at step 308 is not a LIKE predicate, the condition is BETWEEN.
It is checked whether the predicate is a predicate. If the predicate is not a BETWEEN predicate, the process is terminated. If the predicate is a BETWEEN predicate, the condition is converted into a condition <= and a conditional expression is re-created (steps 310 and 311).

The search language divided or re-created as described above is collectively passed to the data access unit 106. The data access unit 106 checks the connection status of the proxy server 130 from the server definition information,
Is not connected, the direct data search server 140
To access. When the proxy server 130 is connected, the divided search languages are assigned to one or more proxy servers, and access to the data search server 140 is requested.

The proxy server 130 accesses the data search server 140 on behalf of the data search device, and returns search data obtained as a result of the search to the data search device 100. The data access unit 106 passes the search result to the data editing unit 107 when one access is completed. When the search language is divided into a plurality of parts, the data editing unit 107 temporarily stores the search data in the data storage file 11.
When the processing of all divided search languages is completed, the stored data is taken out, and the data that combines the merged and duplicated data into one is edited.

In other words, the data editing unit 107 allows the basic search language generation unit 102 to search for search data that includes unnecessary search data because the search is performed based on a search condition expression in which the original condition is hidden. An edit for narrowing down data based on the created original conditional expression is performed, and a target search result is passed to the user terminal device 112.

Next, with reference to FIG. 6, a specific search example of data search performed using the embodiment of the present invention will be described.

It is assumed that the search content requested by the user is as shown in 601. From such search contents, the basic search language generation unit 102 generates a basic search language. As shown in 602, the basic search language indicates a conditional expression in the search language. In the illustrated example, it is assumed that there are a plurality of proxy servers 130,
The search language is passed to the search language division unit 104, and is divided into two conditions 603 and 604 for each OR logical operator.

Thereafter, the condition concealing unit 103 performs condition concealment processing for each of the divided conditional expressions. First, concealment processing of a conditional expression shown as 603 is performed. In this case, in the table shown in FIG. 4, since the column of the annual income is specified as the confidential condition in the confidential condition file, the column condition of the annual income is deleted from the conditional expression shown as 603, and the conditional expression is shown as 605. Next, in the table shown in FIG. 5, since the broader term "Tokyo" of "Minato-ku" in the address column is specified in the similar condition file, "Minato-ku" is converted to "Tokyo" and the remaining Delete the condition of As a result, the conditional expression shown as 603 is converted into a conditional expression shown as 606.

The data search server 140 is given a conditional expression shown as 606, whereby a search is performed, and the data search server 140 searches for a character string containing "Tokyo". Data search server 10
4. If "Tokyo" which is a broader term of "Minato-ku" is defined in 4, search for character strings containing "Minato-ku" even if there is no "Tokyo" character string in the data by thesaurus search can do.

Similarly, the conditional expression shown as 604 is deleted from the column condition of the annual income, and becomes a conditional expression shown as 607.
As a result of this deletion, since only one condition remains, the concealment process is terminated, and the conditional expression shown as 608 is the final conditional expression. Thereafter, the two divided and re-created conditional expressions are passed to the data access unit, distributed to the two proxy servers 1 and 2 and the data search server 14
Used to access 0.

As described above, according to the embodiment of the present invention, the database trace of the data search server 140,
On the traces such as the line trace, the history that “the proxy server 1 searched the member table under the condition that the address is in Tokyo” and “the proxy server 2 searched the member table under the condition that the gender was female” Only history that remains,
The original searcher and the intention of the searcher can be unclear.

In the above-described embodiment of the present invention, the search condition is deleted, converted, or the search language is divided to conceal the search condition or blur the intention of the search.
According to the present invention, an unnecessary condition or a search language can be added to the original search condition, so that the intention of the search is blurred.

In this case, before the control is passed from the condition concealing unit 103 to the data access unit 106 shown in FIG. The additional condition / search language generating unit 105 stores the additional condition file 11
By reading 0, an additional condition table as shown in FIG. 7 is created. The additional condition table includes a table name area 701 in which a target table name, a document name, and the like are designated, and a column name area 702, an operator area 703, and a constant area 704 when there is a column as a component of the target data. Is done. The additional condition / search language generating unit 105 generates an unnecessary condition based on the contents of the table.

The data access unit 106 generates a search language to which an unnecessary condition created by the additional condition / search language generation unit 105 is added, and sends the search language via the proxy server 130 or directly to the data search server 140 To access the device to retrieve data. When the search language is added, the data access unit 106 discards the search result corresponding to the added condition from the search result, and the data editing unit 107 narrows down the received search result in the same manner as described above. .

As described above, according to the embodiment of the present invention, a part or all of the conditional expression for data search is hidden in the data search device, so that the search condition is hidden from a third party, and the search condition is hidden. The intention can be blurred. Since the search conditions to be hidden are automatically determined by the data search device, the user can search for data without being conscious of the search contents. In addition, it is possible to hide any search condition or to replace any search condition with a broader term, and the user can specify a search condition that the third party does not particularly want to know.

According to the embodiment of the present invention, it is possible to conceal the location of the searcher by performing the data access by the proxy server. By searching for data or generating unnecessary conditions and a search language to search data, the intention of the search can be blurred.

[0046]

As described above, according to the present invention, it is possible to protect search conditions and the location of a searcher as confidential information which have been leaked to a third party due to a database trace and a line trace of a data search server in the past. Becomes

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a data search system according to an embodiment of the present invention.

FIG. 2 is a flowchart illustrating a processing operation of a condition hiding unit.

FIG. 3 is a flowchart illustrating details of a process of re-creating a conditional expression based on a confidential condition determination rule.

FIG. 4 is a diagram illustrating a configuration of a confidential condition table created by reading a confidential condition file.

FIG. 5 is a diagram illustrating a configuration of a similar condition table created by reading a similar condition file.

FIG. 6 is a diagram illustrating a specific search example of data search performed using the embodiment of the present invention.

FIG. 7 is a diagram illustrating a configuration of an additional condition table created by reading an additional condition file.

[Explanation of symbols]

 REFERENCE SIGNS LIST 100 data retrieval device 101 GUI analysis unit 102 basic search language generation unit 103 condition hiding unit 104 search language division unit 105 additional condition / search language generation unit 106 data access unit 107 data editing unit 108 confidential condition file 109 similar condition file 110 additional condition File 111 Data storage file 112 User terminal device 120 Communication line 130 Proxy server 140 Data search server

──────────────────────────────────────────────────の Continued on the front page (51) Int.Cl. ⁶ Identification code FIG06F 15/40 310F 320Z

Claims (5)

[Claims] In a data search system in which a data search device and a data search server are connected via a communication line and the data search device searches for data in the data search server, a search condition input to the data search device is determined. A data search system characterized in that all or a part of the data is concealed or unclear as confidential information in a data search device to perform a search, and the search result is narrowed down by the data search device. 2. The data search apparatus according to claim 1, wherein the search condition is concealed or unclear by deleting a pre-registered search condition to be concealed from all input search conditions. Data retrieval system described. 3. The data search device according to claim 1, wherein the input search condition is replaced with a similar word or a broader term, or an extra search condition is added to the input search condition. 2. The data search system according to claim 1, wherein the condition is hidden or unclear. 4. The data search device divides an input search condition into a plurality of search languages,
2. The data search system according to claim 1, wherein the input search condition is concealed or unclear. 5. A proxy server is provided between the data search device and the data search server, and access to the data search server is performed by the proxy server, thereby hiding the location of the searcher. The data search system according to claim 1.