JP2004227140A - Search linkage program, search system, and search method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To ensure the independence of a search system to perform a further precise and usable search. <P>SOLUTION: This program makes a computer execute an index management function 30 which manages index information on pieces of location information 61 to 6n, 81 to 8n on a search object recorded on a recording means 23; and a search matching function 31 which decides whether or not an inputted search request matches index information managed by the index management function 30, if decided that there is a match, provides instructions for the execution of searching the recording means 23 to a search means 12 on the basis of the search request, and if decided that there is no match, provides instructions for transferring the search request to the other system to a linkage means 29 which controls communication conducted with the other system. <P>COPYRIGHT: (C)2004,JPO&NCIPI

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a search cooperative program, a search system, and a search method for searching for information or service location information on a network.
[0002]
[Prior art]
Collecting, integrating, and organizing ubiquitous information makes it easier to use it. For example, by collecting ubiquitous telephone numbers and their registrants and creating a telephone directory, the relationship between telephone numbers and registrants can be easily checked.
[0003]
In computer systems as well, an architecture for collecting and managing information and services ubiquitous on a network (hereinafter, referred to as a "net arc information management architecture") is being studied.
[0004]
The service refers to an application that provides information that can be used by a computer or a human or executes a program process.
[0005]
A search system is a specific example of the network information management architecture.
[0006]
The search system collects and manages URLs (Uniform Resource Locators) of Web pages or Web sites. In a search system, Web pages or Web sites on a network are collected and categorized. The Web page or Web site administrator applies to the search system administrator for registration of his or her Web page or Web site. The user uses the search system to find the Web page or Web site URL that he or she wants. When the user requests access to the found URL, the user's browser accesses a Web page or a Web site indicated by the URL.
[0007]
Another specific example of the network information management architecture is UDDI (Universal Description, Discovery and Integration) in a service.
[0008]
UDDI is a mechanism for managing services in an integrated manner. In the UDDI, a service summary and location information are registered. The service provider registers a service outline and location information in UDDI. The user (including the computer) uses the search function of UDDI to find the location information of the service desired by the user. The user uses a service desired by himself / herself by accessing based on the found location information.
[0009]
FIG. 7 is a block diagram showing an example of an existing centralized management type network information management architecture.
[0010]
The central system 1 realizes functions as a search system and a UDDI. The information provider 2 or the service provider 3 uses the registration unit 4 to store the location information 61 to 6n of the information (information entity) 51 to 5n or the location information 81 to 8n of the service (service entity) 71 to 7n on the recording device 9. Register with. For example, the location information is represented by a URL.
[0011]
The information user 10 or the service user 11 inputs a search request to the search unit 12, and receives the location of the information requested by the user or the location of the service as a search result.
[0012]
On the other hand, a distributed network information management architecture has also been proposed. Regarding the distributed network information management architecture, three types are mainly studied.
[0013]
The first distributed network information management architecture is an architecture using a distributed database.
[0014]
FIG. 8 is a block diagram showing a first example of an architecture using a distributed database.
[0015]
Each of the search systems 131 to 13n includes a registration unit 4, a search unit 12, and a distributed database 14.
[0016]
As shown in FIG. 8, when a distributed database 14 is provided in a plurality of search systems 131 to 13n, a cluster server 15 for managing the distributed database 14 provided in the plurality of search systems 131 to 13n is required. .
[0017]
FIG. 9 is a block diagram showing a second example of the architecture using the distributed database 14.
[0018]
9, a plurality of search systems 161 to 16n are provided with a location management unit 17 instead of the cluster server 15 of FIG. The location management units 17 of the search systems 161 to 16n operate in cooperation with each other, and realize the same functions as those of the cluster server 15.
[0019]
In the architecture using the distributed database 14 as described above, the location information is distributed and arranged in separate search systems, thereby reducing the load and cost of each search system (for example, see Patent Documents 1 to 3).
[0020]
The second distributed network information management architecture is a Peer to Peer (hereinafter, referred to as “P2P”) type architecture.
[0021]
FIG. 10 is a block diagram illustrating an example of a P2P type architecture.
[0022]
In this P2P type architecture, search systems 181 to 18n called servants that realize both functions of a client and a server cooperate and dynamically cooperate to search for location information. For this cooperation, each of the search systems 181 to 18n includes a cooperation unit 19.
[0023]
Each of the search systems 181 to 18n includes a registration unit 4 for registering location information, a search unit 12 for searching for location information matching a search request from location information, and outputting a search request to another search system to perform another search. A linking unit 19 is provided for inputting a search result from the system and outputting the result to the original search system.
[0024]
As a result, there is no system for centralized management, and system load distribution is realized. When a P2P type architecture is used, it is not necessary to know the entire servant in advance because another servant is dynamically discovered and cooperated.
[0025]
The third distributed network information management architecture is an architecture using agents.
[0026]
FIG. 11 is a block diagram illustrating an example of an architecture using an agent.
[0027]
Each of the search systems 201 to 20n includes a recording device 23, a registration unit 4, a search unit 12, a cooperation unit 19, and a pre-registered information management unit 21.
[0028]
When an architecture using an agent is used, each of the search systems 201 to 20n notifies pre-registered information indicating what kind of location information the user has in advance to a nearby search system. For this notification, each of the search systems 201 to 20n includes a pre-registered information management unit 21. This makes it possible to determine which system has the target location information when searching for information or services (for example, see Patent Document 4).
[0029]
[Patent Document 1]
JP-A-8-22406
[0030]
[Patent Document 2]
JP-A-8-286960
[0031]
[Patent Document 3]
Japanese Patent Application No. 2000-20542
[0032]
[Patent Document 4]
JP-A-11-195048
[0033]
[Problems to be solved by the invention]
The central management type network information management architecture shown in FIG. 7 has the following three problems.
[0034]
First, there is a problem that the maintenance cost of the central system 1 increases. That is, it is not easy for the administrator of the central system 1 to maintain a large amount of location information 61 to 6n and 81 to 8n. Further, it is difficult to maintain the freshness of the location information 61 to 6n and 81 to 8n.
[0035]
Second, the load on the central system 1 is increased in terms of hardware and software. Further, when a failure occurs in the central system 1, all searches cannot be executed.
[0036]
Third, since the various types of location information 61 to 6n and 81 to 8n are all integrated into one, the accuracy and usefulness of the search are reduced.
[0037]
Therefore, with the centralized management type network information management architecture, it may be difficult to find the target location information, and it may be difficult to obtain highly useful search results.
[0038]
In the architecture using the distributed database 14 shown in FIG. 8 or 9, it is necessary to provide the cluster server 15 or the location management unit 17.
[0039]
When the cluster server 15 is introduced, since the entire system is managed by one cluster server 15, if a failure occurs in the cluster server 15, all of them cannot be used. Further, maintenance of the cluster server 15 is difficult.
[0040]
When a new distributed database 14 is introduced when the location management unit 17 is used, the information of all the location management units 17 must be updated, which requires much labor.
[0041]
Although the P2P type architecture shown in FIG. 10 is excellent from the viewpoint of information sharing and load distribution, it is not possible to specify a search system that propagates a search request, and the search accuracy and usefulness are low. There is.
[0042]
For example, in the P2P type architecture, when a search for the location information of the information on the company A is requested, a search system having the location information cannot be searched. As described above, when it is not possible to determine at the time of the search where the search system holding the target location information exists, a brute force search or a search with a limited range is executed. Then, there is a high possibility that the target location information will not be searched, and a possibility that irrelevant location information will be searched will increase, which causes a problem in search accuracy and usefulness.
[0043]
In the architecture using the agent shown in FIG. 11, each of the search systems 201 to 20n notifies the nearby search systems of their own location information in advance. As a result, a search system for a search request propagation destination is required, and search accuracy and usefulness are improved.
[0044]
However, an operation of notifying the user's own location information is required in advance, and the management operation is complicated. Further, every time location information is added to a certain search system, it is necessary to notify the update contents to a nearby search system each time, and communication costs and maintenance costs are incurred.
[0045]
As described above, in the architecture using the agent, the independence of the search systems 201 to 20n is reduced, and the search systems 201 to 20n are tightly coupled with each other, which is contrary to the merit of realizing the P2P loose coupling.
[0046]
The present invention has been made in view of the above circumstances, and provides a search cooperation program, a search system, and a search method for performing a search with higher accuracy and usefulness while securing the independence of the search system. Aim.
[0047]
[Means for Solving the Problems]
Specific means taken for realizing the present invention will be described below.
[0048]
A search cooperation program according to a first aspect of the present invention is managed in a computer by an index management function for managing index information on location information of a search target recorded in a recording unit, and an input search request and an index management function. It is determined whether or not the index information matches, and when it is determined that the index information matches, the search unit is instructed to execute a search for the recording unit based on the search request. A search matching function for instructing a linking unit that controls communication performed with another system to transfer data to the system is realized.
[0049]
This eliminates the need for the search systems to notify their location information in advance, thereby ensuring the independence of the search systems. Further, since it is determined whether or not to execute the search based on the index information, the accuracy and usefulness of the search result can be improved.
[0050]
In the search cooperation program according to the first aspect of the present invention, the index management function creates index information for the new location information when the new location information is recorded in the recording unit and records the index information in the recording unit. Is also good.
[0051]
Thereby, the index information is automatically updated, and the management of the index information becomes easy.
[0052]
In addition, by using the search cooperation program of the first invention or the recording medium on which the program is recorded, these functions can be easily provided to a computer, a computer system, a server, and a client not having the above functions. Can be added.
[0053]
A second invention is a search system that searches for location information of a search target recorded in a recording unit based on an input search request, a linking unit that controls communication performed with another system, Recording means for recording location information to be searched; index management means for managing index information on the location information; search means for executing a search on the recording means based on the search request; and management by the search request and index management means. Judge whether or not the index information matches, and instruct the search means to execute the search based on the search request when it is judged that the index information is matched, and transfer the search request when it is judged that the index information is not matched. And a search matching means for instructing the search.
[0054]
According to a third invention, in a retrieval method for retrieving location information of a search target recorded in a first recording means by a computer based on a retrieval request, index information on the location information recorded in the first recording means is provided. Is recorded in the second recording means, and it is determined whether or not the input search request matches the index information recorded in the second recording means. A search is performed on the first recording unit, and if it is determined that the search is not appropriate, the search request is transferred to another system via the network.
[0055]
By applying the second or third invention, there is no need to notify the location information of the search system and another search system in advance, and thus the independence of the system can be ensured. . Further, since it is determined whether or not to execute the search based on the index information, the accuracy and usefulness of the search result can be improved.
[0056]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[0057]
In the following drawings, the same portions as those in FIGS. 7 to 11 are denoted by the same reference numerals, and the description thereof will be omitted or simply described, and only different portions will be described in detail.
[0058]
(First Embodiment)
In the present embodiment, in a P2P type cooperation in which systems that hold information or service location information dynamically cooperate with each other, the system realizes a search with high accuracy and usefulness without impairing independence.
[0059]
FIG. 1 is a block diagram showing an example of the configuration of the search system according to the present embodiment.
[0060]
Hereinafter, the search system 221 will be described, but the same applies to the other search systems 222 to 22n.
[0061]
The search system 221 includes recording devices 23 and 24 and an index recording device 25.
[0062]
The recording device 23 records the location information 61 to 6n of the information 51 to 5n or the location information 81 to 8n of the application (service entity) that provides the service 71 to 7n. In the present embodiment, the location information to be searched is the location information 61 to 6n of the information 51 to 5n or the location information 81 to 8n of the application providing the service 71 to 7n.
[0063]
The index recording device 25 records index information indicating what location information is recorded in the recording device 23. Further, the index information includes credit information for use of the recording device 23.
[0064]
The search system 221 reads out and executes the search program 27 and the search cooperation program 28 recorded on the recording medium 26.
[0065]
When the search program 27 is read and executed by the search system 221, it functions as the registration unit 4, the search unit 12, and the cooperation unit 29.
[0066]
When the search cooperation program 28 is read and executed by the search system 221, it functions as an index management unit 30 and a search matching unit 31.
[0067]
The search system 221 according to the present embodiment realizes the functions of the registration unit 4, the search unit 12, and the link unit 29 by the search program 27, and the functions of the index management unit 30 and the search matching unit 31 by the search link program 28. To achieve.
[0068]
However, each component of the search system 221 shown in FIG. 1 may be realized by hardware.
[0069]
Data handled by each component of the search system 221 is recorded in the recording device 24. Each component can read data recorded in the recording device 24 and write data handled by itself. As the recording device 24, for example, an internal memory, a buffer, or the like is applied.
[0070]
The search unit 12 searches the recording device 23 according to the search request.
[0071]
The registration unit 4 registers the location information 61 to 6n of the information 51 to 5n on the network or the location information 81 to 8n of the services 71 to 7n in the recording device 23.
[0072]
The linking unit 29 executes control for linking the own system with the other search systems 222 to 22n.
[0073]
The index management unit 30 records the index information in the index recording device 25 and reads out the index information recorded in the index recording device 25.
[0074]
The search matching unit 31 determines whether or not the search request matches the index information recorded in the index recording device 25.
[0075]
FIG. 2 is a block diagram illustrating an example of a cooperation state of search systems 221 to 22n according to the present embodiment.
[0076]
The information provider 2 or the service provider 3 registers the location information through the registration unit 4 of the search systems 221 to 22n.
[0077]
The information user 10 or the service user 11 inputs a search request to an arbitrary search system (here, the search system 221). The input search request may be in the same format as the location information or in a different format.
[0078]
The search system 221 that has input the search request cooperates with the other search systems 222 to 22n through the cooperation unit 29 to perform a search. The search matching unit 31 matches the search request with the index information recorded in the index recording device 25, and determines whether the target location information is included in the recording device 23. The search unit 12 performs a search on the recording device 23 when the search matching unit 31 determines that the target location information is included in the recording device.
[0079]
The linking unit 29 propagates the search result in a direction opposite to the propagation direction of the search request, and this propagation is repeated. The arbitrary search system 221 outputs a search result to the information user 10 or the service user 11. The output search result may be in the same format as the location information or in a different format.
[0080]
Hereinafter, processing performed by the search system 221 will be described.
[0081]
FIG. 3 is a flowchart illustrating an example of a registration process by the search system 221 according to the present embodiment.
[0082]
In step S1, the registration unit 4 inputs information or service location information created by the information provider 2 or the service provider 3.
[0083]
In step S2, the registration unit 4 records the input location information in the recording device 23.
[0084]
In step S3, the index management unit 30 records the index information corresponding to the location information recorded in the recording device 23 in the index recording device 25. The recording or updating of the index information in the index recording device 25 may be automatically executed or manually executed in accordance with the recording of the location information in the recording device 23.
[0085]
For example, information indicated by location information or service summary information is automatically created according to a predetermined rule. In addition, a keyword is automatically extracted from the information indicated by the location information or the summary information of the service according to a predetermined rule. The automatically created summary information or automatically extracted keywords are recorded in the index recording device 25 as index information.
[0086]
FIG. 4 is a block diagram illustrating an example of a search process by the search system 221 according to the present embodiment.
[0087]
In step T1, the cooperation unit 29 inputs a search request from the information user 10, the service user 11, or another search system.
[0088]
In step T2, the cooperation unit 29 outputs a search request to the search matching unit 31.
[0089]
In step T3, the search matching unit 31 compares the search request with the index information, and determines whether the content of the search request matches the content of the index information.
[0090]
For example, the search matching unit 31 determines whether the search request matches the index information based on whether the character string included in the certain index information is also included in the search request. Further, for example, the search matching unit 31 determines whether or not the search request matches the index information based on whether or not the credit information included in the certain index information is equal to or higher than the rank indicated by the search request.
[0091]
If it is determined that the search request matches the index information, step T4 is executed, and if it is determined that there is no match, step T7 is executed.
[0092]
In step T4, the search unit 12 searches the recording device 23 based on the search request.
[0093]
In step T5, the search unit 12 records the search result in the recording device 24 (for example, a search result buffer).
[0094]
In step T6, the cooperation unit 29 determines whether the search request satisfies the transfer condition. For example, the search request has a certain value, and the linking unit 29 decreases the value each time the transfer is repeated. Then, the linking unit 29 prohibits the transfer when the value falls below a certain threshold value (for example, zero).
[0095]
When the transfer condition is satisfied, step T7 is executed, and when the transfer condition is not satisfied, step T10 is executed.
[0096]
In step T7, the cooperation unit 29 searches for another search system.
[0097]
In step T8, the linking unit 29 outputs a search request to the linking unit of another search system that has responded.
[0098]
In step T9, the linking unit 29 inputs the search result from another search system that has responded, and records the search result in the recording device 24.
[0099]
In step T10, the link unit 29 outputs the search result recorded in the recording device 24 to the link unit of the search system of the information user, the service user, or the search request source.
[0100]
In the present embodiment described above, it is not necessary for the search systems 221 to 22n to notify other systems of the location information recorded in the recording device 23 in advance.
[0101]
Therefore, the search request and the search result need only be communicated between the search systems 221 to 22n, and the independence of the search systems 221 to 22n can be increased, and the communication cost can be reduced. Further, the maintenance cost of each of the search systems 221 to 22n can be reduced, and the search systems 221 to 22n are loosely coupled, so that the cooperation between the systems becomes easy and the system cooperation network can be expanded.
[0102]
Further, in the present embodiment, index information is recorded in the index recording device 25 of the search systems 221 to 22n, and a search is executed based on a matching result between the index information and the search request. The usefulness of the result is improved. In addition, the information provider 2 and the service provider 3 have more opportunities to use their own information or services, and thus have more opportunities to obtain information provision fees and service fees.
[0103]
Note that each component included in the search system according to the present embodiment may be changed in arrangement as long as the same operation can be realized, or each component may be freely combined, and Elements may be divided freely.
[0104]
Further, the search system according to the present embodiment may be configured by a plurality of computers, and the search program 27 and the search cooperation program 28 may be arranged in a distributed manner on the plurality of computers, and may execute processing while cooperating with each other.
[0105]
The search program 27 and the search cooperation program 28 according to the present embodiment can be applied to a computer by writing to a recording medium such as a magnetic disk (flexible disk, hard disk, etc.), an optical disk (CD-ROM, DVD, etc.), a semiconductor memory, and the like. It is. Further, the search program 27 and the search cooperation program 28 can be transmitted to a communication medium and applied to a computer. The computer realizes the above functions by reading the search program 27 and the search cooperation program 28 recorded on the recording medium and controlling the operations by the search program 27 and the search cooperation program 28.
[0106]
(Second embodiment)
In the present embodiment, a modified example of the first embodiment will be described.
[0107]
FIG. 5 is a block diagram showing an example of a configuration of the search system according to the present embodiment.
[0108]
The search system 32 according to the present embodiment is a local registry of the UDDI specification.
[0109]
The search system 32 includes a local UDDI (Local UDDI) 33, a local UDDI annotation (Local UDDI Annotation) 34, a P2P agent (P2P Agent) 35, and a semantic service match (Semantic Service match) 36.
The local UDDI 33 is a local UDDI. The local UDDI 33 corresponds to the recording device 23, the search unit 12, and the registration unit 4 in FIG.
[0110]
In the local UDDI 33, location information (tModel) 33a to 33c of the Web service is recorded.
[0111]
The local UDDI annotation 34 corresponds to the index information described in the first embodiment. The local UDDI annotation 34 is annotation information describing an annotation for the local UDDI 33. As the annotation information, for example, summary information and credit information for the Web service are described.
[0112]
The P2P agent 35 corresponds to the link unit 29 in FIG. The P2P agent 35 realizes cooperation with another search system. The P2P agent 35 performs peer-to-peer communication, dynamically discovers another search system, and communicates with the other found search systems.
[0113]
The semantic service match 36 corresponds to the search matching unit 31 in FIG. The semantic service match 36 matches the service search request with the local UDDI annotation 34, and determines whether the location information of the Web service targeted for the search request is registered in the local UDDI 33.
[0114]
FIG. 6 is a block diagram illustrating an example of a cooperation state of the search system according to the present embodiment. The search systems 321 to 32n have the same configuration as the search system 32.
[0115]
Web services are dynamically discovered by cooperation of the search systems 321 to 32n. Further, by linking the search systems 321 to 32n, various Web services such as Web services held in UDDI are shared, and the Web services can be used effectively and effectively.
[0116]
【The invention's effect】
As described in detail above, in the present invention, the independence of the search system is ensured, and a search with higher accuracy and usefulness can be performed.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an example of a configuration of a search system according to a first embodiment of the present invention.
FIG. 2 is an exemplary block diagram showing an example of a cooperation state of the search system according to the embodiment;
FIG. 3 is an exemplary flowchart illustrating an example of registration processing by the search system according to the embodiment.
FIG. 4 is an exemplary block diagram showing an example of search processing by the search system according to the embodiment;
FIG. 5 is a block diagram showing an example of a configuration of a search system according to a second embodiment of the present invention.
FIG. 6 is an exemplary block diagram showing an example of a cooperation state of the search system according to the embodiment;
FIG. 7 is a block diagram showing an example of an existing centralized management type network information management architecture.
FIG. 8 is a block diagram showing a first example of an architecture using a distributed database.
FIG. 9 is a block diagram showing a second example of an architecture using a distributed database.
FIG. 10 is a block diagram showing an example of a P2P type architecture.
FIG. 11 is a block diagram showing an example of an architecture using an agent.
[Explanation of symbols]
221 to 22n search system, 4 registration unit, 12 search unit, 23 recording device, 24 recording device, 25 index recording device, 26 recording medium, 27 search program, 28 search cooperation program, 29 ... Cooperation part, 30 ... Index management part, 31 ... Search matching part

