JP3464175B2 - Transmission device and transmission method, reception device and reception method, and transmission / reception system and transmission / reception method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a transmission / reception system and transmission / reception method, and a reception / transmission method, which have a hierarchical structure and are suitable for simultaneous distribution of data distributed and arranged on a network The present invention relates to a device and a receiving method.

[0002]

2. Description of the Related Art Various methods have been proposed as data distribution methods. For example, on the current Internet, TCP / IP (Transmission Control Protocol) such as http (Hyper Text Transfer Protocol) is used.
/ Internet Protocol) is used as the basic protocol. In TCP / IP, a receiving side receiving data distribution makes a call to a data transmitting side of data, and a connection is established between the transmitting side and the receiving side every time data is transmitted / received. It is supposed to be done. Therefore, highly reliable data distribution can be performed. On the other hand, the load on the transmission side and the network becomes large, and it may be difficult to perform efficient data distribution.

That is, when the number of terminals receiving data is increased and the access to the server providing the data is concentrated, a large load is placed on the server and the network, and even if the data is requested, the data is obtained before the data is obtained. It could take a lot of time.

Therefore, data distribution can be performed, for example, by a satellite line or a CATV (Cab
(le Television) line, terrestrial digital broadcasting which is planned to be put into practical use, and the like.
In this case, the load on the server and the network is not affected by the increase in the number of terminals.

On the other hand, in recent years, with the development of digital communication networks such as the Internet, enormous amounts of data have been accumulated on the networks, and there is a demand for efficient use of this enormous amount of data. Therefore, a directory service, which hierarchically manages data distributed and existing on the network and provides it to users, has been attracting attention. By using the directory service, users can quickly find the information they need from the information that is distributed over the network,
It becomes possible to access.

[0006] The directory service is, for example, X.264 based on the international standard OSI (Open Systems Interconnection). It is defined as the 500 series.
X. According to 500, a directory is a collection of open systems, and each open system cooperates,
It is defined as having a logical database of information about a collection of real-world objects.

X. According to the main directory service of 500, it is possible to search and browse the information held in the directory. Further, a directory service also provides a list like a telephone directory and user authentication. In addition, directory services name objects in a way that is especially easy for human users to remember, guess, and recognize.

Incidentally, this X. The directory service by 500 is extremely comprehensive, has a very large program size, and is very difficult to realize on the Internet using TCP / IP as a protocol. for that reason,
A lightweight directory service for TCP / IP, such as LDAP (Lightweight Directory Access Protocol), has been proposed.

In recent years, it has been proposed to provide the above-mentioned directory service by the data transmission means for performing the above-mentioned simultaneous broadcast, that is, satellite lines, CATV lines, terrestrial digital broadcasting and the like. In this case, the information provided by the directory service is unidirectionally provided, and the user cannot request the information. Therefore, as the directory information by the directory service, the same information is repeatedly transmitted. On the user side, the transmitted information is used, for example, by connecting it to a television receiver or the like, which is an IRD (Integrated) receiver for digital broadcasting.
Reciever Decoder) and STB (Set Top Box).

Here, the synchronization of information between the directory server side and the user side, that is, synchronization management will be considered.
The directory server side detects substantive directory updates and responds to dynamic changes in the directory hierarchical structure. The directory information reflecting the change in the hierarchical structure of the directory is transmitted to the user. At this time, if all the directory information is transmitted, the amount of data to be transmitted becomes enormous, so only the difference in change is extracted and transmitted.

On the directory server side, every time the update of the directory information is detected, or at regular intervals,
The difference update data is transmitted to the user. The user always receives the differential update data based on the update of the directory, and updates the directory information accumulated by the received differential update data, so that the directory information can be synchronized between the directory server and the user. it can.

[0012]

By the way, when the directory service is used by the user, the directory can be filtered. The filtering mask for performing the filtering process is set according to the user's tendency to access the directory and his / her preference. For example, a filtering mask is set for a specific information genre according to the user's preference. The user can selectively access the directory information for which the filtering mask is set. By performing the filter process, the user does not need to hold or process unnecessary information.

On the other hand, STB and IRD as described above
Is expected to lack computer resources such as memory capacity and processing capacity. Therefore, these STBs
When using the IRD or the IRD as the receiving side, it is necessary to prioritize and process the difference update message that seems to be more important. However, there has been a problem in the prior art that there is no mechanism that sets a priority to the more important difference update data and performs processing based on the priority of the received difference update data.

Therefore, an object of the present invention is, in a directory service for transmitting a directory structure, a transmitting / receiving system capable of performing a directory structure changing process based on difference update information on the receiving side in a more important order. And a transmitting / receiving method, and a receiving device and a receiving method.

[0015]

In order to solve the above-mentioned problems, the present invention transmits and receives a hierarchical structure of a directory that hierarchically manages the location of contents, and receives and transmits the hierarchical structure of the transmitted directory. in the system, a node of the hierarchical directory structure, consisting of and your container entry capable of storing information of the node under, if there under the container entry, a leaf entry can not be stored information of the nodes of his subordinate First management means for managing the hierarchical structure of the directory and a change in the hierarchical structure of the directory managed by the first management means are detected,
Based on the result of the detection, a detecting unit that obtains first difference information that is a difference between changes in the container entry and second difference information that is a difference between changes in the leaf entry, and a first difference information obtained by the detecting unit. A transmitting unit that transmits the difference information and the second difference information, a receiving unit that receives the first difference information and the second difference information that are transmitted by the transmitting unit, and a first unit that is received by the receiving unit. Second management means for managing the hierarchical structure of the directory configured based on the difference information and the second difference information, and the second difference information selectively received by the second difference information received by the reception means According to the difference information of
Ri second to change the hierarchical structure of directories managed by the management means have a changing means for, changing means, preset of
Priority over the second difference information based on the order of priority
Grading and using the second difference information based on priority
This is a transmission / reception system characterized by making changes .

Further, according to the present invention, in a transmission / reception method of transmitting a hierarchical structure of a directory for hierarchically managing the location of contents and receiving the hierarchical structure of the transmitted directory, a node of the directory hierarchical structure Manages a hierarchical structure of a directory consisting of a container entry that can store information on nodes under it and a leaf entry that is under the container entry and cannot store information about nodes under it. 1 management steps and 1
The change in the hierarchical structure of the directory managed by the management step is detected, and based on the detection result, the first difference information including the difference between the changes in the container entry and the second difference information including the difference between the changes in the leaf entry are detected. A detection step of obtaining the difference information, a transmission step of transmitting the first difference information and the second difference information obtained in the detection step, and a first difference information transmitted in the transmission step. A second step of managing the hierarchical structure of the directory configured based on the receiving step of receiving the second difference information and the first difference information and the second difference information received in the receiving step. steps and, directory managed by the second difference information selectively uptake, by the second difference information captured in the second management step that is received in the receiving step Possess a step change for changing the hierarchical structure, the changing step, the preset priority
Prioritize the second difference information based on the order.
Yes, change using second difference information based on priority
This is a transmission / reception method characterized by doing so.

Further, the present invention is a receiving device for receiving a hierarchical structure of a directory for hierarchically managing the location of the transmitted content, the transmitted directory
A node of the hierarchical structure, and your container entry capable of storing information of the node under, if there under the container entry, the hierarchical structure of the directory consisting of a leaf entry can not be stored information of the nodes of his subordinate Receiving means for receiving the first difference information consisting of the difference in the change of the container entry and the second difference information consisting of the difference in the change of the leaf entry, which are obtained by detecting the change in Management means for managing the hierarchical structure of the directory configured based on the first difference information and the second difference information that have been obtained, and the second difference information received by the receiving means are selectively taken in and taken in. have a changing means for changing the hierarchical structure of directories managed by <br/> management unit by the second difference information, changing means, preset priority
Prioritize the second difference information based on the order of degrees
And make changes using the second difference information based on priority.
The receiving device is characterized in that

Further, the invention has been transmitted, a receiving method for receiving a hierarchical structure of directories hierarchically manage location of the content, the transmitted directory
A node of the hierarchical structure, and your container entry capable of storing information of the node under, if there under the container entry, the hierarchical structure of the directory consisting of a leaf entry can not be stored information of the nodes of his subordinate And a step of receiving the first difference information, which is obtained by detecting the change in the change in the container entry, which is the difference in the change in the container entry, and the second difference information, which is the difference in the change in the leaf entry. The management step of managing the hierarchical structure of the directory configured on the basis of the first difference information and the second difference information received by the second difference information, and the second difference information received in the receiving step are selectively taken in. , possess a change step of changing the hierarchical structure of the managed second management step by the difference information captured directory, change stearate Flop, a preset order of priority of
Prioritize the second difference information based on the order,
Make changes using the second difference information based on priority
The reception method is characterized in that

As described above, claims 1 and 5
In the invention described in (3), the sender manages a hierarchical structure of a directory that includes a container entry that can store information under its own and a leaf entry that is under the container entry and cannot store information under its own. Then, the first difference information including the difference between the changes in the container entry and the second difference information including the difference between the changes in the leaf entry, which are obtained as a result of detecting the change in the hierarchical structure of the directory, are transmitted. The receiving side receives the transmitted first difference information and second difference information, selectively fetches the received second difference information, and prioritizes the processing based on a preset priority order. Since the hierarchy is set and the hierarchical structure of the directory configured and managed based on the received first difference information and second received difference information is changed, it is managed on the receiving side. Changes of the hierarchical structure of directories, from the portion corresponding to the second difference information which the priority is set higher can be performed sequentially.

Further, as described above, the inventions according to claims 6 and 10 can store the transmitted information of the subordinates of the own, and the subordinates of the container entry which are subordinates of the own. The first difference information, which is the difference between the changes in the container entries, and the second difference, which is the difference between the changes in the leaf entries, are obtained by detecting the change in the hierarchical structure of the directory including the leaf entries that cannot store the information. The difference information and the received second difference information are selectively fetched, the process is prioritized based on a preset priority order, and the received first difference information and the second difference information are received. Since the hierarchical structure of the managed directory is changed based on the difference information of
This can be performed in order from the portion corresponding to the second difference information having the higher priority set.

[0021]

BEST MODE FOR CARRYING OUT THE INVENTION A first embodiment of the present invention will be described below with reference to the drawings. FIG. 1 shows an example of a system applicable to the present invention. The transmission side 1 organizes a large number of contents existing on a network (not shown) such as the Internet or a broadcasting network into a tree-shaped hierarchical structure and manages it as a directory structure. The transmitting side 1 transmits the directory information indicating this directory structure to the broadcast network 2. As shown in an example in FIG. 2, a large number of receiving sides 3 are connected to the broadcast network 2 and are capable of receiving broadcasts made via the broadcast network 2. The receiving side 3 receives the directory information broadcast on the broadcast network 2, refers to the received directory information, and selects necessary information from a large number of information existing on the broadcast network 2 and other networks. Can be obtained.

As shown in FIG. 1 by way of example, the sender 1
Is a sender directory service client 10 (hereinafter abbreviated as a sender client 10), a sender directory server 11 (hereinafter abbreviated as a sender server 11), and a sender directory server replicator 12 (hereinafter, abbreviated as
It is abbreviated as the transmitting side replicator 12). The transmitting side client 10, the transmitting side server 11, and the transmitting side replicator 12 are connected to each other through a network such as the Internet, and communicate with each other.

The transmitting client 10 is a content provider that provides content through, for example, a network (not shown), and changes or updates the directory structure. The transmitting client 10 may be located anywhere on the network. Sending server 11
Manages the directory structure by inquiring about the contents of the sending client 10 or changing the contents. Sending server 11
Can be distributed and configured on the network.
The transmitting side replicator 12 monitors the directory structure managed by the transmitting side server 11 and detects an update of the directory structure. Then, the transmitting side replicator 12
On the basis of this detection result, the structure before the update and the structure after the update are compared to extract the difference, thereby forming the difference update information of the directory structure. For the configuration of the difference update information,
It will be described later.

The difference update information is regularly transmitted to the broadcast network 2. Further, in the present invention, the entire information of the directory structure managed by the transmission side server 11 (hereinafter, referred to as all configuration information) is transmitted to the broadcast network 2. Although the details will be described later, the transmission interval of the difference update information and the transmission interval of all the configuration information are individually set. The receiving side 3 builds a local directory structure on the receiving side 3 based on the received difference update information and all the configuration information.

The receiving side 3 includes a receiving side directory server replicator 17 (hereinafter referred to as the receiving side replicator 17), a receiving side directory server 16 (hereinafter referred to as the receiving side server 16), and a receiving side directory service client 15 (hereinafter referred to as the receiving side directory server client 15). It is abbreviated as the receiving client 15. The receiving side 3 is, for example, a personal computer or an STB or IRD described in the related art, and the receiving side client 15 can access the directory structure to acquire and display a plurality of different types of data. For example, application software such as a WWW (World Wide Web) browser. Further, the receiving side server 16 is composed of a local database and stores directory information.

