JP2928725B2 - Information processing apparatus and method for realizing distributed directory system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to, for example, ITU-T Recommendation X. The present invention relates to an information processing apparatus and method for implementing a cache function in a directory system agent (DSA) of a directory system specified in the 500 series.

[0002]

2. Description of the Related Art For example, ITU-T Recommendation X. The directory system specified in the 500 series provides a function for centrally managing network resources distributed on a large-scale network. Using this directory system, information about network resources (network information) can be searched and updated.

However, in the directory system, since it is assumed that searches are frequently requested and updates do not occur so much, real-time properties for updates are not pursued.

As shown in FIG. 17, a directory system accesses a DIB (directory information base) storing network information on one machine, as shown in FIG.
It is composed of an SA (directory system agent) and a DUA (directory user agent) for transmitting a request from a user to the DSA.

As shown in FIG. 17, in a distributed directory composed of DIBs distributed over a network, network information that does not exist in the DIB of machine A exists in another machine (machine B or machine C in FIG. 17). .

In this case, the user gives a search request to the DSA via the DUA of the machine A, and the DSA requests the machine having the requested information (in this case, machine C) to perform the search. The machine C that has received the search request executes the requested search process on the DIB in its own machine, and returns the result to the user via the DSA and DUA of the machine A.

Incidentally, the logical data structure of DIB is as follows.
As shown in FIG. 18, it has a tree structure, entries are arranged in nodes of the tree, and network information (e.g., mail addresses) is stored in the entries as attributes.

Each entry is named, and the name can be represented by a relative distinguished name (RDN). The RDN is a combination of {attribute type: attribute value}, and the entry of “company X” in FIG. 18 has an RDN of {“organization name”: “company X”}.

