JP2005032150A - Web service providing server, method and program thereof - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a Web service providing system for reducing the bottleneck due to access to a directory server and the overhead in accessing a terminal and improving the processing capability of the directory service.
A Web service providing server of the present invention is a Web service providing server that accesses a directory server and obtains directory information of the Web service corresponding to the search condition. The search condition and the directory information searched by the search condition are provided. If there is a search condition that matches the storage section having a cache table indicating the correspondence with the search table and there is a matching search condition, directory information corresponding to the search condition is output, and if there is no matching search condition, the directory server The search processing control unit writes the directory information obtained from the directory server in a table corresponding to the search condition.
[Selection] Figure 1

Description

  In the present invention, a client requests a directory service server (hereinafter referred to as a directory server) to search for a URL of a service, and a Web (a distributed database in which information is expressed in hypertext format on the Internet) based on the search result. (System; World Wide Web) A service providing system.

In a method for providing a Web service, management of network resources, that is, search, registration, and deletion of various services via the Web is performed using a system using a directory service.
Here, as shown in FIG. 12, service providers A, B, C, and the like access the directory server when registering the service to be provided in the directory server and when deleting the service to be stopped from the directory server. Request registration and deletion.
Similarly, the client (terminal user's terminal) or the like searches for the URL of the service provider that provides the service that the user wants to use, or the URL of a shop on the Internet that handles products of the desired amount in Internet shopping. (Patent Document 1).

Furthermore, recently, in order to improve the search accuracy in a directory service, a system that uses a directory server to provide a search service in which a plurality of service providers are linked in response to a search request from a client is also used.
That is, as shown in FIG. 13, the agent moves autonomously between servers (for example, service providers A, B, and C) using mobile agent technology for network management in a Web service, and is requested by a client. A large-scale search service can be realized by collecting information sequentially or in parallel by a destination server.
JP 2003-099453 A

  However, in the conventional Web service providing method described above, load on the directory service is concentrated due to service registration / deletion and service search, and access to the directory server is efficient when multiple clients use the service. There is a problem that the overall throughput deteriorates.

In addition, the Web service providing method enables a large-scale search by using a mobile agent, but there are a plurality of service request clients on each client, and the same client is added to search for the next transfer destination. Access from the terminal to the directory server is significantly increased as compared with the case where the mobile agent is not used, and the line usage rates of both the client and the directory server are increased.
As a result, the provision of a Web service using a mobile agent has a drawback that a performance bottleneck occurs in the directory server, overhead is imposed on access to the terminal, and the mutual processing capability is reduced.

Further, as in the cache technology in the Web proxy (proxy server) shown in FIG. 14, the service information (including directory information) acquired by the client accessing the Web server is stored in the Web proxy storage unit for a specified time. Some of them are cached.
As a result, if the service is a service cached in the Web proxy, the client can acquire (view content) desired service information without accessing the Web server for each search.
However, since the service cached in the storage unit of the Web proxy is not updated, it is unclear when the client is viewing the service information, and there is a disadvantage that the latest information cannot be obtained in some cases.

  The present invention has been made in view of such circumstances, and by reducing the bottleneck due to access to the directory server and the overhead in terminal access, the processing capability of the directory service is improved, and the latest directory is always updated. An object is to provide a Web service providing system capable of acquiring information.

  In order to achieve the above object, a Web service providing server of the present invention is a Web service providing server that accesses a directory server and acquires directory information of a Web service corresponding to a search condition. The search condition and the search condition The storage unit storing the cache table indicating the correspondence with the directory information searched by the above and the search condition to be input is searched by the table, and if there is a matching search condition, the directory information corresponding to this search condition As a search result, and when there is no matching search condition, a search processing control unit that performs a search by accessing a directory server, and the directory obtained by accessing the directory server by the search processing control unit Write information to the table corresponding to the search conditions used for the search. The features.

  The Web service providing server of the present invention includes a refresh unit that accesses the directory server at predetermined time intervals, acquires directory information corresponding to the search condition in the table, and updates the directory information of the table. It is characterized by.

  In the Web service providing server of the present invention, each time each directory information is read in the table, the search processing control unit writes a read time read corresponding to the directory information, and a new search condition and When writing the directory information, a search condition having the largest difference between the current time and the read time is detected, and the detected search condition is replaced with a new search condition.

  In the Web service providing server of the present invention, the table includes a directory table in which the directory information and the reading time are indicated in correspondence, a search condition, and directory information corresponding to the search condition. And a search table, each being accessed independently.

  In the Web service providing server of the present invention, when the refresh unit updates directory information, it detects presence / absence of operation of the service indicated by each directory information, and responds to this service when it detects a non-operating service. The directory information to be read cannot be read.

  The Web service providing server of the present invention is a Web service providing method for accessing the directory server and acquiring the directory information of the Web service corresponding to the search condition. The search condition and the directory information searched by the search condition A storage process of storing a cache table indicating correspondence in the storage unit, and search conditions to be input are searched by the table. When there is a matching search condition, directory information corresponding to the search condition is output as a search result, A search process control process for performing a search by accessing the directory server when there is no matching search condition, and the directory information obtained by accessing the directory server in the search process control process is used for the search. It writes to the said table corresponding to search conditions, It is characterized by the above-mentioned.

  The Web service providing program of the present invention is a program that causes a computer to execute Web service providing that accesses a directory server and obtains directory information of a Web service corresponding to a search condition, and is searched based on the search condition and the search condition. A storage process for storing a cache table indicating correspondence with the directory information stored in the storage unit and search conditions to be input are searched by the table, and if there is a matching search condition, the directory information corresponding to the search condition is searched. When there is no search condition that matches as a result, a search control process for accessing the directory server and performing a search is performed. In the search control process, directory information obtained by accessing the directory server is searched. The table corresponding to the search condition used for Is an executable program computer and writes to.

As described above, according to the Web service providing server of the present invention, the following effects can be obtained.
Since the Web service providing server of the present invention caches directory information in the cache unit, it is possible to greatly reduce access to the directory server, improve overall throughput, and improve search processing performance. Since the cache unit updates the stored contents at regular intervals, it is possible to always obtain the latest directory information corresponding to the search condition.

  In addition, since the Web service providing server of the present invention can greatly reduce access from the client to the directory server even when the mobile agent technology is used, the throughput of the directory server is improved, and the client side Overhead due to increased access can be prevented, and the processing capability on the client side can be improved.

  Furthermore, in the Web service providing server of the present invention, the cache unit is divided into two, a cache table that associates the search information with the directory information table, and a directory information table that associates the directory information with the last search time. Even when the directory information table is locked to update the directory information, other directory information tables can be searched by the cache table, and the entire cache unit is locked during the update process. The inconvenience that the search process cannot be performed is prevented.

Hereinafter, a Web service providing server according to an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram illustrating a configuration example of a Web search system using a Web service providing server according to an embodiment.
In FIG. 1, when a search request is input, the Web service providing server 1 receives directory information corresponding to a search condition for searching for a service, that is, a service object (the URL of the server of the service provider that performs the service, Or a JAVA (registered trademark) stub or the like.
The Web service providing server 1 is connected to the directory server 2, service servers 4, 5, 6, etc. via the network 7.
Here, the network 7 is configured by a combination of a public communication line, a dedicated communication line, the Internet, a LAN (local area network), and the like.

The Web service providing server 1 includes a cache control unit 1a, a cache unit 1b, a refresh unit 1c, and a forced refresh unit 1d.
This Web service providing server 1 may be a server of a client shown in FIG. 12, may be a server of service providers A, B, and C shown in FIGS. 12 and 13, and further, a connection node between networks, For example, the above configuration may be provided in a router or the like.

In the following description, it will be described as a service provider server.
As shown in FIG. 2, the cache unit 1b stores a table showing the last search time and the service object corresponding to each of the plurality of search conditions.
The cache control unit 1a generates a search query based on the input search condition, searches for a search condition that matches the search condition from the table of the cache unit 1b, and detects a search condition that matches the search condition. The service object corresponding to the retrieved search condition is read from this table and output.

In addition, when a search condition that matches the input search condition is not detected in the table, the cache control unit 1a accesses the directory server 2 and requests a search for a service object corresponding to the search condition.
The directory server 2 searches for services registered by the service providers A, B, and C. That is, the registered services are stored as directory information in the internal directory storage unit corresponding to the search key. The directory information of the service corresponding to the search key is extracted from the directory storage unit using the input search condition as the search key, and is output to the Web service providing server that requested the search.

The refresh unit 1c refreshes directory information in the table stored in the cache unit 1b every predetermined time, for example, every week.
That is, the refresh unit 1c accesses the directory server 2, acquires the latest directory information stored in the directory storage unit of the directory server 2 according to the search conditions stored in the table, and stores it in the table. Update directory information.

When the forced refresh unit 1d detects a refresh request input to the Web service providing server 1, the forced refresh unit 1d performs the same process as the refresh operation performed by the refresh unit 1c described above when the refresh request is detected.
The service servers 4, 5, and 6 in FIG. 1 provide a predetermined service (product sales, product introduction, technology introduction, traffic information, etc.) to the client.

Next, an operation example of the Web service providing server 1 according to the embodiment of the present invention will be described with reference to FIGS. FIG. 3 is a conceptual diagram for explaining the operation of the Web service providing server 1.
The operation of the cache control unit 1a will be described using the flowchart of FIG.
In step S1, if the cache control unit 1a detects that a search request and a search condition are input, the process proceeds to step S2, and if not input, the process returns to step S1.

Next, in step S2, the cache control unit 1a searches the cache unit 1b and detects the presence or absence of a search condition that matches the input search condition (see FIG. 2).
When the cache control unit 1a detects a matching search condition, the process proceeds to step S3.
Next, in step S3, the cache control unit 1a reads directory information corresponding to the detected search condition from the cache unit 1b, and advances the process to step S4.
In step S4, the cache control unit 1a updates the last search time to the current time, and advances the process to step S5.

On the other hand, in step S2, if the cache control unit 1a detects that the matched search condition is not cached (temporarily stored) in the cache unit 1b, the process proceeds to step S6.
Next, in step S6, the cache control unit 1a accesses the directory server 2, outputs a search request and search conditions, acquires directory information corresponding to the search conditions, and advances the process to step S7.

In step S7, the cache control unit 1a detects whether or not the cache unit 1b can store the total capacity of the search condition and the directory information newly acquired based on the search condition.
That is, the cache control unit 1a determines whether or not the remaining storage capacity of the current cache unit 1b is smaller than the total capacity (or the added value of the remaining storage capacity and the total capacity exceeds the cache capacity). You can also detect whether or not.

If the cache control unit 1a detects that the remaining storage capacity is not smaller than the total capacity (or if the sum of the remaining storage capacity and the total capacity does not exceed the cache capacity), the cache control unit 1a performs the process in step S9. Proceed to
On the other hand, if the cache control unit 1a detects that the remaining storage capacity is smaller than the total capacity (or if the added value of the remaining storage capacity and the total capacity exceeds the cache capacity), the process proceeds to step S8.

Next, in step S8, the cache control unit 1a searches the cache unit 1b for a search condition with the oldest last search time, deletes the search condition and directory information corresponding to the search condition, and performs a search. A free capacity capable of newly storing the conditions and the directory information searched according to the search conditions is created, and the process proceeds to step S9.
In step S9, the cache control unit 1a newly associates the search condition with the directory information searched based on the search condition, stores them in the table of the cache unit 1b, and advances the process to step S4.
Next, the cache control unit 1a outputs the searched directory information to the request source that made the search request, and returns the process to step S1.

In the above-described figure, the search and content update processing for the cache unit 1b will be described in detail below.
Here, the cache unit 1b includes two tables, a cache table shown in FIG. 5 and a directory information table.
The cache table (M table) is a table indicating correspondence between a search query (Query) indicating search information and a reference address (ServicePointer) of a directory information (ServiceObject: service object) table as an index.
The directory information table is provided corresponding to each search information. One or a plurality of information source directory information searched based on the search information and the last search time (LastUpdateTime) when the search information was last searched. ) Are stored in association with each other.

Next, the detailed operation of step S3 in FIG. 4 will be described with reference to the flowchart in FIG.
In step S31, when the cache control unit 1a detects that the search information is stored in a cache table (hereinafter referred to as M table), the cache control unit 1a calls (starts) a program in which a search method for performing a search process is described, The directory information acquisition process starts.
Next, in step S32, the cache control unit 1a acquires a reference address corresponding to the search information using the search query as an index in the M table.

Thereby, in step S33, the cache control unit 1a locks the directory information table (st object) indicated by the acquired reference address (exclusively controls access from other search methods), and sets the final search time to the current time. Rewrite and update, and unlock after this update.
Next, in step S34, the cache control unit 1a acquires directory information (for example, URLs1, s2, s3 of a plurality of service providers) from the directory information table, and outputs the acquired directory information to the request source that requested the search. To do.

Next, the operation in step S9 in FIG. 1 will be described in detail with reference to the flowchart in FIG.
In step S91, the cache control unit 1a stores the search query and the directory information searched in the directory server 2 corresponding to the search query in the M table and the directory information table in the cache unit 1b. Call this program and execute it.
In step S92, the cache control unit 1a creates a new directory information table, locks the directory information table, and writes the directory information and the last search time.

Then, after the writing process to the directory information table is completed, the cache control unit 1a releases the lock, outputs the reference address of this directory information table, and advances the process to step S93.
Next, in step S93, the cache control unit 1a locks the M table, and associates the search query used for searching the directory information with the reference address of the directory information table in which the directory information is written. After writing to the M table, the lock on the M table is released.

Next, the refresh operation for the cache unit 1b of the refresh unit 1c will be described with reference to the flowchart of FIG.
In step S11, the refresh unit 1c does not perform the refresh operation until a predetermined wait time elapses, and proceeds to step S12 after the wait time elapses.

Next, in step S12, the refresh unit 1c extracts one piece of search information from the M table of the cache unit 1c.
In step S13, the refresh unit 1c accesses the directory server 2, makes a search request, and obtains the latest directory information corresponding to the search information.

Thereby, in step S14, the refresh unit 1c performs the ping service process, accesses the service providing destination indicated by the acquired directory information, and determines whether each service is alive (whether the service is provided). Is detected.
At this time, in the ping service process, the refresh unit 1c sets the directory information of the service source (service server) that has stopped providing the service to a state where it cannot be referred to in the directory information table.
Further, when a refresh request is input from the forced refresh unit 1d, the refresh unit 1c cancels this standby processing even within the wait time in step S11, proceeds to step S12, and starts a refresh operation. .

Next, in step S15, the refresh unit 1c updates the directory information in the cache unit 1b (directory information table) to the latest data corresponding to the retrieved search information.
In step S16, the refresh unit 1c holds the process for a predetermined weight adjustment time. After the weight adjustment time has elapsed, the process proceeds to step S17.
Here, the weight adjustment time is adjusted as necessary in the operation of the Web service providing system.

  Next, in step S17, the refresh unit 1c detects whether or not the refresh process, that is, the update process, has been completed for all search information in the M table, and if it is detected that the process has been completed, the process proceeds to step S11. If it is detected that the process has not been completed, the process proceeds to step S12.

Next, the directory information update processing in step S15 in the flowchart of FIG. 8 will be described in detail with reference to the flowchart of FIG.
In step S151, the refresh unit 1c performs update processing of the directory information table in the cache unit 1b, that is, search information (search query) and the latest directory searched in the directory server 2 in response to the search query. In order to store information (service object) in the directory information table, the update method program is called and executed.

Next, in step S152, the refresh unit 1c acquires the reference address (ServicePointer) of the directory information table corresponding to the search information, using the search information as an index from the M table.
In step S153, the refresh unit 1c accesses the directory information table (st object) using the retrieved reference address.
Next, in step S154, the refresh unit 1c locks the directory information table, writes the latest directory information, and then releases the lock.

  As described above, since the Web service providing server of the present invention caches directory information in the cache unit 1b, access to the directory server 2 can be greatly reduced, overall throughput is improved, and search is performed. The processing performance can be improved, and the cache unit 1b is refreshed (updated) at regular intervals, so that the latest directory information corresponding to the search condition can always be obtained.

  In addition, the Web service providing server of the present invention can significantly reduce access from the client to the directory server 2 even when the mobile agent technology is used. It is possible to prevent the overhead for access on the client side and to improve the processing capability on the client side.

  Furthermore, the Web service providing server of the present invention eliminates the disadvantage that the cache is locked and the entire cache cannot be accessed when the cache is refreshed, so that the cache unit 1b stores the search information and the directory information table. The M table to be associated and the directory information table in which the directory information and the last search time are associated with each other are separated, and while the directory information table is locked to update the directory information, Other directory information tables can be searched using the M table, and the above-described cache unit 1b can be locked and the inconvenience that the search process cannot be performed during the update process can be prevented.

In addition, in step S8 of the flowchart of FIG. 4, when the cache control unit 1a writes a new search condition and directory information searched by the search condition to the cache unit 1b, the capacity of the cache unit 1b If it is not sufficient for writing, the oldest search time is deleted in order to secure the capacity for writing. However, considering the number of references (reference frequency), there are the following drawbacks.
When judging whether or not to delete from the last search time, even if the number of references is small, it is not deleted if the last search time is new. End up.

However, when determining whether to delete a search condition and directory information based on the number of references rather than the last search time, the search condition was frequently referred to in the past, but is not referred to at all in a predetermined period until the current time. However, there is a drawback that it is not deleted.
Therefore, in order to solve the above-described drawbacks, it is necessary to evaluate the reference frequency in deleting the detection condition from the M table including not only the number of times of reference but also the period of counting the number of times of reference.

Therefore, as shown in FIG. 10, in order to determine deletion from the above-described M table, two times of a counter valid period and a deletion exemption period are defined.
At this time, there is no item associated with the last search time, and there is no processing for writing the last search time to the directory information table in the steps of each flowchart.
Here, the counter valid period indicates a period in which the number of searches is counted, and the deletion exemption period indicates a period in which deletion is exempted after the start of the counter effective period (if the count valid period is short, the number of searches Because the count value of becomes smaller and is subject to deletion).
The start time of the count effective period is the time when the search information is first searched after the previous count effective period ends.

In the directory information table, as shown in FIG. 11, for example, there is no search end time, the start time of the counter valid period is described as t1 and t2 in the terms of time T1 and time T2, respectively, and the counter value a is This is the number of searches from time t1 to time t2, and the counter value b indicates the number of searches from time t2.
At this time, the column of time T1 indicates the start time of the immediately preceding (past) counter effective period, and the column of time T2 indicates the start time of the current counter effective period.

Next, when the elapsed time from time T2 exceeds the counter valid period, the counter value a1 is cleared to "0", the number of searches from time t2 to time t1 becomes the counter value b1, and the corresponding search condition is searched. Then, the searched time t1 is written in the column of time T1, the counter valid period starts corresponding to time T1, and the number of searches from time t1 becomes the counter value a1.
At this time, the column of time T2 indicates the start time of the immediately preceding (past) counter effective period, and the column of time T1 indicates the start time of the current counter effective period.

As described above, the item fields of times T1 and T2 are used by alternately switching the storage of the previous and subsequent times (past and current start times) each time the counter valid period elapses.
As shown in FIG. 10, the following operation will be described with time t1 as the previous time and time t2 as the later time.
Here, in the counter effective period from time t1 to time t2, the number of searches is the counter value a1, and the number of searches from time t2 is the counter value b1.

  The cache control unit 1a searches the directory information table for each search information of the M table, adds the counter value a1 and the counter value b1 as the total number of searches, and for each search information, from the time t1 to the current time. The total number of searches (added value of the number of searches in the previous counter valid period and the number of searches in the current counter valid period) is obtained, and a correspondence table between the search condition and the total number of searches is created in association with the M table. .

Then, the cache control unit 1a deletes, from the correspondence table, the search condition in which the deletion exemption period has elapsed since the counter valid period has started, that is, the deletion exemption period has not elapsed since time t2.
Here, the cache control unit 1a subtracts the time t2 from the current time, and detects whether or not the deletion exemption period has passed by whether or not the subtraction result is equal to or less than the deletion exemption period.
Next, the cache control unit 1a detects search information having the smallest total number of searches (a1 + b1) from the correspondence table, and deletes the search information detected from the M table.

Thereby, the counter value a1 indicates the number of past searches, and the counter value b1 indicates the number of recent searches.
Therefore, the above-mentioned search method to be deleted can delete a search with a large number of past searches and a low number of current searches, and a deletion exemption period is detected, so that a recently searched result is reflected. The search information that has started to be searched can be removed from the deletion target, the search for the deletion target becomes fair, and the deletion target can be appropriately searched.

  Further, the program for realizing the cache control unit 1a and the refresh unit 1b in FIG. 1 is recorded on a computer-readable recording medium, and the program recorded on the recording medium is read into a computer system and executed. Construction management may be performed. The “computer system” here includes an OS and hardware such as peripheral devices. The “computer-readable recording medium” refers to a storage device such as a flexible disk, a magneto-optical disk, a general medium such as a ROM and a CD-ROM, and a hard disk incorporated in a computer system. Further, the “computer-readable recording medium” refers to a program that dynamically holds a program for a short time when the program is transmitted via a network such as the Internet or a communication line such as a telephone line. In this case, a volatile memory inside a computer system serving as a server or a client in this case includes a program that holds a program for a certain time. The program may be a program for realizing a part of the functions described above, and may be a program capable of realizing the functions described above in combination with a program already recorded in a computer system.

  The embodiment of the present invention has been described in detail with reference to the drawings. However, the specific configuration is not limited to this embodiment, and includes design and the like within a scope not departing from the gist of the present invention.

It is a conceptual diagram which shows the structural example of the web service provision system using the web service provision server of one Embodiment of this invention. It is a conceptual diagram explaining the structural example of the cache part 1b in FIG. It is a conceptual diagram for demonstrating the operation example of the Web service provision system of FIG. It is a flowchart explaining the operation example of the search process of the cache control part 1a. It is a conceptual diagram which shows the structural example of the cache part 1b. It is a flowchart explaining the operation example of the search process of the cache part 1b by the cache control part 1a. It is a flowchart explaining the example of operation | movement of the update process of the cache part 1b by the cache control part 1a. It is a flowchart explaining the refresh operation example with respect to the cache part 1b of the refresh part 1c. It is a flowchart explaining the operation example of the update process with respect to the cache part 1b of the refresh part 1c. It is a conceptual diagram for demonstrating other operation | movement of step S8 of FIG. It is a conceptual diagram which shows the structure of the directory information table used in FIG. It is a conceptual diagram explaining the outline | summary of the directory service in a network. It is a conceptual diagram explaining the outline | summary of the directory service at the time of utilizing a mobile agent technique. It is a conceptual diagram explaining the cache technique in a Web proxy (proxy server).

Explanation of symbols

DESCRIPTION OF SYMBOLS 1,3 Web service provision server 1a Cache control part 1b Cache part 1c Refresh part 1d Forced refresh part 2 Directory server 4, 5, 6 Service server

Claims (7)

A web service providing server that accesses the directory server and obtains directory information of the web service corresponding to the search condition;
A storage unit storing a cache table indicating correspondence between the search condition and the directory information searched by the search condition;
Search the input search conditions by the above table, and if there is a matching search condition, output the directory information corresponding to this search condition as a search result. If there is no matching search condition, access the directory server and search. And a search processing control unit for performing
The Web service providing server, wherein the search processing control unit writes directory information obtained by accessing the directory server into the table in accordance with a search condition used for the search.   2. The refresh unit according to claim 1, further comprising a refresh unit that accesses the directory server at predetermined time intervals, acquires directory information corresponding to a search condition in the table, and updates the directory information of the table. Web service providing server.   Each time the directory information is read in the table, the search processing control unit writes the read time read corresponding to the directory information, and writes a new search condition and directory information. 3. The Web service providing server according to claim 1, wherein a search condition having the largest difference from the reading time is detected, and the detected search condition is replaced with a new search condition.   The table is composed of a directory table in which the directory information and the reading time are indicated correspondingly, and a search table in which the search condition and directory information corresponding to the search condition are indicated correspondingly. The Web service providing server according to claim 3, wherein the Web service providing server is accessed as described above.   When the refresh unit updates directory information, it detects the presence / absence of the operation of the service indicated by each directory information, and if it detects a non-operating service, the directory information corresponding to the service cannot be read. The Web service providing server according to any one of claims 2 to 4, wherein: A web service providing method of accessing a directory server and acquiring directory information of a web service corresponding to a search condition,
A storage process of storing in the storage unit a cache table indicating a correspondence between the search condition and the directory information searched by the search condition;
Search the input search conditions by the above table, and if there is a matching search condition, the directory information corresponding to this search condition is output as a search result. If there is no matching search condition, the directory server is accessed and searched. A search processing control process for performing
A method of providing a Web service, wherein directory information obtained by accessing a directory server is written in the table in accordance with a search condition used for the search in the search processing system. A program for causing a computer to execute web service provision for accessing a directory server and acquiring directory information of a web service corresponding to a search condition.
A storage process for storing a cache table indicating a correspondence between the search condition and the directory information searched by the search condition in the storage unit;
Search the input search conditions by the above table, and if there is a matching search condition, output the directory information corresponding to this search condition as a search result. If there is no matching search condition, access the directory server and search. And a search control process for performing
In the search control process, a computer-executable Web service providing program, wherein directory information obtained by accessing a directory server is written in the table in accordance with a search condition used for the search.

Images