The receiving side replicator 17 receives all the configuration information, directory structure update information, update information difference information, and the like transmitted by the broadcast network 2. The receiving side replicator 17 updates the database locally stored in the receiving side server 16 based on the received information, and rebuilds the directory structure.
The receiving-side client 15 requests the necessary information from the receiving-side replicator 17, for example, according to a user's instruction. The receiving side replicator 17 searches the database of the receiving side server 16 based on this request, and returns, for example, the address of the requested information to the receiving side client 15. Based on this address, the receiving client 15 can access information existing on a network (not shown), for example.

The directory structure will be described with reference to FIG. The directory has a tree-like hierarchical structure as shown in the figure. Each node (node) of the tree is called an entry, and each entry stores information.
Three types of entries are defined: a root entry, a container entry, and a leaf entry. A container entry is an entry that can further include subordinate entries. Hereinafter, the hierarchy composed of container entries will be referred to as a container hierarchy.

Entries other than container entries are called leaf entries. Leaf entries are terminal nodes that cannot contain entries under them. Hereinafter, the hierarchy of leaf entries will be referred to as a leaf hierarchy. The leaf hierarchy is configured under the container entry.

The highest entry in the directory tree is called a root entry and is an entry showing the entire world completed by the directory structure. In addition,
Below, a container entry shall have at least one leaf entry or container entry under it.

An entry has a plurality of attributes. Of the attributes of the entry, the name uniquely identified in the directory tree is called the entry name. The entry name can specify the location of the entry in the directory structure. In the example of FIG. 3, the entry name A is given to the route entry. The entry directly under the root entry is the entry name A. B has the entry name A. C is given respectively. Hereinafter, the entry names are given to the respective entries, separated by periods in the order in which the hierarchical structure is traced from the root entry.

FIG. 4 shows an example of the structure of a container entry. A container entry has the attributes of the container entry itself and a list of the container entries and leaf entries under its control. The list of entries under it is
It can also contain no elements. Further, as shown in the figure, the container entry itself can have a plurality of attributes.

FIG. 5 shows an example of the structure of a leaf entry. The leaf entry has a plurality of leaf entry attributes, as shown in FIG. 5A. FIG. 5B is a more specific example of the attributes of leaf entries. Each attribute consists of an attribute name and an attribute value. For example, if a leaf entry is search information for content, one of the attribute names has an address, and the attribute value is URL (Uniform Resource).
Address information of contents such as Locator) is described.

The directory structure is constructed, for example, by arranging container entries in a tree structure according to the information genre, for example, under a root entry representing the entire world completed by the directory structure.

The configuration of the transmitting side 1 will be described more specifically. The transmission-side server 11 manages the directory structure in accordance with the configuration already described with reference to FIGS. The transmission side client 10 changes the directory structure managed by the transmission side server 11 according to the provided content. Sending server 1
Changes made to 1 are monitored by the transmitting replicator 12.

FIG. 6 is a functional block diagram for explaining the function of the transmitting-side replicator 12. The transmission side replicator 12 can be configured by, for example, a general computer system, and has a CPU (Central Processing Unit).
, A memory, a recording medium such as a hard disk, a communication means, a timer, and a user interface. The functional blocks shown in FIG. 6 are realized by application software operating on a CPU, and each module is a functional unit on the application software, and each module is composed of software.

The transmission side replicator 12 comprises an update detection module 20, a message generation module 21 and a message broadcasting module 22. Each of these modules 20, 21 and 22 has a module that performs processing related to the container hierarchy and a module that performs processing related to the leaf hierarchy.

The update detection module 20 refers to the transmission side server 11 to detect whether or not the directory structure managed on the server 11 has changed. The container hierarchy update detection module 23 and the leaf hierarchy update detection are performed. And module 24. The container layer update detection module 23 monitors the sender server 11 to detect a change in the structure of the container layer. The leaf layer update detection module 24 also monitors the transmitting server 11 to detect changes in the leaf layer structure and the contents of leaf entries.

The message generation module 21 is a module for generating a message indicating the difference update information of the directory structure based on the detection result of the change of the directory structure by the update detection module 20, and the container structure update message generation module 25.
And a leaf entry update message generation module 26. The container structure update message generation module 25 generates a message indicating the difference update information regarding the structural change in the container hierarchy based on the detection result of the container hierarchy update detection module 23. The leaf entry update message generation module 26 also generates a message indicating update information in the leaf hierarchy based on the detection result of the leaf hierarchy update detection module 24.

The message broadcasting module 22 is a module for broadcasting the message generated by the message generating module 21 to the broadcasting network 2, and comprises a container structure update message broadcasting module 27 and a leaf entry update message broadcasting module 28. The container structure update message broadcasting module 27 broadcasts the above-mentioned message generated by the container structure update message generating module 25. Also, the leaf entry update message broadcasting module 28
Broadcasts the message generated by the leaf entry update message generation module 26 described above. The message broadcast from the message broadcast module 22 to the broadcast network 2 is performed by cyclically transmitting the same message a predetermined number of times.

Next, the structure of the receiving side 3 will be described more specifically. FIG. 7 is a functional block diagram for explaining the function of the receiving client 15. The reception-side client 15 can be composed of, for example, a general computer system, and has a CPU (Central Processing Uni
t), memory, recording and storage media such as hard disk, communication means, user interface, etc. The functional blocks shown in FIG. 7 are realized by application software running on the CPU,
Each module is a functional unit on application software, and each module is software.

As described above, the receiving client 15 is, for example, a WWW browser so that the supplied contents such as image data, text data, audio data and moving image data can be displayed and reproduced in a unified manner. Has been done. Further, the above-mentioned display and reproduction can be controlled based on an instruction input by the user using a predetermined input means.

The reception side client 15 comprises a directory search module 30, a user interaction management module 31 and a content acquisition module 32. Also,
To the user interaction management module 31, a user interface 33 including a text input means such as a keyboard, a pointing device such as a mouse and a display device is connected. The user inputs a content search request to the reception side client 15 by using the user interface 33.
Interactively for 1.

When a content search request is input to the user interaction module 31, the user interaction management module 31 sends a request to the directory search module 30.
To retrieve the address of the content, a request is made to retrieve the directory entry corresponding to the content. In response to this search request, the directory search module 30 sends a directory entry search request to the receiving server 16.

The search result of the directory entry based on the search request in the receiving server 16 is returned to the directory search module 30. The search result is returned from the directory search module 30 to the user interaction management module 31. Then, for example, if the search result is a leaf entry, the address information of the content, which is one of the attributes, is extracted from the directory entry information of the search result. A content acquisition request is issued from the user interaction management module 31 to the content acquisition module 32 so as to acquire the content indicated by the retrieved address information.

The content acquisition module 32 sends a content acquisition request to the content server 35 based on the received content acquisition request. The content server 35 is a server that is connected to the receiving-side client 15 via a bidirectional network 36 such as the Internet, and provides content to users. The contents are provided by the bidirectional network 36.
The broadcast network 2 can also be used.

The content acquired from the content server 35 based on the content acquisition request is, for example, the content acquisition module 32 via the bidirectional network 36.
Are supplied to the user interaction management module 31 from the content acquisition module 32. The user interaction management module 31 outputs the received content to the user interface 33.

When the requested content is transmitted by the broadcast network 2, the content acquisition module 32 directly acquires the desired content broadcast by the broadcast network 2 based on the content acquisition request. You may do it.

FIG. 8 is a functional block diagram for explaining the function of the receiving server 16. This receiving server 16
Also, although the description is omitted, the above-mentioned receiving-side client 15
Similarly, is constituted by a general computer system. The receiving server 16 comprises a directory update request processing module 40, a directory database 41 and a directory search request processing module 42.

The directory database 41 stores directory information based on the directory structure managed by the transmitting server 11. As described above, the reception side replicator 17 receives the difference update information of the directory structure transmitted from the transmission side 1 via the broadcast network 2. The details will be described later, but the receiving side replicator 1
7 to the directory update request processing module 40 based on the difference update information, the directory database 4
A request is made to update the directory information stored in 1. Based on this request, the directory update request processing module 40 updates the directory information stored in the directory database 41 using the difference update information.

On the other hand, the directory entry search request from the receiving client 15 is received by the directory search request processing module 40. The directory search request processing module 40 searches the directory database 41 based on the received search request. Directory entries obtained as a result of searching,
For example, the address information in the leaf entry is returned from the directory search request processing module 42 to the receiving client 15.

By configuring the system as described above, the user can search the directory information by the receiving client 15 and obtain the address information to which the desired content is provided as the search result. Then, the user can acquire the desired content based on the obtained address information. Also, the directory structure is
It is constantly monitored by the transmission-side replicator 12, and the difference update information of the directory structure and all the configuration information are transmitted at the set intervals, and are supplied to the reception-side replicator 17 via the broadcast network 2. On the user side, the receiving side replicator 17 changes the directory information stored in the directory database 41 based on the supplied difference update information and all the configuration information. Therefore, the user can always hold the directory information synchronized with the actual directory structure in the directory database 41.

Next, FIG. 9, FIG. 10, FIG. 11 and FIG.
The difference update information and all configuration information of the above-mentioned directory structure will be described using. In the following, the process of adding or deleting the container entry C or the leaf entry 1 under the container entry X of a certain container hierarchy specified by the schema version Sv will be described (Sv,
X, [+/-] [C / l]). The description showing the processing for this directory structure represents the difference between the directory structure changed by the processing according to this description and the original structure, and this can be used as difference update information.

On the other hand, the entire configuration information is information indicating the directory structure at a certain point. By considering all the configuration information as a difference from the root entry, it is possible to express all the configuration information using the difference update information described above.

The schema version Sv is a value that changes as the directory structure changes. The container entry X (or C) is a container entry name, and is represented by capital letters here. Leaf entry l
Is a leaf entry name, which is represented here by lowercase letters. Entry addition is represented by [+], and deletion is represented by [-]. A slash mark in brackets [] indicates that one of the two characters written on both sides of the bracket is described. 9 and 10, double-lined squares represent container entries, and single-lined squares represent leaf entries. In the route entry, only the connecting line is shown and the body is omitted.

In FIG. 9A, a directory structure 100 is constructed in which only a container entry A exists under a root entry (not shown). This state is defined as the schema version Sv = 1. In this state, the processing of (1, A, + B) is performed according to the above description. That is, the container entry B is added under the container entry A. Then, the directory structure 101 shown in FIG. 9B is obtained. Since the container entry B is added to the state of FIG. 9A, it is considered that the hierarchical image of the container entry has changed, and the schema version Sv = 2.

Further to the state of FIG. 9B, (2, A, + a)
Process. That is, the leaf entry a is added under the container entry A. Then, the directory structure 102 shown in FIG. 9C is obtained. Furthermore, the process of (2, A, -a) is performed in the state of FIG. 9C. That is, the leaf entry a is deleted from the subordinate of the container entry A.
Then, the directory structure 103 shown in FIG. 9D is obtained.
Further, the processing of (2, A, -B) is performed in the state of FIG. 9D. That is, the container entry B is deleted from the subordinate of the container entry A. Then, the directory structure 104 shown in FIG. 9E is obtained.

In the state of FIG. 9E, since the hierarchical image of the container entry has changed from the state of FIG. 9D, the schema version Sv is updated and the schema version S
v = 3. Therefore, in the state of FIG. 9E, the process of adding the container entry C under the container entry A can be described as (3, A, + C). This processing results in the directory structure 105 shown in FIG. 9F.

In the example of FIG. 9, (1, A, + B),
(2, A, + a), (2, A, -a), (2, A,-
B) and (3, A + C) are the difference update information at each stage.

FIG. 10 shows another example of changing the directory structure. In the example shown in FIG. 9 described above, one process is performed at a time, but in FIG. 10, two processes are performed collectively. FIG. 10A shows the directory 106 in which only the container entry A exists under the root entry (not shown). This state is the schema version Sv = 1. For the state of FIG. 10A,
The processes of (1, A, + B) and (1, A, + a) are sequentially performed. That is, the container entry B and the leaf entry a are added under the container entry A. Then, the directory structure 107 shown in FIG. 10B is obtained. The hierarchical image of the container entry changes, and the schema version becomes Sv = 2.

In addition to the state of FIG. 10B, (2, A, −
The processes a) and (2, B, + b) are performed in order. That is, the leaf entry a is deleted from the subordinate of the container entry A, and then the leaf entry b is added to the subordinate of the container entry B. Then, the directory structure 108 shown in FIG. 10C is obtained.