[0009] The order of the RDN from the root of the DIB entry to any entry can be represented by an identifier (DN). The entry of “company X” has a DN of ({“country name”: “Japan”) / {“organization name”: “company X”}.

When the user searches for the e-mail address of an employee belonging to "company X", this DN is specified. The directory system traces "Japan" and "Company X" from the root of the DIB entry based on the designated DN, and "Kazuyuki Ikenoya", "Koichi Hashimoto" and "Yo Masuo" who are employees of "Company X". Get an email address from the entry.

[0011]

As described above, in the conventional directory system, if the target network information does not exist in the DIB held by the DSA of the own machine, the DSA of another machine must be inquired. No. Therefore, when the same network information is requested a plurality of times, the same processing has to be executed a plurality of times as requested.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-described circumstances, and is an information realizing a distributed directory system capable of efficiently acquiring network information existing in a distributed DIB (directory information base). It is an object to provide a processing device and method.

[0013]

According to the present invention, there is provided a storage means in which information is stored, a first processing means for executing an operation on the information stored in the storage means, and a storage means from a user. And a second processing means for receiving a processing request to the first processing means and transmitting the processing request to the first processing means, wherein a plurality of information processing apparatuses are connected via a communication line and the first processing means And a cache information table for storing an operation result of information stored in a storage unit in another information processing apparatus, the cache information table storing the operation result of the information processing apparatus. If the processing request from the means is a processing request for the information stored in the storage means in another information processing apparatus, the operation result for the processing request is stored in the cache information table in the own apparatus. Operation result accumulating means for accumulating data in the cache information table by the operation result accumulating means in response to a processing request from the second processing means. And characterized in that:

[0014] The processing request from the second processing means includes a search condition for specifying information stored in the storage means, and the operation result storage means determines each of the information that can be specified based on the search condition. Copy information including an identification name unique to the information and information serving as a main body of an operation object corresponding to the identification name;
By associating with the search condition when the copy information was acquired,
The information is stored in the cache information table.

The operation result storage means registers the time when the copy information was stored in the cache information table in association with the copy information, and stores each copy information registered by the operation result storage means. Further comprising copy information management means for deleting the copy information stored in the cache information table based on the time corresponding to the above, wherein the copy information stored in the cache information table is always registered within a predetermined time. It is characterized by

The operation result storage means registers the number of times the copy information has been used in association with the copy information, and registers the number of times the copy information has been used in correspondence with each copy information registered by the operation result storage means. Based on the number of times
A copy information management means for deleting copy information stored in the cache information table is further provided, and the copy information stored in the cache information table is always valid.

[0017] Also, storage means for storing information so that the information can be specified by an identifier, first processing means for executing an operation on the information stored in the storage means, A second processing unit that receives a processing request including a search condition for specifying information based on the identification name and transmits the processing request to the first processing unit. In an information processing apparatus which is connected via a communication line and realizes a distributed directory system capable of requesting a processing request between first processing means of each apparatus, an information processing apparatus for processing information stored in storage means in another information processing apparatus. Hash operation for calculating a hash value from a cache information table for accumulating operation results and each relative identification name constituting an identification name indicated by the search condition of the processing request And if the processing request from the second processing means is a processing request for information stored in the storage means in another information processing apparatus, the processing request is specified based on the search condition as an operation result for the processing request. Copy information consisting of an identification name unique to each possible information and information to be the main body of an operation object corresponding to the identification name is associated with a search condition when the copy information is obtained, and is indicated by the search condition. An operation result accumulating unit for adding a hash value to the relative identifier of the identifier and the identifier unique to the information, and accumulating the hash value in the cache information table in the own device; and a processing request from the second processor. Using the operation result accumulated in the cache information table by the operation result accumulation means, the hash value of each relative identifier of the identifier indicated by the search condition, and Comparing the stored hash value Shrewsbury information table, compared after narrowing of the subject information based on the result, characterized by comprising a table operating unit to perform the operation.

[0018]

According to such a configuration, when an inquiry about information existing in the directory information base (DIB) of another information processing apparatus is made, the DS of the other information processing apparatus is inquired.
The operation result from the A process (first processing means) is held in the cache information table, and when a similar processing request is requested, if the copy is available, the cache information table in the own device is used. By performing the operation, the response performance in the distributed directory can be improved.

The copy information held as cache information becomes low-reliable information unless there is a means for maintaining consistency with the original information which is the original. Therefore, the registration time is set for the copy information registered in the cache information table, and the copy information that has passed a certain period of time is deleted, so that the contents of the copy information registered in the cache information table are kept up to date. By doing so, the reliability is improved.

Further, some copy information held as cache information is not often used. Holding such unnecessary information results in waste of resources, reduction in processing efficiency, and the like. Therefore, unnecessary copy information is deleted from the cache information table by setting, for example, the number of accesses indicating the number of uses to the copy information registered in the cache information table, and deleting the copy information with a small number of accesses. Further, by managing the copy information in combination with the registration time of the copy information, a cache information table effective for the user can be created.

Further, in order to obtain target copy information from copy information held as cache information, a relative identifier (RDN) constituting an identifier of the entry is used as a search key. Generally, RDN is relatively large data including a character string. If the large data is used as it is for comparison for search, the time required for comparison becomes longer in proportion to the size. Therefore, each RDN that constitutes an identification name, which is a search key of the cache information table, has a hash value with a small data amount,
By performing the search (candidate narrowing down) based on the hash value and then comparing the actual RDN, the overall processing speed can be improved as compared with the case where the narrowing down using the hash value is not performed.

[0022]

An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the distributed directory system according to the present embodiment. FIG. 1 shows a plurality of information processing apparatuses 10, 1 constituting a distributed directory system.
2 and 14 are connected via a communication line 18.

Here, the information processing apparatus 10 will be mainly described. As shown in FIG.
UA (directory user agent) process 20
(Second processing means), DSA (directory system agent) process 22 (first processing means), DIB (directory information base) 24 (storage means), storage unit 2
6 and the respective functions of the hash calculator 28 (hash calculator).

The DUA process 20 receives a request from the user for the directory system and transmits a processing request to the DSA process 22. The DSA process 22 accesses the DIB 24 in its own device or the D of another information processing device 12 or 14 in response to a processing request from the user obtained through the DUA process 20.
An access request to the DIB in another device is made to the SA process via the communication line 18. The DSA process 22 can read and write directly to the storage unit 26 in addition to the processing for the DIB 24 in its own device, and executes the process while saving or referring to various information using the storage unit 26. Function (operation result accumulation means,
Table operation means, copy information management means). The DSA process 22 can obtain a hash value by using the hash calculator 28 in response to a processing request from the user obtained through the DUA process 20.

The DIB 24 stores information on network resources (network information).
Search and update of network information are executed by the SA process 22.

The storage unit 26 is for reading and writing various information by the DSA process 22. In the present embodiment, the cache information table 26
a, search request information 26b, operation result information 26c, and the like. The cache information table 26a stores a processing result of a DSA process implemented on another information processing apparatus, and is referred to when a similar processing request that can be used later is made. The cache information table 26a stores a set of copy information, which is entry information obtained by the process, and a search condition given when the process is performed. Further, management information (registration time, access count, etc.) for managing the copy information is added to the copy information as needed and stored in the cache information table 26a. The search request information 26b contains D
Information about the search request given by the SA process 22 via the DUA process 20 (including the identification name of the search target)
It is. The operation result information 26c is a result (entry information) obtained by the processing of the DSA process realized on another information processing device, and is stored as copy information in the cache information table 26a as necessary.

[0027] The hash operation unit 28 performs the DSA process 2
2 is for obtaining a hash value based on the RDN when the processing request from the user is received via the DUA process 20, that is, when the user receives the relative distinguished name (RDN) of the entry to be searched.

The information processing apparatuses 12 and 14 have the same configuration as the information processing apparatus 10 and will not be described. FIG. 1 shows only the DSA processes 32 and DIB 34 provided in the information processing device 12 and the DSA processes 42 and DIB 44 provided in the information processing device 14.

FIG. 2 shows an example of the contents of the network information stored in the DIBs 24, 34, 44 of the information processing apparatuses 10, 12, 14. In FIG. 2, DSA1 corresponds to DSA process 22, and DSA2 corresponds to process 32.
, And the DSA 3 corresponds to the DSA process 42. The logical data structure of the DIBs 24, 34, and 44 has a tree structure as shown in FIG. 2, and an entry is arranged in a node of the tree, and network information (such as a mail address) is stored in the entry as an attribute. Have been.

Each entry is named, and the name can be represented by a relative distinguished name (RDN). The RDN is a combination of {attribute type: attribute value}, and the entry of “company X” in FIG. 2 has an RDN of {“organization name”: “company X”}.

The sequence of RDNs from the root of the DIB entry to any entry can be represented by an identifier (DN). The entry of “company X” has a DN of ({“country name”: “Japan”) / {“organization name”: “company X”}.

Next, the operation of this embodiment will be described.
First, an operation for accessing network information will be described by taking as an example a case where a user searches for email addresses of all employees belonging to “company X”.

In this case, the user requests the DSA process 22 via the DUA process 20 for a search request (base:
{/ C: Japan / 0: company X}, filter: *) is transmitted. The filter indicates the condition (target range) for the identification name for specifying the entry, and the filter "*"
Indicates that there is no filter (including all). “*” Is also used as a filter in combination with other conditions (character strings). Further, C and 0 each represent an attribute, C represents a country name, and 0 represents an organization name.

[0034] Here, DSA process 2 2 analyzes the search request obtained via the DUA process 20, a search request is copy information unavailable (details will be described later), and self-DSA process 22 DIB 24 to hold
Verify that the information requested does not exist. The search request is DSA3 shown in FIG.
4 indicates that the requested information is present in the DIB 44 of FIG. Therefore, the DSA process 22 sets the communication line 18
, The search request is transferred to the DSA process 42 of the information processing apparatus 14.

Upon receiving the search request, the DSA process 42
The search request is executed using the DIB 44 in the own device, and the result is transmitted to the DSA process 22 via the communication line 18. The DSA process 22 writes the search result from the DSA process 42 in the storage unit 26 as operation result information 26c.

FIG. 3 shows an example of a search result written in the storage unit 26 as the operation result information 26c. The search results shown in FIG. 3 include entry information corresponding to “Kazuyuki Ikenoya”, “Koichi Hashimoto”, and “Yo Masuo” who are employees of “company X”, that is, identification names and email addresses. The CN in (identification name) in FIG. 3 indicates an attribute and indicates a general name.

Next, the operation of the DSA process 22 for creating the cache information table 26a stored in the storage unit 26 will be described with reference to the flowchart shown in FIG.

The DSA process 22 is executed by the information processing device 1
Other DSA processes 32, 42 implemented on 2,14
Is stored in the storage unit 26 as the operation result information 2
6c, creation of the cache information table 26a is started (step A).
1).

First, the DSA process 22 extracts entry information (identification name, mail address) from the search result, stores it in the cache information table 26a as copy information, and also derives search conditions (base, filter) from which the search result is derived. Store in association with copy information (step A
2).

That is, the identifier {/ C: Japan / 0: company X / C of entry information E21 in operation result information 26c (search result) stored in storage unit 26 as shown in FIG.
N: Kazuyuki Ikenoya and email address ike @ kai
shaX. co. jp} as copy information, and the search condition (base: {/ C: Japan / 0: company X}, filter: *) from which the entry information E21 is extracted is copied to the cache information table 26a.

If unregistered entry information exists in the search result of the operation result information 26c, the process of step A2 is executed as described above (step A).
3). In the example shown in FIG. 3, the entry information E22, E23
, The copy information and the search condition are copied to the cache information table 26a corresponding to the same information.
Although not shown in FIG. 3, if there is other entry information, copy information and search conditions for this information are copied. As a result, a cache information table 26a including entry information E31 to E34 as shown in FIG. 5 is created in the storage unit 26 (step A3).