Claims (4)

On the computer,
An index management function for managing index information about the location information of the search target recorded in the recording means,
It is determined whether or not the input search request matches the index information managed by the index management function. If it is determined that the search information matches, the search unit executes a search for the recording unit based on the search request. And a search matching function for instructing a coordinating means for controlling communication performed between the other system and the transfer of the search request to another system when it is determined that the search request does not match. Search linkage program. The search cooperation program according to claim 1,
A search cooperation program, wherein the index management function creates index information for the new location information when the new location information is recorded in the recording unit, and records the index information in the recording unit. In a search system that searches for location information of a search target recorded in a recording unit based on an input search request,
Coordination means for controlling communication with other systems;
Recording means for recording location information to be searched;
Index management means for managing index information about the location information,
Search means for executing a search for the recording means based on the search request;
It is determined whether or not the search request and the index information managed by the index management unit match.If it is determined that the search request matches, the search unit is instructed to execute a search based on the search request. A search adaptation unit that instructs the cooperation unit to transfer the search request when the determination is made. In a search method for searching for location information of a search target recorded in a first recording unit by a computer based on a search request,
Index information on the location information recorded in the first recording means is recorded in a second recording means,
Determining whether the input search request matches the index information recorded in the second recording means,
When it is determined that the search request matches, the search for the first recording unit based on the search request is executed, and when it is determined that the search request does not match, the search request is transferred to another system via a network. retrieval method.

Images