In addition to the state of FIG. 10C, (2
B, + C) and (2, C, + c). That is, the container entry C is subordinate to the container entry C.
After adding, the leaf entry c is added under the added container entry C. In this process,
Since more entries are added to the added container entry, the processing before and after cannot be interchanged. After the processing, the directory structure 109 shown in FIG. 10D is obtained, and since the hierarchical image of the container entry has changed, the schema version Sv is updated and the schema version Sv = 3.

In the example of FIG. 10, (1, A, + B) and (1, A, + a), (2, A, -a) and (2,
B, + b), and (2, B, + C) and (2,
C, + c) is the difference update information at each stage. As described above, when performing a plurality of processes collectively as one directory structure update process, it is necessary to consider the order of the processes.

FIG. 11 shows an example of all the configuration information corresponding to FIG. 9 described above. All the configuration information is transmitted from the transmission side replicator 17 in a predetermined cycle T. Hereinafter, the cycle T in which all the configuration information is transmitted will be referred to as the all configuration information notification cycle T. In FIG. 11, it is assumed that the time elapses from the left side to the right side of the figure, and the intervals at which the structures 100, 101, 102, 103 and 104 and the directory structure are changed are constant. Further, here, the entire configuration information notification cycle T corresponds to the intervals of the structures 100 to 102 and the structures 102 to 104.

As described above, in this example, all the configuration information is represented as difference information from the root entry of the directory structure at a certain point in time. Therefore, all the configuration information corresponding to the structure 102 is (0, root, + A), (0, A, +) in the order of processing, as shown in FIG.
B) and (0, A, + a). That is, each process is performed on the root entry in this order, each entry is added, and the structure 102 is expressed as if configured. Similarly, in the structure 104, since only the container entry A exists under the root entry, all the configuration information corresponding to the time of the structure 104 is (0,
root, + A).

In the all-configuration information notification cycle T, the schema version Sv is reset to 0, and Sv in all configuration information is always 0.

FIG. 12 shows an example of all configuration information corresponding to FIG. 10 described above. In this example, structure 106-structure 1
The interval of 09 corresponds to the total configuration information notification cycle T ′.
All the configuration information corresponding to the structure 109 is (0,
root, + A), (0, A, + B), (0, B, +
b), (0, B, + C) and (0, C, + c).

The directory structure difference update information and the total configuration information are not limited to the above-mentioned examples, and can be in various formats depending on the system to which they are applied.

In the system to which the present invention is applied, as described above, the difference update information and the total configuration information are unidirectionally transmitted from the transmission side 1 to the reception side 3 via the broadcast network 2. Further, there are a plurality of receiving sides 3 for one transmitting side 1, and the operating states of the plurality of receiving sides 3 are also different. Therefore, it is necessary to synchronize the directory information managed by the transmitting side 1 and the directory information managed by the receiving side 3.

The directory information stored in the sender server 11 of the sender 1 and the receiver server 1 of the receiver 3 will be described below.
A method for synchronizing and managing the directory structure by synchronizing with the directory information stored in 6 will be described.

First, the container entry synchronization management method will be described with reference to the flowchart of FIG. First, in step S1, the transmitting client 10 changes the configuration of the container hierarchy of the directory structure managed by the transmitting server 11. For example, a process of adding a new container entry or a leaf entry under the container entry, or a process of deleting a container entry or a leaf entry under the container entry are performed.

In the next step S2, the transmitting server 11
A change made to the sender replicator 12 is detected, and based on the detection result, the container structure update information Msg. 1 is generated. The generated container structure update information Msg. 1 is broadcast to the broadcast network 2. Container structure update information Msg. One broadcast is performed by repeating the same content cyclically a predetermined number of times.

Broadcasted container structure update information Msg.
1 is received by the receiving side replicator 17 in step S3. The receiving-side replicator 17 receives the container structure update information Ms that has received the container hierarchical structure managed by the directory information stored in the receiving-side server 16.
g. Change based on 1. Thereby, the structure of the container hierarchy of the directory information is synchronized between the transmitting side 1 and the receiving side 3.

Container structure update information Msg. The format of 1 is, for example, It is defined in this way. "Message ID" (Message I
D) is this message (container structure update information Ms
g. The identification information 1) is, for example, an integer that is incremented by 1 each time this message is generated. Also,
"Differential update information" is due to changes in the container hierarchy
This is the difference update information of the directory structure described above.

The process of step S2 in the flowchart of FIG. 13 will be described in more detail with reference to the flowchart of FIG. All the processing according to the flowchart of FIG. 14 is performed on the transmitting-side replicator 12. First, in step S10, all the information on the hierarchical structure of the container entry on the transmitting server 11 is read. The read information on the hierarchical structure of the container entry is stored as a copy 1 in a recording or storage medium such as a memory or a hard disk included in the transmission side replicator 12.

When copy 1 is stored, the next step S
At 11, the timer is set to a predetermined time and started. In step S12, it is determined whether or not the predetermined time set in the timer has been exceeded. If it is determined that the predetermined time has been exceeded, the process proceeds to step S13. In step S13, all the information on the hierarchical structure of the container entry on the transmitting server 11 is read again.
The read hierarchical structure of the container entry is stored as a copy 2 in a recording or storage medium, such as a memory or a hard disk, which the transmitting side replicator 12 has.

In the next step S14, step S10
The copy 1 stored in step S13 is compared with the copy 2 stored in step S13. If there is no difference between the two as a result of the comparison (step S15), the process proceeds to step S1.
It is returned to 1, the timer is set again, and the copy 2 is stored.

On the other hand, if there is a difference between copy 1 and copy 2 in step S14, the process proceeds to step S14.
Move to 16. In step S16, difference update information is generated based on the difference between copy 1 and copy 2. Then, the container structure update information Msg. 1 is generated. The generated container structure update information Msg. 1 is transmitted to the broadcast network 2 and broadcast. The container structure update information Msg. 1 is received by the receiving side replicator 17.

In step S16, the container structure update information M
sg. When 1 is broadcast, the contents of copy 1 are replaced with the contents of copy 2 in the next step S17, and the process is returned to step S11.

The process of step S3 in the flowchart of FIG. 13 will be described in more detail with reference to the flowchart of FIG. The processing according to the flowchart of FIG. 15 is all performed on the receiving side replicator 17. In the first step S20, the container structure update information Msg. 1 is received by the receiving replicator 17.

In step S21, the reception in step S20 indicates that the container structure update information Msg. It is determined whether it is the first reception of 1. If it is determined that this reception is not the first reception, the process proceeds to step S23,
The received container structure update information Msg. The message ID 1 is stored as the copy 3 in a recording or storage medium such as a memory or a hard disk of the receiving-side replicator 17.

In the next step S24, the received container structure update information Msg. 1, that is, the container structure update information Msg. Based on the difference update information described in No. 1, the directory information managed by the receiving server 16 is updated, and the configuration of the container hierarchy indicated by the directory information is changed. After the processing of step S24, the processing is returned to step S20.

On the other hand, in the above-mentioned step S21, the container structure update information Msg. If it is determined that the reception of 1 is not the first reception, the process proceeds to step S2.
Move to 2. In step S22, the received container structure update information Msg. Message ID described in 1
And, in the process of step S23 at the time of the previous reception, copy 3
It is determined whether the message ID stored as is the same. If they are the same, the process is returned to step S20.

On the other hand, if it is determined in step S22 that both message IDs are not the same, the process proceeds to step S2.
Move to 3. In step S23, as described above,
The message ID is stored as copy 3 in the storage medium. In this case, the newly received message ID
Then, the previously received and stored message ID is overwritten, for example. Then, the next step S24
In the received container structure update information Msg. Based on 1, the content of the container entry hierarchy on the receiving side server 16 is changed.

Next, a leaf entry synchronization management method will be described with reference to the flowchart of FIG. First,
In step S30, the sending client 10
A leaf entry under a certain container entry in the directory structure managed by the transmitting server 11 is changed. For example, processing such as adding a new leaf entry under a certain container entry or deleting or modifying a leaf entry under a certain container entry is performed.

In the next step S31, the transmitting server 1
Changes made to leaf entries under a container entry of 1 are detected by the transmitting replicator 12. Then, based on the detection result, the leaf update information Msg. x1 is generated. The generated leaf update information Msg. The x1 is cyclically broadcast to the plurality of receiving-side replicators 17 via the broadcast network 2.

The leaf update information Msg. x1
Is received by the receiving replicator 17 in step S32. The reception-side replicator 17 receives the received leaf update information Msg. Based on x1, the receiving server 16
Change the corresponding leaf entry managed by the directory information stored in. As a result, the leaf entries of the directory information are synchronized between the sending side 1 and the receiving side 3.

Leaf update information Msg. The format of x1 is, for example, It is defined in this way. "Message ID" (Message I
D) is the message (leaf update information Msg.x).
The identification information 1) is, for example, an integer that is incremented by 1 each time this message is generated. The "difference update information" is the difference update information of the above-mentioned directory structure.

The process of step S31 in the flowchart of FIG. 16 will be described in more detail with reference to the flowchart of FIG. All the processing according to the flowchart of FIG. 17 is performed on the transmitting-side replicator 12. First, in step S40, all leaf entry names under a certain container entry on the transmission side server 11 are read. The read leaf entry name is stored as a copy 4 in a recording or storage medium such as a memory or a hard disk included in the transmission side replicator 12.

When copy 1 is stored, the next step S
At 41, a timer is set to a predetermined time and started. In step S42, it is determined whether or not the predetermined time set in the timer has been exceeded. If it is determined that the predetermined time has been exceeded, the process proceeds to step S43. In step S43, again on the transmitting side server 11,
All leaf entry names under a certain container entry are read. The read leaf entry name is stored as a copy 5 in a recording or storage medium, such as a memory or a hard disk, which the transmission side replicator 12 has.

In the next step S44, step S40
The copy 4 stored in step S43 is compared with the copy 5 stored in step S43. As a result of the comparison, if there is no difference between the two (step S45), the process is returned to step S41, the timer is set again, and the copy 5 is stored.

On the other hand, if it is determined in step S44 that there is a difference between copy 4 and copy 5, the process proceeds to step S44.
Move to 46. In step S46, difference update information is generated based on the difference between copy 4 and copy 5. Then, the leaf update information M in which this difference update information is described
sg. x1 is generated. Generated leaf update information M
sg. x1 is transmitted to the broadcast network 2,
Will be broadcast. The leaf update information Msg. x1
Is received by a plurality of receiving-side replicators 17.

In step S46, the leaf update information Msg.
When x1 is broadcast, copy 4 is sent in the next step S47.
Is rewritten with the content of copy 5, and the process is returned to step S41.

The processing of the flowchart of FIG. 17 described above is performed by the transmitting-side replicator 12 for all container entries in the directory structure managed by the transmitting-side server 11.

On the receiving side 3, the leaf update information Msg. x1 is present, the leaf update information Msg. When the leaf entry update processing based on x1 is performed, the change in the directory structure on the transmission side may not be reflected correctly, and inconsistency may occur in the updated directory structure.

Therefore, the leaf update information Msg.
x1, the leaf update information Msg. x
It is possible to add the differential update information that must be already processed when the leaf entry update process by 1 is performed. In the following, differential update information that must be already processed when performing update processing of a leaf entry based on certain leaf update information is referred to as a pre-exit message, and a message ID indicating the differential update information is referred to as a pre-exit message. Called ID.

The process when the pre-restrict message ID is used is different from the process when the pre-restrict message ID is not used in the following two points. One is that the process related to the container configuration update information (step S2) according to the flowchart of FIG. 13 described above is performed in a predetermined cycle based on a timer set in a predetermined cycle (referred to as a total configuration information notification cycle timer). Is. The second is that the process related to the leaf update information is performed for each container entry according to the flowchart in FIG.

Container configuration update information Msg. 1 indicates that every time an update of the container entry is detected, only the updated amount is broadcast as the difference update information, and is the period indicated by the all-configuration-information notification period timer, and all the configuration information of the directory structure, That is, the difference information from the route entry is broadcast. FIG. 18 shows the container configuration update information Ms corresponding to step S2 of the flowchart of FIG. 13 described above when the all configuration information notification period timer is used.
g. 2 is a flowchart showing an example of the processing of generating 1 and broadcasting.

All processing according to the flowchart of FIG. 18 is performed on the transmitting side replicator 12. First, in the first step S100, the all-configuration-information notification period timer T ₁ for measuring the all-configuration information notification period T is set to the step S1 described later.
The timer T ₁ is set to an integral multiple of the timer T ₂ set in 02, and the timer T ₁ is started. The detailed setting method of the value of the all-configuration information notification period timer T ₁ will be described later.