Next, referring to the flowcharts shown in FIG. 6 and FIG.
The operation of the reference process for the cache information table 26a stored in the storage device will be described. When the search request from the DUA process 20 is the same as that previously processed and the copy information is available, the operation is executed using the cache information table 26a.

Here, the DSA process 22 makes a search request for the mail address of “Mr. Masuo” of “company X” via the DUA process 20 (base: {/ C: Japan / 0: company X}, filter: CN) = Masuo *) (step B1).

The DSA process 22 is a DUA process 2
By analyzing the search request obtained through “0”, it is determined that this search request is available for copy information and is not information held by the DIB 24 in its own device (step B2).

Then, the DSA process 22 refers to the cache information table 26a, and if at least one copy information is stored (step B3), the search condition corresponding to each copy information and the given search condition Collate.
Specifically, this is performed as follows.

First, the DSA process 22 is performed, for example, as shown in FIG.
Of the search conditions of the cache information table 26 shown in FIG.
Those whose bases include {/ C: Japan / 0: Company X} are extracted. As a result, copy information E31, E32, and E33 excluding the copy information of the entry information E34 are obtained (step B4).

Further, since the search request filter (CN = Masuo *) is included in the copy information filter "*" (step B7), the search request filter is applied to the identification name of the copy information. As a result, copy information of the entry information E33 is obtained (step B10). A search result is created using the extracted copy information (step B).
11).