When the timer T ₁ is set, in the next step S101, all the information on the hierarchical structure of the container entry on the transmitting side server 11 is read. The read information on the hierarchical structure of the container entry is stored as a copy 6 in a recording or storage medium, such as a memory or a hard disk, which the transmission side replicator 12 has.

When the copy 6 is stored, the next step S
At 102, the timer T ₂ is set to a predetermined time and activated, and at the next step S103, the all-configuration-information notification period timer T ₁ set at the above-mentioned step S100.
Alternatively, it waits until any one of the timers T ₂ exceeds the set time. When either the timer T ₁ or the timer T ₂ exceeds the set time, the process proceeds to step S104.

In step S104, the above-mentioned step S
The timer exceeded in 103 is the all configuration information notification period timer T
It is determined whether it is ₁ . If the timer that has exceeded the set time is not timer T ₁ , ie,
If it is determined that the timer is T ₂ , the process proceeds to step S106.

On the other hand, if it is determined in step S104 that the total configuration information notification period timer T ₁ has exceeded, the process proceeds to step S105, and the contents of the copy 6 stored in step S101 described above are cleared. . By being cleared, the contents of copy 6 are limited to the root entry. When the contents of copy 6 are cleared, the process proceeds to step S106.

In step S106, all the information on the hierarchical structure of the container entry on the transmitting server 11 is read again. The read hierarchical structure of the container entry is stored as a copy 7 in a recording or storage medium such as a memory or a hard disk included in the transmission side replicator 12.

In the next step S107, the copy 6 described above is compared with the copy 7 stored in step S106. If there is no difference between the two as a result of the comparison (step S108), the process is returned to step S100, the all-configuration information notification period timer T ₁ is set again, and the subsequent processes described above are performed. Be seen.

It should be noted that the above-mentioned step S104 causes the all-configuration information notification period timer T ₁ to exceed,
If the contents of copy 6 are cleared in step S, step S
By comparing the copy 6 and the copy 7 in 107, the difference in the hierarchical structure of the container entry stored as the copy 2 with respect to the root entry is obtained.

On the other hand, if it is determined in step S108 that there is a difference between copy 6 and copy 7, the process proceeds to step S109. In step S109, difference update information is generated based on the difference between copy 6 and copy 7. Then, the container structure update information Msg. 1 is generated. The generated container structure update information Msg. 1 is a broadcast network 2
Will be sent to and broadcast. The container structure update information Msg. 1 is received by the receiving side replicator 17.

In step S109, the container structure update information Msg. When 1 is broadcast, in the next step S110,
The contents of copy 6 are replaced with the contents of copy 7, and the process returns to step S100.

The processing corresponding to step S3 of the above-mentioned flowchart of FIG. 13 in the receiving-side replicator 17 in this example is performed according to the above-mentioned flowchart of FIG.

In this example using the pre-return message ID, the leaf update information Msg. The leaf update information Ms with a pre-restriction message ID list is added to x1 by adding the above-mentioned pre-restriction message ID list.
g. Create x1. Leaf update information Msg. Leaf update information M with pre-exit message ID list in which the pre-exit message ID list is added to x1
sg. x1 is broadcast from the transmission side replicator 12 to the reception side replicator 17 at a predetermined interval for each container entry. Hereinafter, in order to avoid complexity, the “leaf update information Msg.x1 with pre-exit message ID list” is replaced with “leaf update information Msg.x1.
x1 ″ ”.

The pre-restriction message is the leaf update information Msg.j generated by the transmitting-side replicator 12 based on the change made to the leaf entry under the container entry. The history of x1 is created by referring to the differential update notification history table in which each container entry is listed. FIG. 19 shows an example of the difference update notification history table. As described above, in the differential update notification history table, the container entry name and the leaf update information M generated in accordance with the change of the leaf entry under the container entry.
sg. A list of x1 message IDs is described for each container entry.

In the transmitting replicator 12, the leaf update information Msg. x1 is created, the differential update notification history table is referred to, and the leaf update information Msg. Get the message ID of x1. The plurality of acquired message IDs are listed as a pre-exit message ID, and a pre-exit message ID list is created.

Leaf update information Msg. The leaf update information Msg. The format of x1 "is It looks like this. The message ID (MessageID) and the difference update information are the leaf update information Msg. It is equivalent to x1.

The process of step S31 in the flowchart of FIG. 16 when the pre-return message ID list is used will be described in more detail with reference to the flowchart of FIG. All the processes according to the flowchart of FIG. 20 are performed on the transmitting-side replicator 12. The process according to the flowchart of FIG. 20 is performed by the transmitting side replicator 12 for all container entries in the directory structure managed by the transmitting side server 11.

First, in the first step S120, the total configuration information notification period timer T for measuring the total configuration information notification period T
₁ ', is set to an integer multiple of the time the timer T ₂ is set in step S122 described later, the timer T ₁ is activated. Although the details will be described later, the all-configuration-information notification period timer T ₁ ′ is the all-configuration information notification period timer T ₁ described above.
And the time can be set separately. The method of setting the all configuration information notification period timer T ₁ 'will be described later.

When the timer T ₁ 'is set, in the next step S121, all leaf entry names under a certain container entry (referred to as container entry A) on the transmitting server 11 are read. The read leaf entry name is stored as a copy 8 in a recording or storage medium, such as a memory or a hard disk, which the transmission side replicator 12 has.

When the copy 8 is stored, the next step S
At 122, the timer T ₂ is set to a predetermined time and activated, and at the next step S123, either the all configuration information notification period timer T ₁ 'or the timer T ₂ set at the above step S120 is set. It will wait until the specified time is exceeded. If either the timer T ₁ 'or the timer T ₂ exceeds the set time, the process proceeds to step S124.

In step S124, the above-mentioned step S
The timer exceeded in 123 is the all configuration information notification period timer T
_It is judged whether it is ₁ '. If it is determined that the timer that has exceeded the set time is not timer T ₁ ′, that is, timer T ₂ , the process proceeds to step S126.

On the other hand, if it is determined in step S124 that the total configuration information notification period timer T ₁ 'has exceeded, the process proceeds to step S125 to clear the contents of the copy 8 stored in step S121. It By being cleared, the contents of the copy 8 are limited to the above-mentioned container entry A. When the contents of the copy 8 are cleared and only the predetermined container entries are made, the process proceeds to step S126.

In step S126, all leaf entry names under a certain container entry (container entry A in this example) on the transmitting side server 11 are read again. The read leaf entry name is stored as a copy 9 in a recording or storage medium, such as a memory or a hard disk, which the transmission side replicator 12 has.

In the next step S127, the copy 8 described above is compared with the copy 9 stored in step S126. As a result of the comparison, if there is no difference between the two (step S128), the process is returned to step S120, the all-configuration information notification period timer T ₁ 'is set again, and the subsequent processes described above are performed. Be seen.

On the other hand, if there is a difference between copy 8 and copy 9 in step S128, the process proceeds to step S129. In step S129, the leaf update information Msg. x
Acquire a list of message IDs of 1. In the next step S130, the obtained message ID list is used as a pre-restriction message ID list and the leaf update information Msg. x1 ″ is generated and broadcast.

The leaf update information Msg. In step S131, x1 ″ is added to the list of message IDs of the target container entries in the difference update notification history table.

When the message ID is added to the difference update notification history table in step S131, the contents of copy 8 are rewritten with the contents of copy 9 in step 132, and the process returns to step S120. .

In step S124, the all-configuration information notification period timer T ₁ 'has exceeded, and the next step S12
If the contents of the copy 8 are cleared in 5, the difference update information generated in step S S129 is such that a leaf entry is newly added to the container entry whose subordinate information is cleared. It

Step S12 in the above flowchart
In the process of 9, the transmitting-side replicator 12 transmits the leaf update information Msg. It is necessary to store x1 ″. Therefore, the transmission side replicator 12 performs the process of step S130 of the flowchart shown in FIG. 20 described above according to the flowchart shown in FIG.

First, in the transmitting side replicator 12,
For example, a predetermined storage area called a repository is set in a memory or a hard disk. 21, the first step S90 is the step S12 described above with reference to FIG.
9, the leaf update information M corresponding to the target container entry acquired by referring to the differential update notification history table
sg. The message IDs listed in the list of message IDs of x1 are used as the pre-exit message IDs and the leaf update information Msg. x
1 "is generated. In the next step S91, the generated leaf update information Msg.x1" is stored in the repository. Then, in the next step S92, the leaf update information Msg. x1 ″ is broadcast via the broadcast network 2.

The process of step S32 in the flowchart of FIG. 16 when the pre-return message ID list is used will be described in more detail with reference to the flowchart of FIG. The processing according to the flowchart of FIG. 22 is all performed on the receiving side replicator 17. In the first step S80, the leaf update information Msg. x1 ″ is received by the receiving replicator 17.

In step S81, the reception in step S80 indicates that the leaf update information Msg. It is determined whether or not it is the first reception of x1 ″. If it is determined that this reception is the first reception, the process proceeds to step S85. In step S85, the received leaf update information M is received.
sg. The message ID "x1" is additionally recorded in a message ID list formed on a recording or storage medium such as a memory or a hard disk included in the receiving side replicator 17.

At the next step S86, the received leaf update information Msg. x1 ″, that is, the difference update information described in the leaf update information Msg.x1 ″, the content of the corresponding leaf entry in the directory information managed by the receiving server 16 is changed. After the processing of step S86, the processing is step S80.
Returned to.

On the other hand, in step S81, the leaf update information Msg. If it is determined that the reception of "x1" is not the first reception, the process proceeds to step S82.
Move to. In step S82, the message ID list is referred to, and the leaf update information Msg. The message ID of x1 "is the message ID
It is determined whether it exists on the list. If it is determined that it exists, the process returns to step S80.

On the other hand, in step S82, the leaf update information Msg. If it is determined that the message ID "x1" does not exist, the process proceeds to step S83. In step S83, the message I among the message IDs on the pre-restricted message ID list of the received leaf update information Msg.x1 "is message I.
It is determined whether or not there is something that is not on the D list. If not, that is, if it is determined that all the message IDs in the pre-exit message ID list are present in the message ID list, the process proceeds to step S8 described above.
Go to 5.

On the other hand, in step S83, the received leaf update information Msg. x1 "pre-recruit message I
If it is determined that some of the message IDs on the D list are not in the message ID list, the process proceeds to step S84. In step S84, the message I
Leaf update information Msg. x1 ″ is acquired.

Leaf update information Msg. The acquisition of x1 ″ can be performed, for example, by connecting the transmitting side replicator 12 and the receiving side replicator 17 with a bidirectional network capable of bidirectional communication, and using the bidirectional network. For example, the receiving side replicator 17 Request from the transmitting-side replicator 12 the leaf update information Msg.x1 ″ having a message ID that is not in the message ID list via the bidirectional network. In response to this request, the transmitting-side replicator 12 receives the relevant leaf update information Msg. x1 ″ is transmitted to the receiving-side replicator 17 via the bidirectional network.

Also, the leaf update information Msg. The acquisition of "1" is not limited to the above, and in the bidirectional network, only the leaf update information Msg.x1 "having a message ID that is not in the message ID list is requested from the receiving side replicator 17 to the transmitting side replicator 12. In the replicator 12, the corresponding leaf update information Msg. x1 ″ may be broadcast via the broadcast network 2.

By the way, as described above, the leaf update information Msg. The broadcast of x1 is performed for each of all container entries in the directory structure managed by the transmission side 1, and is broadcasted as leaf update information Msg. It is expected that x1 will be a huge amount. Therefore, the receiving side 3
In the leaf update information Msg. x1 only, a large number of broadcast leaf update information Msg. It is necessary to filter efficiently from x1.

The leaf update information Msg. A method for efficiently filtering x1 will be described. The transmitting-side replicator 12 uses the leaf update information Msg. A filtering mask for performing filter processing in the reception side replicator 17 is added to x1. A mask schema structure for interpreting the filtering mask and a method of notifying the mask schema structure from the transmitting side replicator 12 to the receiving side replicator 17 will be described later.

Leaf update information Msg. A message in which a filtering mask is added to x1 (leaf update information Ms
g. x1 ′) is defined as follows, and the leaf update information Msg. x1 for all the leaf update information Msg. Replace with x1 'and think. That is, the leaf update information Msg. x1 'is It is defined in this way. "Message ID" (Message I
D) is the leaf update information Msg. This message (leaf update information Msg.x
1 ') identification information, which is, for example, an integer that is incremented by 1 each time this message is generated. “Differential update information” is the leaf entry under the container entry specified by the filtering mask described here,
This is information on procedures such as addition, deletion, and attribute change.

The structure of "Filtering Mask" (filtering mask) is defined as follows. That is, the filtering mask is It is defined in this way. “Mask Schema Version” is, for example, the above-mentioned container structure update information Msg. Corresponding to the message ID in 1.
For example, 1 each time this filtering mask is generated,
The value to be increased. "Mask Value" is
For example, it is a mask value expressed in bit strings or byte units.

The structure of the mask value is defined by a mask schema (described later) associated with the mask schema version. The mask schema is notified from the transmitting side replicator 12 to the receiving side replicator 17 by another message described later.

A method of assigning a mask value will be described. In this example, each container entry under a certain container entry is identified by a bit string having a predetermined number of bits. In the reception side replicator 17, the received leaf update information Msg. Filter processing is performed by referring to the mask value described in x1 ′, and necessary leaf update information Msg. x1 ′ can be selectively extracted.

The bit array structure of the mask value of the filtering mask is determined corresponding to the hierarchical structure of the container entry. For example, as shown in FIG. 23A,
In accordance with the description method of the entry name described in FIG. 3, the entry X. A, X. B,
X. C, X. D and X. To distinguish E from each other,
3-bit mask values (000), (001),
(010), (011) and (100) are assigned. Note that [...] indicates that there is a higher-level container entry.

When an entry is added to or deleted from a container entry under the container entry X to which the mask value is thus given, the processing is performed according to the flowchart of FIG. 24 to increase or decrease the number of container entries. The mask value is assigned according to In the following, the container hierarchy before the addition or deletion of the container entry is performed is referred to as the pre-update container hierarchy. It is assumed that the mask digit number M ′ of the pre-update container hierarchy is stored in, for example, the memory of the transmitting-side replicator 12.

First, in the first step S60, the transmission side replicator 12 acquires the number N of container entries subordinate to the target container entry. The number N of container entries is obtained by referring to the list of subordinate container entries in the container entries. In the next step S61, the number M of bits that can uniquely identify the N elements is selected, and the number of digits of the mask is set to M. For example, in the example of FIG. 23A described above, the container entry X
Has 5 subordinate container entries, so 5
The number of bits [3] that can uniquely identify each piece is the number of digits of the mask.

Next, in step S62, it is determined whether the number of bits M assigned in step S61 is the same as the number of mask digits M'assigned to the corresponding pre-update container hierarchy. If the mask digit number M and the mask digit number M ′ are the same, the process proceeds to step S63.

In step S63, the same mask value is assigned to the entry corresponding to the container entry in the pre-update container hierarchy among the container entries in the updated container hierarchy. Further, in the next step S64, for example, a container entry corresponding to the pre-update container hierarchy does not exist in the post-update container hierarchy due to the addition of a new container entry in the post-update container hierarchy. If so, a mask value that does not overlap with the mask values of other container entries in the same container hierarchy is given to that container entry.

On the other hand, if it is determined in the above step S62 that the mask digit number M and the mask digit number M'are not the same, the process proceeds to step S65, and all the container entries in the container hierarchy are processed. The mask value is uniquely given.

For example, a container entry "... X.F" is newly added to the state of FIG.
Suppose you have a container hierarchy like this. The number N of container entries under the container entry "... X" is 6, and 3 bits are required to uniquely represent it. The container under the updated container entry "... X" is required. The number of mask digits M = 3. The mask digit number M ′ of the pre-update container hierarchy is 3, and the mask digit number M ′ is equal to the mask digit number M. Therefore, each container entry "... X.A", "... X.B", "..." shown in FIG. 23B.
X. C "," ... X. D "and" ... X. E "is assigned the mask value of the corresponding entry in the pre-update container hierarchy (step S63). On the other hand, the newly added container entry" ... X. A mask value (101) is assigned to F ″ so as not to overlap with other container entries in the same container hierarchy (step S
64).

Further, for example, from the state of FIG. 23A described above,
Delete the container entry "... X.C" and add
Suppose you have a container hierarchy like this. In this case, the number of container entries N under the container entry "... X"
Is 4, and each container entry can be identified by the 2-bit mask digit number M, so the mask digit number M = 2 of the updated container hierarchy. On the other hand, the mask digit number M ′ of the pre-update container hierarchy is M ′ = 3, and the mask digit number is different before and after the update. Therefore, by the processing of step S65, a new mask value is assigned to all the entries of the hierarchy with the mask digit number M = 2.

Furthermore, it is assumed that a container entry "... X.G" is newly added to the state of FIG. 23C, and the state of FIG. 23D is reached. In this case, the container entry "...
The number N of container entries under X "is 5, and in order to identify the container entries from each other, the number of mask digits M = 3.
And need to. Since the number of mask digits M is different from the number of mask digits M '= 2 before updating, the mask value is newly assigned to all the container entries under the container entry "... X" by the process of step S65.

The bit assignment of the mask value is serialized in the container hierarchy order from the upper side of the directory structure. On the other hand, in this embodiment, the number of mask digits differs depending on the number of entries existing in the same layer as described above. Also, the number of entries in the container hierarchy changes due to deletion or addition of entries, and the number of mask digits also changes accordingly. Therefore, an information mechanism is required to determine which bit in the bit string representing the mask value corresponds to which container entry (or container hierarchy) and interpret the mask value.

In this embodiment, as an information mechanism for interpreting the mask value, the following mask schema (Mas
kSchema) is defined. The mask schema is It is defined in this way. “Mask Schema Version” is, for example, the above-mentioned container structure update information Msg. Corresponding to the message ID in 1.
For example, it is a value that is incremented by 1 each time a corresponding filtering mask is generated. “Total Mask Length” (total mask length) represents the bit length of the entire mask value corresponding to the entire container hierarchy. That is, the total mask length corresponds to the number of bits required to represent all the layers of the directory structure. `` Set of ContainerEntryMaskSchema
(Set of Container Entry Mask Schema)
Represents an array of "ContainerEntryMaskSchema" (container entry mask schema) described later.

The above-mentioned container entry mask schema defines the filtering mask corresponding to a certain container entry. That is, the container entry mask schema is It is defined in this way. “ContainerEntryName” (container entry name) is a character string representing the entry name of the target container entry. "OffsetLength" is the offset value from the first bit of all mask values of the filtering mask corresponding to this container entry, and "MaskLength" is the number of digits (bit length) of the mask value. ). "Assigned Mask Valu
“E” (allocation mask value) is a mask value assigned to the target container entry and is represented by a bit string.

Encoding of the container entry mask schema will be described with reference to FIG. FIG. 25A is a diagram corresponding to FIG. 23A described above, in which the container entry name “... X” is subordinate to the upper container entry “... X”.
X. A "," ... X. B "," ... X. C "," ...
X. D "and" ... X. There are five container entries "E", each of which is assigned a mask value with a mask length of 3 digits. Here, for the sake of explanation, these five container entries have other entries under them. I will not do it.

FIG. 25B shows a container entry "... X.
An example of the mask value of C ″ is shown. In this example, since the offset length is 77 bits, the container entry “... X. The assignment mask value assigned to C "with a mask length of 3 bits is the container entry" ... X.
It can be seen that it is 3 bits starting from the 78th bit of the mask value of C ″. The 77-bit mask value included in the offset length is the container entry “... X. It is an allocation mask value corresponding to a container entry higher than C ″.

In this way, the position of the allocation mask value of the target container entry in the mask value is defined, and the container entry mask schema is encoded.

A more specific example of the container entry mask schema will be shown. The above-mentioned container entry "... X.
The container entry mask schema corresponding to C ″ is, for example, It looks like this. Note that the contents in parentheses () are for the purpose of explanation, and it is not necessary to actually describe them.

The container entry mask schema corresponding to the container entry "... X.D" shown in FIG. It looks like this.

The mask schema at this time is, for example, when the mask schema version is 498 and the total mask length is 134 bits, It looks like this. In the example above, the container entries "... X.C and" ... X.C. Although the container entry mask schema of D is described in the mask schema, another container entry mask schema is described in the part [....]. As you can see in this example,
The mask schema describes a container entry mask schema for all container entries in one directory structure.

In this example, while the total mask length is 134 bits, the container entry "...
X. In the container entry mask schema for C and "... X.D., the offset value is 77 bits and the mask length is 3 bits, for a total of 80 bits. C and "...
X. It also indicates that there is another container hierarchy under D.

In the mask schema described above, the coding of the filtering mask corresponding to the container entry "... X.C" is performed by, for example, It looks like this. In addition, the mask value (Mask Value) is [0
11] is also filled with bits made up of allocation mask values of container entries of other layers.

Similarly, the encoding of the filtering mask corresponding to the container entry "... X.D is performed by, for example, It looks like this.

The transmitting-side replicator 12 monitors the transmitting-side server 11 to detect the change in the hierarchical structure of the container entry, and changes the mask schema as described above.
Therefore, in order for the receiving side 3 to perform an appropriate filtering process, the transmitting side replicator 12 needs to notify the receiving side replicator 17 of the changed mask schema together with the notification of the difference update information based on the change of the hierarchical structure. There is.

In this embodiment, in order to notify the mask schema from the transmitting side replicator 12 to the receiving side replicator 17, the above-mentioned container structure update information Ms is transmitted.
g. A mask schema structure is added to the structure of 1. Container structure update information Msg. 1 ' It is defined like this. The mask schema may change each time the configuration of the container hierarchy changes. Therefore, this container structure update information Msg. 1'is also generated according to the change in the configuration of the container hierarchy. "Message I
D "(message ID) is the container structure update information Ms
g. It is an integer that is incremented by 1 each time 1'is generated. In the following, the container structure update information Msg.
1 for all the container structure update information Msg. It should be replaced with 1 '.

In the transmitting-side replicator 12, in step S46 in the above-mentioned flowchart of FIG. 17, the leaf update information Msg. x1 ′ is generated and broadcast to the reception side replicator 17. Here, on the receiving side 3, the leaf update information Msg. It is necessary to specify the target portion of the container hierarchy required by the receiving client 15 before performing the filtering process in the receiving replicator 17 by x1 ′.

Therefore, the receiving side replicator 17 creates a list enumerating the masks for filtering the target container hierarchy. This list is called a target mask list.

The target mask list will be described with reference to FIG. First, assume a directory structure as shown in FIG. 26A. The directory hierarchy in FIG. 26A is assumed to be composed of all container entries except the root entry at the highest level. Each square represents a container entry, and the container entry indicated by a double-lined square is, for example, the receiving client 1 based on the user's preference.
5 is an entry specified to be filtered. The number displayed in each entry is a mask value assigned to each entry.

As shown in FIG. 26A, the client 1 on the receiving side performs the filtering process based on the user's preference.
For each of the container entries identified in 5,
Masks 1 to 5 are assigned. In this directory structure, the mask values for all mask lengths of the masks 1 to 5 follow the directory structure from the upper side, and the mask 1 is

[000], mask 2 is [0010] mask 3 is [01
0], the mask 4 is [10000] and the mask 5 is [1].
[0010] becomes.

FIG. 26B shows an example of a target mask list in which the masks thus identified are listed. The target mask list is made up of a schema version that specifies the structure of the directory and a list of the mask values specified by the receiving client 15 based on the user's preference. That is, this target mask list is a list valid only in the directory structure described in the schema version.

FIG. 27 is a flowchart of the processing for creating the target mask list. This flowchart is executed by the receiving side replicator 17. First, in the first step S70, the receiving side replicator 17 causes the container structure update information Msg. 1'is received.
In step S71, the reception in step S70 indicates that the container structure update information Msg. It is determined whether it is the first reception of 1 ', and if it is the first reception, the process proceeds to step S73.

In step S73, the received container structure update information Msg. The message ID 1 ′ is stored as a copy 10 in a recording or storage medium such as a memory or a hard disk of the receiving side replicator 17.

In the next step S74, the received container structure update information Msg. A container hierarchy is generated based on the contents of 1 '. The information indicating the generated container hierarchy is presented from the reception side replicator 17 to the reception side client 15, and the selection of the container entry to be specified is prompted. For example, the receiving-side client 15 uses a predetermined display means to display based on the supplied information indicating the container hierarchy. The user selects a required container entry in a predetermined method based on this display. The information of the selected container entry is passed from the receiving client 15 to the receiving replicator 17.

The specification of the container entry is not limited to the direct selection by the user. For example, the receiving side client 15 accumulates the information of the container entry that the user has inquired about, learns the tendency of the user's preference based on the accumulated information, and automatically selects the necessary container entry. You can also Further, the direct selection by the user and the automatic selection by learning can be used together.

In this way, when the container entry is selected in step S74, the filtering mask corresponding to the selected container hierarchy is set in step S75. For the list of set filtering masks,
The target mask list is stored in a recording or storage medium, such as a memory or a hard disk, which the replicator 17 on the receiving side has, for example.