In the same manner, the DSA process 22
A description will be given assuming that a search request (basis: {/ C: Japan}, filter: *) for a mail address of a person included in "Japan" has been received via process A (step B).
1).

The DSA process 22 is a DUA process 2
The search request obtained via the device 10 is analyzed, and the search request can use copy information.
It is determined that the data is divided into those for the IB 24 and those for the DIB of another device.

The DSA process 22 executes an operation corresponding to the search request for the search target for the DIB 24 of the own device 10, and uses the cache information table 26a for the DIB of the other device.

At present, as shown in FIG. 5 , four pieces of copy information (entry information E3) are stored in the cache information table 26a.
Assuming that there are (1) to (E34), the DSA process 22 collates the search conditions corresponding to each copy information with the given search conditions (steps B1 to B4).

First, the search condition entry information including the base {/ C: Japan} is extracted. As a result, the entry information E31, E32, E33, E34 is obtained. Since the copy information of the entry information E31, E32, and E33, except for the copy information of the entry information E34, is the same (all sets), the search has been executed in the entire range. On the other hand, the copy information of the entry information E34 is a subset of the filter of the search request, and thus has an unsearched range. Therefore, the copy information used is each copy information of the entry information E31, E32, E33, and E34. By using this, the DI in the own device 10 is
The search result is created by merging with the search result (DSA1) for B24.

However, in this case, from the relationship between the search condition (base and filter) of the search request and the search condition corresponding to the copy information, only a part of the original search range is actually executed. .

In order to instruct this to the user, the DSA process 22 sets {/ C: Japan} in the unsearched part of the search result, and transmits it to the DUA process 20. In the unlikely event that the user who receives this result has the information that he or she has not found in the search result, the user is set in the unsearched part {/ C: Japan}.
Is issued, and a search request is issued again when copying is disabled.

By performing the above processing, when a search request of the same type is requested, the search request is for the network information existing in the DIBs 34 and 44 on the other information processing apparatuses 12 and 14. However, since only the own DSA process 22 can use the copy information acquired in the previously executed process stored in the cache information table 26a in the storage unit 26, the process can be performed.
The response performance of the distributed directory system is improved.

Next, a case where the registration time of the copy information can be registered as management information in addition to the copy information of the cache information table 26a created on the storage unit 26 will be described.

In this case, the DSA process 22 registers the copy information in the process of creating the cache information table 26a shown in the flowchart of FIG. 4 (step A2).
The registration time is also registered as management information at the same time. FIG.
Shows an example of a cache information table 26a registered by adding a registration time to each copy information.

The DSA process 22 deletes copy information that has passed for a certain period of time according to the procedure shown in the flowchart of FIG. 9 based on the registration time of the copy information registered in the cache information table 26a. This process is executed when the cache information table 26a is created or referred to, or when the processing load on the DSA process 22 is light.

First, the DSA process 22 obtains the current time (for example, 94.3.9.15:00) (step C1), and based on this time, the cache information table in the storage unit 26 as shown in FIG. A comparison is made with the registration time of each copy information registered in 26a.

For example, the copy information to be deleted is defined in advance as one or more years old. In this case, D
The SA process 22 deletes the entry information E41 (copy information) because the registration time of the entry information E41 in FIG. 8 has passed six years (step C3).
The entry information 42 is the latest information since several days have passed. The entry information 43 is deleted from the cache registration table 26a because it is determined that two years have passed since the registration time. Thus, processing is performed on all entry information (copy information) (step C).
4).