On the other hand, in the above step S71, the container structure update information Msg. If it is determined that the 1'is not received for the first time, the process proceeds to step S72. In step S72, the received container structure update information Msg.
The message ID of 1 ′ is the container structure update information Msg. When 1'is received, it is determined in step S73 whether the message ID is the same as the message ID stored in the storage medium as the copy 10.

If both are judged to be the same,
The process is returned to step S70. On the other hand, step S7
If it is determined that both are not the same in step 3, the process proceeds to step S74, and the container structure update information Msg. The message ID of 1'is stored in the storage medium instead of the previous message ID, and the container structure update information Msg. Subsequent processing is performed based on 1 '.

The leaf update information Msg. x1 to the leaf update information Msg. The process of step S32 in the flowchart of FIG. 16 when a filtering mask list is further added to x1 ″ will be described in more detail with reference to the flowchart of FIG. Leaf update information Msg.x1 to which a list and is added
In the following, the leaf update information Msg. x1 #.

The processing according to the flowchart of FIG. 28 is all performed on the receiving side replicator 17. In the first step S280, the leaf update information Ms broadcast by the transmitting-side replicator 12 via the broadcast network 2
g. The x1 # is received by the receiving replicator 17.

In the next step S281, step S28
0 received leaf update information Msg. It is determined whether the filtering mask of x1 # is present in the target mask list. If it is determined that it does not exist, the process returns to step S280. On the other hand, the received leaf update information Msg. If it is determined that the filtering mask of x1 # exists in the target mask list, the process proceeds to step S281.

At step S282, the reception at step S280 indicates that the leaf update information Msg. It is determined whether it is the first reception of x1 #. If it is determined that this reception is the first reception, the process proceeds to step S286. In step S286, the received leaf update information Msg. The message ID of x1 # is additionally recorded in a message ID list formed on a recording or storage medium such as a memory or a hard disk included in the receiving side replicator 17.

In the next step S287, the received leaf update information Msg. x1 #, that is, the leaf update information Msg. Based on the difference update information described in x1 #, the content of the corresponding leaf entry in the directory information managed by the receiving server 16 is changed. After the processing of step S287, the processing is step S2.
Returned to 80.

On the other hand, in step S282 described above, the leaf update information Msg. If it is determined that the reception of x1 # is not the first reception, the process proceeds to step S.
Move to 283. In step S283, the message ID list is referred to, and the leaf update information Msg. It is determined whether the message ID of x1 # exists on the message ID list.
If it is determined that it exists, the process proceeds to step S28.
It is set back to 0.

On the other hand, in step S283, the message ID
The leaf update information Msg. If it is determined that the message ID of x1 # does not exist, the process proceeds to step S284. In step S284, the received leaf update information Msg. It is determined whether or not there is a message ID that is not on the message ID list among the message IDs on the pre-exit message ID list of x1 #. If there is nothing, that is, if it is determined that all the message IDs in the pre-exit message ID list exist in the message ID list, the process proceeds to step S286 described above.

On the other hand, in step S284, the received leaf update information Msg. Message ID among the message IDs in the x1 # pre-restricted message ID list
If it is determined that there is one that is not in the list, the process proceeds to step S285. In step S285, the leaf update information Msg. x1 # is acquired.

[0184] The leaf update information Msg. The acquisition of x1 # can be performed, for example, by connecting the transmitting-side replicator 12 and the receiving-side replicator 17 with a bidirectional network capable of bidirectional communication and using this bidirectional network.

For example, from the receiving side replicator 17 to the transmitting side replicator 12, the leaf update information Msg. x
1 # is requested over the bidirectional network. In response to this request, the transmitting-side replicator 12 receives the relevant leaf update information Msg. x1 # is transmitted to the receiving side replicator 17 via the bidirectional network.

Further, the leaf update information Msg. The acquisition of x1 # is not limited to the above, and in the bidirectional network, the leaf update information Msg. x1 #
Of the corresponding leaf update information Msg. x1 # may be broadcast via the broadcast network 2.

As already described with reference to FIG. 21, in the transmitting-side replicator 12, the leaf update information M broadcast is broadcast.
sg. x1 "is stored in the repository.
During the processing in step S285 of FIG. 28 described above, the transmission-side replicator 12 requests the leaf update information Ms requested from the reception-side replicator 17 via the bidirectional network.
g. x1 ″ is retrieved from the repository and transmitted to the replicator 17 on the receiving side.

The target mask list described above can be divided into a plurality of groups, and a priority (class) can be uniquely assigned to each of the divided groups.
The target mask list in which each of the mask values listed in the list has a priority is hereinafter referred to as a priority-added target mask list. The target mask list with priority is stored in a recording or storage medium, such as a memory or a hard disk, that the receiving-side replicator 17 has.

The target mask list with priority will be described more specifically. Assume a directory structure as shown in FIG. 29A. The directory hierarchy of FIG. 29A is
All but the highest root entry are assumed to be composed of container entries. Each square represents a container entry, and the container entry indicated by the double-lined square is
For example, the entry is specified so that the receiving client 15 performs the filtering process based on the user's preference.
The numbers displayed in each entry are mask values of masks 1 to 6 assigned to each entry. The mask value of each container entry indicated by a double-lined square is enumerated, and a target mask list is created.

As shown in FIG. 29A, the client 1 on the receiving side performs a filtering process based on the user's preference.
For each of the container entries identified in 5,
Masks 1 to 6 are assigned. In this directory structure, mask values for all mask lengths of the masks 1 to 6 follow the directory structure from the upper side, and the mask 1 is

[000], mask 2 is [0010] mask 3 is [01
0], the mask 4 is [10000] and the mask 5 is [1].
[0010] becomes. The mask value of the mask 6 is [1
0].

A priority is set for each mask value listed in the target mask list, and a target mask list with priority is created. As an example, when the class value is small, the priority is high, and when the class value is large, the priority is low, the entry corresponding to the mask 4 most reflects the user's preference, and has the highest priority. The priority is set to class 1. The entries corresponding to mask 1 and mask 5 have a lower priority than the entries corresponding to mask 4, but have a higher priority than the entries corresponding to masks 2, 3 and 6, and the priority is set to class 2. To be done. On the other hand, the entries corresponding to the masks 2, 3 and 6 are set as the class 3 because the entries of the masks 1 to 6 have the least interest to the user and are set to have a low priority.

FIG. 29B shows an example of the priority-added target mask list in which the priority class is set to the mask value corresponding to each entry in this way. The priority-added target mask list includes a schema version that specifies the directory structure and the above-described mask value list that is specified by the receiving client 15 based on the user's preference and the priority class is set. . That is, this target mask list with priority is a list valid only in the directory structure described by the schema version.

FIG. 30 is a flowchart of an example of processing for creating a target mask list with priorities. This flowchart is executed by the receiving side replicator 17. First, in the first step S270, the receiving side replicator 17 causes the container structure update information Msg.
1'is received. In step S271, step S2
70 receives the container structure update information Msg. It is determined whether it is the first reception of 1 ', and if it is the first reception, the process proceeds to step S273.

In step S273, the received container structure update information Msg. The message ID 1 ′ is stored as a copy 11 in a recording or storage medium such as a memory or a hard disk included in the receiving side replicator 17.

At the next step S274, the received container structure update information Msg. A container hierarchy is generated based on the contents of 1 '. Information indicating the generated container hierarchy is transferred from the receiving side replicator 17 to the receiving side client 15.
The selection of the container entry to be specified and the setting of the priority for the selected container entry are prompted. For example, the receiving-side client 15 uses a predetermined display means to display based on the supplied information indicating the container hierarchy. Based on this display, the user
A required container entry is selected by a predetermined method, and a priority for the container entry is set.
The information of the selected container entry and the information of the set priority are passed from the receiving client 15 to the receiving replicator 17.

The identification of the container entry is not limited to the direct selection by the user. For example, the receiving side client 15 accumulates the information of the container entry that the user has inquired about, learns the tendency of the user's preference based on the accumulated information, and automatically selects the necessary container entry. You can also Further, the direct selection by the user and the automatic selection by learning can be used together.

Further, the setting of the priority for the selected container entry is also performed by the receiving client 15 in the above description.
In the above description, the target mask list is displayed and the user is prompted to set the priority according to the preference, but this is not limited to this example. For example, learning or statistical processing may be performed based on the past access record to the container entry, and the priority may be automatically set based on the result.

In this way, when the container entry is selected in step S274, the filtering mask corresponding to the selected container hierarchy is set in step S275, and the priority is given to the set filtering mask. Is set. The list of the filtering masks to which the priority is set is stored in a recording or storage medium, such as a memory or a hard disk, which the receiving-side replicator 17 has, for example, as a target mask list with priority.

On the other hand, in step S271 described above, the container structure update information Msg. If it is determined that 1'is not received for the first time, the process proceeds to step S272. In step S272, the received container structure update information M
sg. The message ID of 1 ′ is the container structure update information Msg. By receiving 1 ', step S273
Message ID stored in the storage medium as copy 7 in
Is determined to be the same as.

If it is judged that they are the same,
The process is returned to step S270. On the other hand, step S
If it is determined in step 273 that they are not the same, the process proceeds to step S274, and the container structure update information Msg. The message ID of 1'is stored in the storage medium instead of the previous message ID, and the container structure update information Msg. Subsequent processing is performed based on 1 '.

FIG. 31 shows the broadcasted leaf update information Msg.n based on the priority-added target mask list created according to the flowchart of FIG. 11 is a flowchart illustrating an example of a process of selectively receiving x1 #. The example described here is the leaf update information Msg. x1
In this example, # does not include the pre-return message ID list.

In the following, the message buffer and the message queue are formed of a predetermined storage area of a storage medium, such as a memory or a hard disk, which the reception side replicator 17 has and is readable / writable by the reception side replicator 17. The message buffer is a memory for storing data, and the message queue is a memory used as a FIFO (First In-First Out).

The receiving-side replicator 17 receives the leaf update information Msg.n having the filtering masks listed in the prioritized target mask list. x1 # is the leaf update information Msg. x1 #
Selectively receive from among. At this time, according to the priority given to the filtering mask, processing is performed from the highest priority. The leaf update information Msg. The process of step S32 in the flowchart of FIG. 16 described above is executed by x1 #.