As described above, by adding the information on the registration time to the copy information registered in the cache registration table 26a, the copy information registered in the cache registration table 26a is maintained at the latest, that is, valid contents as network information. You can keep.

Next, a case is described in which the copy information of the cache information table 26a created on the storage unit 26 can be registered by adding the number of times of access indicating how many times the copy information has been used as management information. explain.

In this case, the DSA process 22
And a reference process to the cache information table 26a shown in the flowchart of FIG. In the reference process shown in FIGS. 10 and 11, a process for incrementing the number of accesses registered as management information when accessing copy information is added to the flowcharts showing the procedure of the reference process shown in FIGS. 6 and 7. (Fig. 1
Step D13). The processing other than Step D13 is the same as the processing shown in the flowcharts of FIGS. FIG. 12 shows a cache information table 26 in which the number of accesses is added to each copy information and registered.
An example of “a” is shown. Note that the initial value of the number of accesses registered in the cache information table 26a is “0”.

In the cache information table 26a in the storage unit 26 shown in FIG. 12, a search for the mail address of "Kazuyuki Ikenoya" of "company X" is requested 30 times through the DUA process 20, and the search of the "company X" 20 searches for Koichi Hashimoto's email address,
This shows the registration status when the mail address of "Yoshi Masuo" of "Company X" is requested once.

The DSA process 22 refers to the number of times of access to the copy information registered in the cache information table 26a, and according to the procedure shown in the flowchart of FIG. And delete the copy information that is less. This process is executed when the cache information table 26a is created or referred to, or when the processing load on the DSA process 22 is light.

The DSA process 22 refers to the number of times of access to the copy information registered in the cache information table 26a on the storage unit 26. As shown in FIG. 12, the access counts of the entry information E51, E52, and E53 are 30, 20, and 1, respectively. DSA process 22
Compares the number of times of access of each entry information (copy information), and determines whether there is copy information with an extremely small number of times of access, based on information indicating a preset difference in the number of times of access (step E1). . In this case, DSA
The process 22 determines that the entry information E53 (copy information) is used only once and has an extremely small number of accesses, and deletes the entry information E53 (copy information) (step E2).

As described above, by adding information on the number of times of access to the copy information registered in the cache registration table 26a,
The copy information registered in “a” can be maintained in a content effective for the user. Although FIG. 12 shows a case where the copy information is registered with the number of accesses added thereto, the registration may be performed simultaneously by combining the registration times as shown in FIG. 8 described above. As a result, the latest and valid copy information is stored in the cache registration table 2.
6a can be registered and maintained.

Next, a case where the hash value of each RDN constituting the identification name of the copy information is added to the copy information of the cache information table 26a created on the storage unit 26 as the management information so that it can be registered. Will be described.

When the user receives a search request from the DSA process 22 via the DUA process 20, that is, the identification name of the entry to be searched, the DSA process 22 outputs the RDN to the hash calculator 28.

The hash operation unit 28 performs the DSA process 2
2 and outputs a hash value to the DSA process 22 for each RDN. The DSA process 22 writes the corresponding RDN together with the hash value of each RDN output from the hash calculator 28 into the storage 26 as search request information 26a. FIG. 14 shows search request information 2
An example of the identification name of the search target written as 6a is shown.

The DSA process 22 refers to the search request information 26b stored in the storage unit 26 and performs copy processing when executing the process of creating the cache information table 26a according to the procedure of the flowchart shown in FIG. The hash value of each RDN constituting the identification name of the information is also registered.
FIG. 15 shows an example of the cache information table 26a in which the hash value of each RDN constituting the identification name of each copy information is registered.

In this case, the DSA process 22
Cache information table 26a shown in the flowchart of FIG.
, That is, whether the copy information satisfies the search condition is determined using the hash value of the RDN for the collation of the identifier.

Here, the DSA process 22 makes a search request for the mail address of “Kazuyuki Ikenoya” of “company X” via the DUA process 20 (base: $ / C: Japan /
0: Company X / CN: Kazuyuki Ikenoya, Filter: *)

In this case, the DSA process 22 executes the processes shown in the flowcharts of FIGS. 6 and 7 until the pre-processing for checking whether the copy information satisfies the search condition. Here, the collation of the identifier indicating the base of the search target with the identifier of the copy information is realized by comparing the RDNs constituting the identifier.

In the comparison of the RDN, the DSA process 22 compares the hash values registered in the cache information table 26a, and determines the actual RD
N is compared.

That is, the RDN @ C of the identification name to be searched is
N: In comparison with Kazuyuki Ikenoya, the hash value “30”
Then, the hash value of the RDB of the copy information in the cache information table 26a is compared with the RDN of the identification name to be searched (step F1).