In FIG. 31, the first step S150
The received message (leaf update information Msg.x
The message buffering unit time Tb, which is the unit time for storing 1 #) in the message buffer, is set. At the same time, the timer Tm that operates based on the unit time Tb is started. The unit time Tb is set to, for example, about 10 seconds to 1 minute.

After the message buffering unit time Tb is set, in the next step S151, the receiving side replicator 17 causes the leaf update information Msg. x1 # is received. In the receiving side replicator 17, the target mask list stored in the storage medium is referred to, and the received leaf update information Msg. It is determined whether or not the filtering mask indicated by x1 # exists in the priority-added target mask list (step S152).

[0206] If the received leaf update information Msg. If it is determined that the filtering mask indicated by x1 # does not exist in the target mask list with priority, the process proceeds to step S157. In step S157, if it is determined by the timer Tm that the message buffering unit time Tb set in step S150 is not exceeded, the process returns to step S151. If so, step S157
Then, if it is determined that the unit time Tb is exceeded, the process proceeds to step S158 described later.

On the other hand, if it is determined in step S152 that the filtering mask is present in the priority-added target mask list, the process proceeds to step S15.
3, the reception in step S151 indicates that the leaf update information Msg. It is determined whether it is the first reception of x1 #. If it is the first reception, the process proceeds to processing step S155, and the received leaf update information Ms is received.
g. The message ID indicated by x1 # is stored as a copy 12 in a recording or storage medium such as a memory or a hard disk included in the receiving side replicator 17. Then, in the next step S156, the received leaf update information Msg. x1 # is recorded in the message buffer and stored.

On the other hand, in step S153, the leaf update information Msg. If it is determined that the reception of x1 # is not the first reception, the process proceeds to step S.
Move to 154. In step S154, the received leaf update information Msg. The message ID of x1 # is the leaf update information Msg. Upon reception of x1 #, it is determined in step S155 whether the message ID is the same as the message ID stored in the storage medium as the copy 12.

If it is determined in step S154 that they are the same, the process proceeds to step S157,
Based on the time information indicated by the timer Tm, if the message buffering unit time Tb is not exceeded, the process returns to step S151, and if the unit time Tb is exceeded, the process proceeds to step S158.

On the other hand, if it is determined in step S154 that they are not the same, the process proceeds to step S155 described above.
The leaf update information Msg. x1
The message ID of # is stored in the storage medium as the copy 12 instead of the message IDs up to the previous time,
156, the leaf update information Msg. x1 # is stored in the message buffer, and the process proceeds to step S157.

As described above, if it is determined in step S157 that the message buffering unit time Tb is exceeded based on the time information indicated by the timer Tm, the process proceeds to step S158. In step S158, the priority-added target mask list is referred to, and the plurality of pieces of leaf update information Msg. x1 # is classified for each priority class. Then, in the next step S159, the leaf update information Msg. The messages are stored in the message queue in order from x1 #, and the process is returned to step S150.

For example, when the priority-added target mask list is set as shown in FIG. 29B, the receiving side sets the following five pieces of leaf update information Msg. x1
It is assumed that # is received within a predetermined unit time. That is, each Msg. x1 # to Msg. -00X, Msg. -0011: leaf update information for a leaf entry under the container entry selected by mask 3, Msg. -002: Leaf update information for leaf entries under the container entry selected by mask 1, Msg. -003: Leaf update information for a leaf entry under the container entry selected by the mask 5, Msg. -004: leaf update information for leaf entries under the container entry selected by mask 4, Msg. -005: Leaf update information for leaf entries under the container entry selected by the mask 6, these five leaf update information Msg. It is assumed that x1 # is received by the receiving side.

In this case, the leaf update information Msg. x
The ordering of the processing of 1 # is performed by each leaf update information Msg. x
1 # is associated with a priority class, Msg. -004 (Class 1) 2. Msg. -003 (Class 2) 3. Msg. -002 (class 2) 4. Msg. -005 (class 3) 5. Msg. -001 (Class 3) This is the order. That is, in this order, each leaf update information Msg. x1 # is stored in the message queue.

Leaf update information Msg. The x1 # s are output from the message queue in the order in which they are stored and passed to a module (not shown) that updates the leaf entry of the receiving-side replicator 17. In the leaf entry update processing module, the passed leaf update information Msg. The leaf entry update process in step S32 of the above-described flowchart of FIG. 16 is performed using x1 #. The leaf update information Msg. The process of storing x1 # in the message buffer is performed in parallel.

In the receiving side replicator 17,
If there are restrictions on the resources required to perform the update processing, such as processing time restrictions, memory capacity restrictions, or CPU processing capacity restrictions, the receiving side replicator 17 performs processing. Possible leaf update information Msg. There is a limit on the number of x1 #. That is, there is a limit to the length of the message queue. In this case, the leaf update information Msg.
x1 # is discarded.

[0216] As an example, the leaf update information Msg. x1 # cannot be completely processed, the leaf update information Msg. x1 #
The processing is performed in order from.

Next, the leaf update information Msg. A process when the above-mentioned pre-restriction message ID list is added to x1 # will be described. In the following, the leaf update information Msg. x1 # is the leaf update information Ms
g. x1 #.

29 under the container entry corresponding to the mask 6 in the directory structure shown in FIG. 29A.
A case where leaf entries 1 and 2 are added to one container entry will be described with reference to FIG. The directory structure shown in FIGS. 32A and 32C as an example is obtained by extracting the container entry corresponding to the mask 6 from the directory structure shown in FIG. 29.

FIG. 32A shows the directory structure before the leaf entry is added, and the leaf entry is added after the progress as shown in FIG. 32B to form the directory structure shown in FIG. 32C. In the transmitting side replicator 12,
It is detected that the leaf entry 103 has been added to the container entry 101 under the container entry 100 corresponding to the mask 6 in the directory structure on the transmitting server 11. Container structure update information Msg.1 indicating that the leaf entry 103 has been added to the container entry 101. 1 ′ (denoted as Msg.-006) is broadcast from the transmission side replicator 12 to the reception side replicator 17. Then, in the same way, container entry 1
02, the transmission side replicator 12 detects that the leaf entry 104 has been added, and the transmission side replicator 12 notifies the reception side replicator 17 of the container structure update information Msg. 1 '(Msg.-00
7) is broadcast from the transmitting side replicator 12 to the receiving side replicator 17.

By adding a leaf entry under the container entry, the attribute information of the leaf entry changes, and the transmitting side replicator 12 causes the transmitting side server 1
The change of this leaf entry on 1 is detected. Based on the detection result, first, the leaf update information Msg. x1 # (Msg.-00
9) is generated and broadcast from the transmitting side replicator 12 to the receiving side replicator 17. Subsequently, the leaf update information M indicating the attribute change of the leaf entry 103
sg. x1 # (Msg.-008) is generated,
It is broadcast from the transmitting side replicator 12 to the receiving side replicator 17.

At this time, as shown in FIG. 32B, if the Msg. -006 and Msg. -007 is being broadcast, the receiving-side replicator 17 is paused, for example, because the power is not turned on, and thereafter, when it is activated, the Msg. -006 and Msg. -007
Msg. -009
And Msg. -008 is received.

At this time, the Msg. -009 and Msg. -008 is Ms indicating addition of a leaf entry to a container entry
g. -006 and Msg. It does not make sense unless -007 is received and acquired. Therefore, Msg. -009
To Msg. Before performing processing according to −009, Ms
g. Pre-exit message indicating that it is necessary to perform the process of -007, and the leaf update information Msg. "1" is broadcast from the transmission side replicator 12 to the reception side replicator 17. Msg.-008
For Msg. The leaf update information Msg. It will be broadcast as x1 ".

As described above, in the example of FIG. 32, the receiving side replicator 17 receives the following four messages. That is, Msg. -006: Leaf entry under the container entry 101 selected by the mask 6 (leaf entry 1
03) to add container structure update information, Msg. -007: Leaf entry (leaf entry 1) under the container entry 102 selected by the mask 5
04) to add container structure update information, Msg. −008: A part of the attributes of the leaf entry 103 under the container entry 101 selected by the mask 6 is changed, and Msg. −
006 is specified, leaf update information, Msg. −009: A part of the attributes of the leaf entry 104 under the container entry 102 selected by the mask 5 is changed, and Msg. −
Leaf update information in which 007 is specified, these four messages are displayed, for example, in FIG. 32A to FIG.
It is received by the receiving side replicator 17 in the period up to 2C. As mentioned above, Msg. -006 and Msg.
-007 is missed because the replicator 17 on the receiving side is inactive.

At this time, the leaf update information Msg. x1 #
The processing order of each leaf update information Msg. x1 #
By associating with the priority class, Msg. -007 (Class 2) 2. Msg. -009 (class 2) 3. Msg. -006 (class 3) 4. Msg. -008 (Class 3) For example: That is, in this order, each leaf update information Msg. x1 # is stored in the message queue. The Msg.
-007 and Msg. -006 represents Msg.
-009 and Msg. This is an essential process before the process by -008. Therefore, Msg. -007 and Ms
g. -006 represents Msg. -009 and Ms
g. Placed before -008.

In the receiving side replicator 17, Msg. −
009 and Msg. Before performing the processing of -008, for example, a bidirectional network that bidirectionally connects the reception side replicator 17 and the transmission side replicator 12 is provided, and using this bidirectional network, Msg. -007 and M
sg. It is necessary to acquire from the transmitting-side replicator 12 in the order of -006. At this time, for example, due to restrictions on the processing resources of the receiving side replicator 17, the transmitting side replicator 12, or the bidirectional network 4 itself, for example, Msg. -007 can be obtained, but Msg. -0
It is possible that 06 cannot be acquired. At this time, Msg. The processing by -008 is postponed.

FIG. 33 shows broadcasted leaf update information Msg. x1
9 is a flowchart showing an example of a process in which a pre-return message ID list is applied in the process of selectively receiving #.

In FIG. 33, the first step S170.
Then, a message buffering unit time Tb which is a unit time for accumulating the message (leaf update information Msg.x1 #) received in step S171 described later in the message buffer is set. Along with that, the unit time Tb
A timer Tm that operates based on the above is started. Unit time T
b is set to about 10 seconds to 1 minute, for example.

When the message buffering unit time Tb is set, in the next step S171, the reception side replicator 17 causes the leaf update information Msg. x1 # is received. As described above, the leaf update information Msg. x1 # is leaf update information Msg. Pre-exit message I on 1 '
The D list is added. Receiver Replicator 1
7, the target mask list stored in the storage medium is referred to, and the received leaf update information Msg. x
It is determined whether the filtering mask indicated by 1 # exists in the target mask list with priority (step S172).

[0229] In step S172, the received leaf update information Msg. If it is determined that the filtering mask indicated by x1 # does not exist in the priority-added target mask list, the process proceeds to step S180. In step S180, if it is determined by the timer Tm that the message buffering unit time Tb set in step S170 has not been exceeded, the process returns to step S171. If so, step S180
Then, if it is determined that the unit time Tb is exceeded, the process proceeds to step S181 described later.

On the other hand, if it is determined in step S172 that the filtering mask is present in the priority-added target mask list, the process proceeds to step S17.
3, the reception in step S171 indicates that the leaf update information Msg. It is determined whether it is the first reception of x1 #. If it is the first reception, the process proceeds to processing step S178, and the received leaf update information Ms is received.
g. The message ID indicated by x1 # is recorded in the history list. The history list is formed in a predetermined area of a recording or storage medium such as a memory or a hard disk of the receiving side replicator 17. In the next step S179, the received leaf update information Msg.
x1 # is stored in the message buffer.

On the other hand, in step S173, the leaf update information Msg. If it is determined that the reception of x1 # is not the first reception, the process proceeds to step S.
Moving to 174. In step S174, the received leaf update information Msg. The one that matches the message ID of x1 # is the leaf update information Msg. x1 #
Is received, it is determined in step S178 whether or not the message ID is included in the message ID recorded in the history list.

If it is determined that there is a match in step S174, the process proceeds to step S18.
0, based on the time information indicated by the timer Tm,
If the message buffering unit time Tb is not exceeded, the process returns to step S171, and the unit time Tb
If it exceeds, the process proceeds to step S181.

On the other hand, if it is determined in step S174 that there is no match, the process proceeds to step S175. In step S175, the received leaf update information Msg. It is determined whether or not there is a message ID that is not in the history list among the message IDs described in the pre-restriction message ID list in x1 #. If the received leaf update information Msg. If it is determined that all the message IDs described in the pre-restriction message ID list in x1 # are recorded in the history list, the process proceeds to step S178, and the received leaf update information Ms is received.
g. x1 # is recorded in the history list.

On the other hand, in step S175, the received leaf update information Msg. If it is determined that some of the message IDs recorded in the pre-exit message ID list in x1 # are not recorded in the history list,
The process proceeds to step S176. Step S176
Then, the received leaf update information Msg. Of the message IDs recorded in the pre-restriction message ID list in x1 #, the leaf update information Msg. x1 # is acquired. The acquisition of the message ID is performed using, for example, the above-described bidirectional network that connects the reception side replicator 17 and the transmission side replicator 12. The acquired leaf update information Msg. The message ID of x1 # is added and recorded in the history list in the next step S177. When the additional recording to the history list ends, the process proceeds to step S178.

At step S178, as described above,
The received leaf update information Msg. The message ID of x1 # is recorded in the history list. Then, in the next step S179, the received leaf update information Msg. x1 #
Is stored in the message buffer, and the process proceeds to the next step S180.

At step S180, as described above,
Based on the time information indicated by the timer Tm, it is determined whether the message buffering unit time Tb has been exceeded. If it is judged that the unit time Tb is exceeded,
The process proceeds to step S181.

In step S181, the priority-added target mask list is referred to, and a plurality of leaf update information Msg. x1 # is classified for each priority class. Then, the next step S18
2, the leaf update information Msg. x
The messages are stored in the message queue in order from 1 #, and the process is returned to step S170.

Next, a method of setting the above-mentioned all configuration information notification period timers T ₁ 'and T ₁ ' will be described. As described above, in this embodiment, the container structure item new information Msg. And 'All configuration information notification period timer T ₁ for use in determining the timing of broadcasting' 1, leaf update information Msg. 2 of all configuration information notification period timer T ₁ 'used when deciding the timing of broadcasting x1 #
A value can be set individually for each type of timer. Further, these timers T ₁ 'and T ₁ ' can change the set values at any time.

In this embodiment, the transmission side 1 (transmission side replicator 12) is connected to the reception side 3 (reception side replicator 1).
The operating state of 7) is monitored by a predetermined method, and the values of the timers T ₁ 'and T ₁ ' are set based on the monitoring result. The values of the timers T ₁ 'and T ₁ ' are set to different values depending on the operating state of the receiving side 3, for example, for each time zone.

FIG. 34 is a flow chart showing an example of processing for setting the values of the all-configuration information notification period timers T ₁ 'and T ₁ '. First, in the first step S140, the receiving-side replicator 17 monitors its own operating status.
That is, the operating status of the receiving-side replicator 17 is monitored every predetermined unit time, and the time variation of the operating status is stored in a recording or storage medium such as a memory or a hard disk included in the receiving-side replicator 17. The operating status is obtained by, for example, accumulating the operating time of the receiving side replicator 17, that is, the time during which the receiving side replicator 17 is receiving and processing two types of update messages.

The data indicating the operating status of the receiving side replicator 17 which is monitored and stored is stored in the next step S141.
Is notified to the transmitting side replicator 12. The operation status information transmitted from the reception side replicator 17 is transmitted to the transmission side replicator 12 via the bidirectional network 4 and notified.

The transmitting-side replicator 12 receives the operating status information of the receiving-side replicator 17 sent via the bidirectional network 4, and performs a predetermined statistical process based on the received operating status information (step S142). The statistical processing is performed, for example, by accumulating the operation status information sent from the plurality of receiving-side replicators 17 every unit time. As a result of this statistical processing, time-varying statistical information on the operating status of the receiving-side replicator 17 is obtained. The obtained time-varying statistical information is stored in the transmitting-side replicator 12.

At the next step S143, the transmitting side replicator 12 sets all configuration information notification period timers T ₁ 'and T ₁ ' based on the statistical processing result at the step S142.

For example, assume that the result of the statistical processing in step S142 is obtained as shown in FIG. Note that in FIG. 35, the horizontal axis represents, for example, the time of day. The vertical axis represents the operating rate of the receiving-side replicator 17, the time zone in the region b is the time zone having a high operating rate in the day, and the areas a and c are the time zones having a relatively low operating rate in the day. Is shown.

With respect to the statistical result as shown in FIG. 35, for example, all configuration information notification period timers T ₁ 'and T ₁ ' are set in the areas a, b and c with different values. It is considered that the area b has a higher operating rate than the areas a and c, and that the receiving side 3 has a higher access rate to the broadcast from the transmitting side 1. Therefore, in the period of the area b, even if the setting time of the timer T ₁ ′ or T ₁ ′ is increased to lengthen the period for broadcasting the difference update information, the receiving side 3 misses the broadcast difference update information. The probability is expected to be low compared to the other two regions a and c.

Therefore, as an example, as in the area b,
In areas where the operating rate of the receiving side replicator 17 is high, the set values of the timers T ₁ 'and T ₁ ' are increased to lengthen the broadcast cycle of the difference update information, and in the other two areas a and c, the timer T _{1 '} It is conceivable to reduce the set values of'and T ₁ 'to shorten the broadcast cycle of the difference update information. As described above, in this embodiment, the frequency of notification of all configuration information that consumes a lot of communication resources can be dynamically changed according to the operating rate of the receiving side 3. As a result, it is possible to efficiently notify the difference update information of the directory structure.

[0247]

As described above, according to the present invention, the receiving side that receives the broadcast of the difference update information from the transmitting side based on the detection result of detecting the change in the directory structure managed by the server. In the above, since the received difference update information can be selectively processed according to the user's preference and the like, and the priority is given to the difference update information at the time of selection, the user side Even if the resource of the process of (1) is limited, it is possible to perform the processes sequentially from the necessary difference update information.

Further, according to this embodiment, when broadcasting the directory structure managed by the server, the change in the directory structure is detected and the difference update information indicating the difference between the changes is broadcasted. , When the differential update information is broadcast, the differential update information that must be already processed before being processed by the receiving side is added to the receiving side. Even in the case of omission, the directory structure can be updated without inconsistency even at a limited cost.

[Brief description of drawings]

FIG. 1 is a schematic diagram showing an example of a system applicable to the present invention.

FIG. 2 is a schematic diagram for explaining that a plurality of receiving sides are connected to a broadcasting network.

FIG. 3 is a schematic diagram for explaining a directory structure.

FIG. 4 is a schematic diagram showing an example of the structure of a container entry.

FIG. 5 is a schematic diagram showing an example of the structure of a leaf entry.

FIG. 6 is a functional block diagram for explaining a function of a transmitting-side replicator.

FIG. 7 is a functional block diagram for explaining a function of a receiving client.

FIG. 8 is a functional block diagram for explaining a function of a receiving server.

FIG. 9 is a schematic diagram for explaining differential update information of a directory structure.

FIG. 10 is a schematic diagram for explaining differential update information of a directory structure.

FIG. 11 is a schematic diagram for explaining all configuration information of a directory structure.

FIG. 12 is a schematic diagram for explaining all configuration information of a directory structure.

FIG. 13 is a flowchart for explaining a container entry synchronization management method.

FIG. 14 is a flowchart for explaining in more detail a container entry synchronization management method.

FIG. 15 is a flowchart for explaining a container entry synchronization management method in more detail.

FIG. 16 is a flowchart for explaining a leaf entry synchronization management method.

FIG. 17 is a flowchart for explaining the leaf entry synchronization management method in more detail.

FIG. 18 is a flowchart for explaining the leaf entry synchronization management method in more detail.

FIG. 19 is a schematic diagram illustrating an example of a difference update notification history table.

FIG. 20 is a flowchart for explaining in more detail a leaf entry synchronization management method when a pre-restriction message ID list is used.

FIG. 21 is a view showing leaf update information Msg. 6 is a flowchart of an example of processing for saving x1 ″.

FIG. 22 is a flowchart for explaining the leaf entry synchronization management method in more detail when a pre-restriction message ID list is used.

FIG. 23 is a schematic diagram illustrating a bit array structure of mask values of a filtering mask.

FIG. 24 is a flowchart of mask value allocation processing according to an increase / decrease in container entries when an entry is added or deleted.

FIG. 25 is a schematic diagram for explaining encoding of a container entry mask schema.

FIG. 26 is a schematic diagram for explaining a target mask list.

FIG. 27 is a flowchart of a process of creating a target mask list.

FIG. 28 is a flowchart for explaining in more detail a leaf entry synchronization management method when a pre-restriction message ID list and a target mask list are used.

FIG. 29 is a schematic diagram for explaining a target mask list with priorities.

FIG. 30 is a flowchart of an example of processing for creating a target mask list with priorities.

FIG. 31 is a diagram showing broadcasted leaf update information Msg. 11 is a flowchart illustrating an example of a process of selectively receiving x1 #.

FIG. 32 is a schematic diagram showing an example in which a directory structure is changed by adding leaf entries.

FIG. 33 shows broadcasted leaf update information Msg. In the process of selectively receiving x1 #, the pre-return message I
It is a flow chart which shows an example of processing to which a D list is applied.

FIG. 34 is a flowchart of an example of processing for setting the value of the all-configuration information notification cycle timer.

FIG. 35 is a schematic diagram illustrating a result of an example of statistical processing of the operating rate on the receiving side.

[Explanation of symbols]

1 ... Sending side, 2 ... Broadcast network, 3 ...
Receiving side, 10 ... Sending side directory service client, 11 ... Sending side directory server, 12 ...
..Sender directory server replicator, 15 ...
.Recipient directory service client, 16 ...
Receiving side directory server, 17 ... Receiving side directory server replicator, Msg. x1 ... Leaf update information

─────────────────────────────────────────────────── ─── Continued Front Page (72) Inventor Kazuo Haraoka 6-735 Kita-Shinagawa, Shinagawa-ku, Tokyo Inside Sony Corporation (72) Yoshihisa Gonno 6-7 Kita-Shinagawa, Shinagawa-ku, Tokyo No. 35 Sony Corporation (72) Inventor Ikuhiko Nishio 6-7 Kita-Shinagawa, Shinagawa-ku, Tokyo No. 35 Sony Corporation (56) Reference JP-A-11-220493 (JP, A) JP-A 11-219330 (JP, A) JP-A-8-185348 (JP, A) (58) Fields investigated (Int.Cl. ⁷ , DB name) G06F 12/00 G06F 13/00 H04L

Claims (10)

(57) [Claims] 1. A transmission / reception system for transmitting a hierarchical structure of a directory that hierarchically manages the location of contents and receiving the transmitted hierarchical structure of the directory, which is a node of the directory hierarchical structure and is under its control. A first hierarchical structure for managing a directory structure including a container entry that can store node information and a leaf entry that is under the container entry and that cannot store information of the node under the container entry A change in the hierarchical structure of the management unit and the directory managed by the first management unit is detected, and based on the detection result, the first difference information including the difference between the changes in the container entries and the leaf. Detection means for obtaining second difference information consisting of a difference in change of entry; first difference information obtained by the detection means; and second difference information. Transmitting means for transmitting the minute information, receiving means for receiving the first difference information and the second difference information transmitted by the transmitting means, and the first difference received by the receiving means Second management means for managing the hierarchical structure of the directory configured based on the information and the second difference information, and the second difference information received by the receiving means is selectively fetched and fetched the difference information of the second have a changing means for changing the hierarchical structure of the directories that are managed by the second management means, said changing means, based on the order of preset priority
Prioritize the second difference information, and
The above-mentioned change using the above-mentioned second difference information based on the degree.
A transmission / reception system characterized by the above . 2. The transmission / reception system according to claim 1, wherein the changing unit sets the second priority to be high.
Change from the difference information in order to within the specified limit.
A transmission / reception system characterized by performing the following . 3. The transmission / reception system according to claim 2, wherein the limit is time. 4. The transmission / reception system according to claim 1, wherein the changing unit is based on selection information selectively set for the container entry, and is subordinate to the container entry indicated by the selection information. A transmission / reception system characterized by selectively fetching the second difference information by a leaf entry based on the order of the priority, and changing the hierarchical structure of the directory managed by the second management means. 5. A transmission / reception method of transmitting a hierarchical structure of a directory for hierarchically managing the location of contents and receiving the transmitted hierarchical structure of a directory, wherein the node is a node of the directory hierarchical structure and is under its control. A first hierarchical structure for managing a directory structure including a container entry that can store node information and a leaf entry that is under the container entry and that cannot store information of the node under the container entry A first step of detecting a change in the hierarchical structure of the directory managed by the management step and the first management step, and based on a result of the detection, a difference between changes in the container entry.
And the second difference information formed by the difference of the leaf entry changes, and the first difference information and the second difference information obtained in the detection step are transmitted. And a step of receiving to receive the first difference information and the second difference information transmitted in the step of transmitting, and the first difference information received in the step of receiving. And a second management step of managing a hierarchical structure of a directory configured on the basis of the second difference information, and selectively fetching and fetching the second difference information received in the receiving step. the difference information of the second was
Ri possess the steps of changing of changing the hierarchical structure of the directories that are managed by the step of the second management step of the modification, the order of preset priority
Based on the second difference information based on the above,
The change is made by using the second difference information based on the priority.
The transmitting and receiving method is characterized in that 6. A receiving device for receiving a hierarchical structure of a directory that hierarchically manages the location of contents, which is a node of the directory hierarchical structure that is transmitted.
Te, detected and your container entry capable of storing information of the node under, if there under the above-mentioned container entry, the change of the hierarchical structure of directory consisting of a leaf entry can not be stored information of the nodes of his subordinate Receiving means for receiving the first difference information consisting of the difference of the change of the container entry and the second difference information consisting of the difference of the change of the leaf entry obtained by the above; Management means for managing a hierarchical structure of a directory configured based on the first difference information and the second difference information, and selectively fetching and fetching the second difference information received by the receiving means have a changing means for changing the hierarchical structure of the directories that are managed by the management means by the difference information of the second that, said changing means is previously set Based on the order of the priorities
Prioritize the second difference information, and
The above-mentioned change using the above-mentioned second difference information based on the degree.
The receiving device characterized in that. 7. The receiving device according to claim 6, wherein the changing unit sets the second priority to be high.
Change from the difference information in order to within the specified limit.
The receiver is characterized by performing . 8. The receiving device according to claim 7, The above-mentioned limit is time, The receiving device characterized by the above-mentioned. 9. The receiving device according to claim 6, wherein the changing unit is based on selection information selectively set for the container entry, and the subordinate subordinate of the container entry indicated by the selection information. A receiving apparatus, characterized in that the second difference information by a leaf entry is selectively taken in based on the order of the priority, and the hierarchical structure of the directory managed by the management means is changed. 10. A receiving method for receiving a transmitted hierarchical structure of a directory for hierarchically managing the location of contents, which is a node of the transmitted hierarchical structure of the directory.
Te, detected and your container entry capable of storing information of the node under, if there under the above-mentioned container entry, the change of the hierarchical structure of directory consisting of a leaf entry can not be stored information of the nodes of his subordinate Received in the step of receiving the first difference information composed of the difference of the change of the container entry and the second difference information composed of the difference of the change of the leaf entry, which are obtained by A step of managing a hierarchical structure of a directory configured based on the first difference information and the second difference information that have been generated, and selectively selecting the second difference information received in the step of receiving. in the capture, captured the second difference information
Ri possess the steps of changing of changing the hierarchical structure of the directories that are managed in the step of the management, the steps of the change, the order of preset priority
Based on the second difference information based on the above,
The change is made by using the second difference information based on the priority.
The receiving method is characterized in that