If the hash values match, it is actually compared whether the RDN of the copy information matches the RDN of the search target {CN: Kazuyuki Ikenoya} (step F2). This comparison process is performed for each copy information stored in the cache information table 26a (step F3), and the corresponding copy information is searched.

When the method using such a hash value is used, the RDN comparison is performed in two stages. However, since the data length of the RDN is usually several tens of bytes, the data length of the hash value is changed to the data length of the RDN. Small enough, for example 1
If the number of bytes is about the same, it is possible to narrow down the copy information as candidates in a short comparison processing time. Therefore, RDN
Can be reduced, and the processing time required for searching for copy information can also be reduced.

[0079]

As described above in detail, according to the present invention, an information processing apparatus which realizes a cache function of a DSA process in a distributed directory system is provided with search result entry information which does not exist in the DIB in the search request source apparatus. Is stored in the cache information table, and then, when a search request that allows use of copy information is executed, the response performance in the distributed directory system can be improved by performing the operation using the cache information table. is there.

[0080] Also, to set the registration time to copy information registered in the cache information table, by deleting the elapsed copy information for a predetermined time that is referring to the registration time, registered in the cache information table Copy information can be kept up to date.

The number of accesses indicating the number of times of use is set for each copy information registered in the cache information table, and the number of accesses is extremely small compared to other copy information by referring to the number of accesses. By deleting unnecessary copy information from the cache information table by deleting the copy information, it is possible to maintain the cache information table in which copy information valid for the user is registered.

Further, a hash value is assigned to each RDN constituting an identification name, which is a search key for copy information registered in the cache information table, and a search is performed using a hash value that can be processed in a short time, and By performing the actual RDN comparison after narrowing down the copy information, the search speed as the entire process can be improved as compared with the case where the comparison based on the hash value is not performed.

[Brief description of the drawings]

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

FIG. 2 shows information processing apparatuses 10, 12, and
The figure which shows an example of the content of the network information stored in 14 DIB24,34,44.

FIG. 3 shows operation result information 2 stored in a storage unit 26 in the embodiment.
FIG. 9 is a diagram showing an example of a search result (entry information of search results from another DSA process) written as 6c.

FIG. 4 is a cache information table 26 in the embodiment.
9 is a flowchart for explaining the operation of the creation processing of a.

FIG. 5 is a diagram illustrating a search result (entry information E31) from another DSA process stored in a storage unit 26 according to the present embodiment.
-E34) showing an example of the cache information table 26a including the cache information table 26a.

FIG. 6 is a cache information table 26 according to the embodiment.
9 is a flowchart for explaining a part of the operation of the reference process of FIG.

FIG. 7 is a cache information table 26 in the embodiment.
9 is a flowchart for explaining a part of the operation of the reference process of FIG.

FIG. 8 is a diagram showing an example of a cache information table 26a registered by adding a registration time to each copy information in the embodiment.

FIG. 9 shows a cache information table 26 using a registration time added to each copy information and registered in the embodiment.
14 is a flowchart for explaining the operation of processing for maintaining the latest copy information of a.

FIG. 10 is a flowchart illustrating a part of an operation of a reference process of a cache information table to which an increment process of the number of times of access of copy information is added according to the embodiment;

FIG. 11 is a flowchart for explaining a part of the operation of the reference processing of the cache information table 26a to which the increment processing of the access number of the copy information is added in the embodiment.

FIG. 12 is a diagram showing an example of a cache information table 26a in which the number of accesses to copy information is added to each copy information and registered in the embodiment.

FIG. 13 is a flowchart for explaining an operation of a process for maintaining the validity of the copy information in the cache information table 26a by using the number of accesses added to each copy information and registered in the embodiment.

FIG. 14 is a diagram showing an example of an identification name of a search target written as search request information 26a in the embodiment.

FIG. 15 is a diagram showing an example of a cache information table 26a in which a hash value of each RDN constituting an identification name of each copy information is registered in the embodiment.

FIG. 16 is a flowchart for explaining the operation of the comparison process using the hash value of each RDN in the comparison process between the identifier of the copy information and the identifier of the search target in the embodiment.

FIG. 17 is a block diagram showing a schematic configuration of a directory system in which DIBs are distributed.

FIG. 18 is a diagram showing an example of a logical data structure of DIB.

[Explanation of symbols]

10, 12, 14 ... information processing device, 18 ... communication line, 2
0 ... DUA (directory user agent) process, 22, 32, 42 ... DSA (directory system agent) process, 24, 34, 44 ... DIB
(Directory information base) 26 storage unit 28 hash operation unit

Claims (10)

(57) [Claims] The logical data structure is a tree structure.
Network stored in the entry located in the section
Storage means for storing partial information of the network information distributed above, first processing means for performing an operation on the information stored in the storage means, and a tree for the storage means from a user And a second processing means for receiving a processing request based on the structure and transmitting the processing request to the first processing means, wherein a plurality of information processing apparatuses are connected via a communication line and the first processing of each apparatus is performed. An information processing device for realizing a distributed directory system capable of requesting a processing request between means, a cache information table for storing operation results for information stored in storage means in another information processing device; (2) If the processing request from the processing means is a processing request for information stored in the storage means in another information processing apparatus, the operation result corresponding to the processing request is stored in the previous information processing apparatus. An operation result accumulation unit that accumulates in the cache information table; and a table that executes an operation in response to a processing request from the second processing unit by using the operation result accumulated in the cache information table by the operation result accumulation unit. An information processing apparatus for realizing a distributed directory system, comprising: an operation unit. 2. A processing request from the second processing means includes:
A search condition based on the tree structure for specifying network information stored in the storage unit, wherein the operation result storage unit is based on the tree structure unique to each information that can be specified based on the search condition. The entry that is the main body of the operation object corresponding to the identifier
2. The information for realizing a distributed directory system according to claim 1, wherein copy information composed of the stored information and search conditions when the copy information is acquired are associated with each other and stored in the cache information table. Processing equipment. (3)Storing means for storing information;
First processing for executing an operation on the information stored in the means
Means, and the storage means from the user Processing request
Second processing means for receiving and transmitting the first processing means to the first processing means.
Information processing device having a plurality of information processing devices
Connected via a communication line and processed between the first processing means of each device.
Distributed directory system capable of requesting management requests
Information processing device, For information stored in storage means in another information processing device
Cache information table for storing operation results
When, The processing request from the second processing unit is in another information processing device.
Is a processing request for information stored in the storage means
In this case, the operation result for the processing request is
Operation result accumulation means for accumulating in the cache information table; In response to a processing request from the second processing means,
Stored in the cache information table by the result storage means
Table operation that executes an operation using the performed operation result
Means,  The operation result accumulation means,information Is stored in the cache information table,
Same informationIt is registered in association withthis Based on the time corresponding to each registered information,Constant
Over timeStored in the cache information table
informationThe copy information stored in the cache information table.
The feature is that the information is always registered within a predetermined time
TossDispersionInformation processing equipment to realize directory system
Place. (4)Storing means for storing information;
First processing for executing an operation on the information stored in the means
Means and a processing request from the user to the storage means.
Second processing means for receiving and transmitting the first processing means to the first processing means.
Information processing device having a plurality of information processing devices
Connected via a communication line and processed between the first processing means of each device.
Distributed directory system capable of requesting management requests
Information processing device, For information stored in storage means in another information processing device
Cache information table for storing operation results
When, The processing request from the second processing unit is in another information processing device.
Is a processing request for information stored in the storage means
In this case, the operation result for the processing request is
Operation result accumulation means for accumulating in the cache information table; In response to a processing request from the second processing means,
Stored in the cache information table by the result storage means
Table operation that executes an operation using the performed operation result
Means,  The operation result accumulation means,information The number of timesSame informationAlso register in association with
And registered by the operation result accumulation means.Each informationCompatible with
Based on the number of times the cache information
TableinformationInformation management means for deleting
And further stored in the cache information table.informationAlways
Distributed directory characterized by being effective
Information processing device that implements the system. 5. The processing request from the second processing means includes:
A search condition for specifying information stored in the storage means.
And the operation result accumulating means specifies based on the search condition.
Distinguished name unique to each possible information and operation corresponding to the same distinguished name
Copy information consisting of information that is the target body and the same copy
The search condition at the time of acquiring the information is associated with the
And storing the information in a cache information table.
Implementing the distributed directory system according to claim 3 or claim 4.
The information processing device that appears. 6. The information can be specified by an identifier.
Stored storage means and information stored in the storage means
A first processing means for performing an operation on the
Specifying information based on the identifier for the storage means;
Receiving a processing request including a search condition for
Processing apparatus having second processing means for transmitting to processing means
And a plurality of information processing devices are connected via a communication line.
Processing requests can be requested between the first processing means of each device
Information processing device to realize a simple distributed directory system
Of the information stored in the storage means in another information processing apparatus.
Cache information table for storing operation results
And the identification name indicated by the search condition of the processing request
Hash function that calculates a hash value from each relative identifier
Calculation means and a processing request from the second processing means in another information processing apparatus.
Is a processing request for information stored in the storage means
In this case, as the operation result for the processing request,
The same identifier as the unique identifier for each piece of information that can be identified based on the case
Copy consisting of information that is the main body of the operation target corresponding to the name
Correspondence between information and search conditions when the same copy information was acquired
And the identifier and information indicated by the search condition
A hash value is added to the relative distinguished name of the unique
Operation results stored in the cache information table in the device
Result storage means and the operation result in response to a processing request from the second processing means.
Stored in the cache information table by the result storage means
Indicated by the search condition using the performed operation result
The hash value of each relative distinguished name of the distinguished name and the cache
Compare the hash value stored in the information table with the
After narrowing down the information of the operation target based on the comparison result
, The distributed directory system characterized by comprising a table operation means for executing an operation, the
Information processing device that realizes. 7. The logical data structure is a tree structure, and the tree
Network stored in the entry located in the section
Some information of the network information distributed on
Storage means and information stored in the storage means
First processing means for executing an operation, and the accumulation from a user
Before receiving the processing request based on the tree structure for the means
Information having second processing means for transmitting to the first processing means
A processing device, wherein a plurality of information processing devices are connected via a communication line.
Connected to the first processing means of each device to process requests.
Information processing to realize a reliable distributed directory system
In management system, the processing request from the second processing means another information processing apparatus
Is a processing request for information stored in the storage means
In this case, the operation result for the
Stored in the cache information table, and responds to a processing request from the second processing means.
Operation using the operation results stored in the cache information table
Distributed directory system characterized by executing
How to achieve. 8. The information can be specified by an identifier.
Stored storage means and information stored in the storage means
A first processing means for performing an operation on the
Specifying information based on the identifier for the storage means;
Receiving a processing request including a search condition for
Processing apparatus having second processing means for transmitting to processing means
And a plurality of information processing devices are connected via a communication line.
Processing requests can be requested between the first processing means of each device
Information processing device to realize a simple distributed directory system
In this case, the processing request from the second processing unit is transmitted to another information processing apparatus.
Is a processing request for information stored in the storage means
Unique to each information that can be identified based on the search conditions
Of the operation target corresponding to the
Information consisting of information and the
Correlate search conditions with the cache information
And copy information in the cache information table
The registered time is registered in association with the copy information, and each copy information registered in the cache information table is registered.
Based on the time corresponding to the
The copy information stored in the cache information table is deleted, and in response to a processing request from the second processing unit, the cache information is deleted.
Operation using the operation results stored in the cache information table
Distributed directory system characterized by executing
How to achieve. 9. The information can be specified by an identifier.
Stored storage means and information stored in the storage means
A first processing means for performing an operation on the
Specifying information based on the identifier for the storage means;
Receiving a processing request including a search condition for
Processing apparatus having second processing means for transmitting to processing means
And a plurality of information processing devices are connected via a communication line.
Processing requests can be requested between the first processing means of each device
Information processing device to realize a simple distributed directory system
In this case, the processing request from the second processing unit is transmitted to another information processing apparatus.
Is a processing request for information stored in the storage means
Unique to each information that can be identified based on the search conditions
Of the operation target corresponding to the
Information consisting of information and the
Correlate search conditions with the cache information
The number of times the copy information was used is stored in the
Sign in association response, each copy information registered in the cache information table
Based on the number of times of use corresponding to
The copy information stored in the report table is deleted, and in response to a processing request from the second processing means, the cache information is deleted.
Operation using the operation results stored in the cache information table
Distributed directory system characterized by executing
How to achieve. 10. The information can be specified by an identification name.
Storage means stored in the storage means, and information stored in the storage means.
First processing means for performing an operation on the information, and from the user
Information based on the identifier for the storage means of
Receiving a processing request including a search condition for performing
Information processing apparatus having second processing means for transmitting to processing means
And a plurality of information processing devices connected via a communication line.
It is possible to request processing requests between the first processing means of each device.
Information Processing Device for Realizing Distributed Directory System
In, the processing request from the second processing means another information processing apparatus
Is a processing request for information stored in the storage means
In this case, as the operation result for the processing request,
The same identifier as the unique identifier for each information that can be identified based on the case
Copy consisting of information that is the main body of the operation target corresponding to the name
Correspondence between information and search conditions when the same copy information was acquired
And the identifier and information indicated by the search condition
A hash value is added to the relative distinguished name of the unique
The information is stored in the cache information table in the device, and the operation result is stored in response to a processing request from the second processing unit.
Stored in the cache information table by the result storage means
Indicated by the search condition using the performed operation result
The hash value of each relative distinguished name of the distinguished name and the cache
Compare the hash value stored in the information table with the
After narrowing down the information of the operation target based on the comparison result
, A distributed directory characterized by performing an operation
How to implement the system.