JP3490646B2 - 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 transmitting apparatus, a transmitting method, a receiving apparatus, and a transmitting apparatus 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 reception method, a transmission / reception system, and a transmission / reception 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 the directory service, data is managed based on a directory structure having a tree structure.
The directory structure is composed of container entries corresponding to nodes between data and leaf entries that are the end of the tree and have substantial data. A container entry can have other container entries and leaf entries under its control. Leaf entries cannot have other entries under them. The entry representing the entire tree is called the root entry.

As an example, the container entries are classified by genre, and the leaf entry includes more specific data of the genre represented by the container entry immediately above.

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 directory structure stored in the receiver on 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 becomes enormous, so only the difference of change is extracted and transmitted as difference update data.

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.

Further, when receiving the above-mentioned difference update data, the user can filter the directory. The filtering mask for performing the filtering process is set for a specific information genre, for example, according to the preference of the user, and the user can selectively access the directory information for which the filtering mask is set.

That is, on the receiving side, the received differential update data is filtered and selectively acquired, and the directory structure held on the receiving side is reconstructed based on the acquired differential update data. The filtering mask is set according to the user's tendency to access the directory and his / her preference. By performing the filtering process,
The user does not need to hold or process unnecessary information.

[0016]

By the way, the directory structure managed on the directory server side dynamically changes according to the change of the actual directory structure. In this case, the relationship between the filtering mask set on the user side and the directory structure may change. Therefore, when the user receives the differential update data, the user is presented with the directory structure constructed based on the received differential update data, and sets a new filtering mask for the newly constructed directory structure. Urge you to.

However, if the process of resetting the filtering mask is performed every time the difference update data is transmitted, the calculation resources in the receiver on the user side are compressed and the application of the receiver on the user side is executed. However, there is a problem that interrupts occur frequently.

Therefore, an object of the present invention is to set a filtering mask corresponding to a changed directory structure without newly setting a filtering mask each time the differential update data of the directory structure is generated. Provided are a transmitting device and a transmitting method, a receiving device and a receiving method, and a transmitting / receiving system and a transmitting / receiving method.

[0019]

[Means for Solving the Problems] This invention is
Hierarchical management of content location to solve problems
In the transmission device that transmits the directory hierarchy structure
Is a node in the directory hierarchy and
The container entry that can store the node information of
Information of nodes under its own
Of a directory consisting of leaf entries that cannot be stored
Management means for managing the hierarchical structure, and management by the management means
Detects changes in the directory hierarchical structure and based on the detection results.
Therefore, changes occur for each container entry.
Previous directory hierarchyFrom top to bottom
Consists of an array of numbersFirstFiltering mask value
And the directory hierarchy after the changeIs the upper side of
Consists of a number array assigned in hierarchical orderSecondFilterrin
Gumask valueAnd as the container entry changes
Detecting means for obtaining difference information composed of difference of
The first sought inFiltering mask valueAnd the secondF
Filtering mask valueAnd for each container entry
In association, the first associatedfiltering
Mask valueAnd the secondFiltering mask valueAnd the detection means
And a transmission means for transmitting with the difference information obtained in
It is a transmitting device characterized by the above.

Further, according to the present invention, in a transmission method for transmitting a directory hierarchical structure for hierarchically managing the location of contents, a container entry capable of storing information on a node under the hierarchical structure of the directory and a node under the directory itself. And a management step for managing the hierarchical structure of the directory consisting of leaf entries that are under the container entry and cannot store the information of the nodes under it, and the change in the hierarchical structure of the directory managed by the managing step. Is detected and, based on the detection result, a first number array consisting of a number array attached in hierarchical order from the upper side of the directory hierarchical structure before the change occurs for each container entry.
Filtering mask value and the number array attached in hierarchical order from the top of the directory hierarchy structure after the change
With obtaining a second filtering mask values Ranaru, the steps of detecting obtaining difference information consisting of the difference between the change in the container entry, first filtering mask value and the second filtering obtained in step detection
Correlate each mask entry with the mask value ,
The transmission method is characterized by further comprising a transmission step of transmitting the associated first filtering mask value and second filtering mask value together with the difference information obtained in the detecting step.

Further, according to the present invention, in a receiving device which receives a transmitted hierarchical structure of a directory for hierarchically managing the location of contents, it is a node of the transmitted hierarchical structure of the directory and is under its control. A container entry obtained by detecting a change in the hierarchical structure of a directory consisting of a container entry that can store node information and a leaf entry that is under the container entry and that cannot store node information under its own Difference information consisting of the difference between changes and the upper level of the directory hierarchy structure before the change occurs for each container entry.
First filter consisting of a number array attached in hierarchical order from the side
A ring mask value, receiving means for receiving a <br/> second filtering mask value composed of hierarchical order to the assigned number sequence from the upper side of the directory hierarchy structure after the upper Symbol changes occur, the receiving means target selecting a management means for managing the hierarchical structure of the configured directories based on the received difference information, previously set on SL container entry
And a changing unit for selectively fetching the difference information received by the receiving unit based on the mask list and changing the hierarchical structure of the directory managed by the managing unit based on the fetched difference information. The first received in
Filtering mask value and second filtering mask
The receiving device is characterized in that the target mask list is changed based on the correspondence with the value .

Further, the present invention is a receiving method for receiving a hierarchical structure of a directory for hierarchically managing the location of contents, which is a node of the hierarchical structure of a directory that is transmitted and is under its control. A container entry obtained by detecting a change in the hierarchical structure of a directory consisting of a container entry that can store node information and a leaf entry that is under the container entry and that cannot store node information under its own Difference information consisting of the difference between changes and the upper level of the directory hierarchy structure before the change occurs for each container entry.
First filter consisting of a number array attached in hierarchical order from the side
A ring mask value, the reception receives the <br/> second filtering mask value composed of hierarchical order to the assigned number sequence from the upper side of the directory hierarchy structure after the upper Symbol changes occur and steps, of receiving a management step of managing the hierarchical structure of the configured directories based on the received difference information in step, previously set, based on the Symbol container entry to select <br/>-option to target mask list, receiving And selectively changing the hierarchical information structure of the directory managed in the management step based on the acquired difference information. First filter lin
In the receiving method, the target mask list is changed based on the correspondence between the mask mask value and the second filtering mask value .

Further, according to the present invention, in a transmission / reception system that transmits a hierarchical structure of a directory for hierarchically managing the location of contents and receives the hierarchical structure of the transmitted directory, the node is a node of the hierarchical structure of the directory. A first management means for managing a hierarchical structure of a directory including a container entry capable of storing information of nodes under the node and a leaf entry which is under the container entry and cannot store information of the nodes under its own. , First
Change in the directory structure managed by the management means of the above is detected, and based on the detection result, the directory structure before the change occurs for each container entry
The first file, which consists of a numerical array assigned in hierarchical order from the upper side of
It consists of a filtering mask value and a numerical array assigned in hierarchical order from the top of the directory hierarchy structure after a change has occurred.
And a second filtering mask value for obtaining the second filtering mask value , and a first filtering filter obtained by the detecting means for obtaining difference information including a difference between changes in container entries.
Gumasuku value and associates with each other and a second filtering mask values for each container entry, first filtering mask value correspondence is made with the second filtering
Transmitting means for transmitting the mask value together with the difference information obtained by the detecting means, the difference information transmitted by the transmitting means, the first filtering mask value and the second fill
Receiving means for receiving the tailing mask value , second managing means for managing the hierarchical structure of the directory configured based on the difference information received by the receiving means, and preset ,
Target mask list to select the top Symbol container entry
The difference information received by the receiving means is selectively fetched on the basis of the difference information, and the changing means for changing the hierarchical structure of the directory managed by the second managing means based on the fetched difference information, The first fill received by the receiving means
The target transmission / reception system is characterized in that the target mask list is changed based on the correspondence between the tailing mask value and the second filtering mask value .

Further, the present invention is 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 the directory, which is a node of the hierarchical structure of the directory. A container entry that can store information on nodes under
A first management step for managing a hierarchical structure of a directory consisting of leaf entries that are subordinate to a container entry and that cannot store information about nodes under it, and a directory managed in the first management step A change in the hierarchical structure is detected, and based on the detection result, for each container entry, a first filtering mask value consisting of a numerical array attached in hierarchical order from the upper side of the directory hierarchical structure before the change occurs , A numerical sequence assigned in hierarchical order from the top of the directory hierarchy after the change
A second filtering mask value consisting of a column and a detection step of obtaining difference information consisting of a difference between changes in container entries, and a first filtering mask value and a second filter link obtained in the detecting step.
A transmission of transmitting the associated first filtering mask value and second filtering mask value together with the difference information obtained in the detection step, by associating each of the container mask entries with each other step a difference information transmitted by the steps of transmitting the first Fi
Filtering mask value and second filtering mask
Selection and receiving step of receiving the value, and a second management step of managing the hierarchical structure of the configured directories based on the difference information received by the receiving step, previously set on SL container entry Target mask
A change step of selectively fetching the difference information received in the receiving step based on the list , and changing the hierarchical structure of the directory managed in the second managing step based on the fetched difference information. has, on the basis of the correspondence relationship between the first filtering mask value and the second filtering mask values received in the receiving step,
The transmission / reception method is characterized in that the target mask list is changed.

As described above, claims 1 and 4
The invention described in (3) is a change in the hierarchical structure of a directory that is composed of a managed 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. For each container entry, based on the detection result of, the first position information indicating the position on the directory hierarchical structure before the change and the second position information indicating the position on the directory hierarchical structure after the change occur. While seeking position information and
Since the difference information including the difference between the changes in the container entries is obtained, and the first position information and the second position information are associated with each other for each container entry and are transmitted together with the difference information, the receiving side The position information before and after the change can be associated with each of the container entries of the directory hierarchical structure updated by the difference update information.

Further, the inventions according to claims 5 and 8 store the transmitted container entry which can store the information under its control, and the information under its control which is under the container entry. The difference information, which is the difference between the changes in the container entries, which is obtained by detecting the change in the hierarchical structure of the directory consisting of the unreadable leaf entries, and the change associated with each container entry for each of the container entries The first position information indicating the position on the directory hierarchical structure before the occurrence and the second position information indicating the position on the directory hierarchical structure after the change occur are received, and the received difference information is obtained. The hierarchical structure of the directory is managed based on the difference information that is selectively captured based on the preset selection information. Since the hierarchical structure of the managed directory is changed and the selection information is changed based on the correspondence relationship between the received first position information and second position information, the selection information is changed. It is possible to reflect the change in the correspondence relationship of the container entries due to the change of the directory hierarchical structure by the difference update information.

Further, in the inventions according to claims 9 and 14, the transmitting side manages a container entry capable of storing information under its own management, and a container entry under the container entry which is under its own control. Based on the detection result of the change in the hierarchical structure of the directory consisting of leaf entries that cannot store information, for each container entry, the first position information indicating the position on the directory hierarchical structure before the change and the change occur And second position information indicating the position on the directory hierarchical structure after that, difference information that is the difference between the changes in the container entries is calculated, and the first position information and the second position information are stored in the container. The entries are associated with each other and transmitted together with the difference information. On the reception side, the difference information transmitted from the transmission side, the first position information and 2 position information is received, the hierarchical structure of the directory configured based on the received difference information is managed, the received difference information is based on the difference information fetched based on the preset selection information, Since the hierarchical structure of the directory managed on the receiving side is changed, and the selection information is changed based on the correspondence relationship between the received first position information and second position information, On the receiving side, the selection information can reflect the change in the correspondence relationship of the container entries due to the change of the directory hierarchical structure based on the difference update information.

[0028]

BEST MODE FOR CARRYING OUT THE INVENTION An 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 a network (not shown), for example, 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. The difference update information is transmitted to the broadcast network 2. The structure of the difference update information will be described later.

The receiving side 3 includes a receiving side directory server replicator 17 (hereinafter abbreviated as a receiving side replicator 17), a receiving side directory server 16 (hereinafter abbreviated as a receiving side server 16), and a receiving side directory service client 15 (hereinafter abbreviated as: 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 the directory information, the directory structure update information, the update information difference information, and the like transmitted by the broadcast network 2. The receiving-side replicator 17 updates the database 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 indicating 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.

The 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 configured, 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 and detects 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. 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 configuration 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 side 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
The transmitting-side replicator 12 constantly monitors, and when the directory structure is changed, the difference updating information of the directory structure accompanying the change is supplied to the receiving-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. Therefore, the user can always hold the directory information synchronized with the actual directory structure in the directory database 41.

Next, with reference to FIG. 9 and FIG. 10, the difference update information of the directory structure generated with the change of the directory structure will be described. 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.

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, only the container entry A exists under the 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 shown in FIG. 9B is obtained. Container entry B in the state of FIG. 9A
Is added, 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 is as shown in FIG. 9C. 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 is as shown in FIG. 9D. 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 is as shown in FIG. 9E.

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). When this processing is performed, the directory structure shown in FIG. 9F is obtained.

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. In FIG. 10A, only a container entry A exists under a 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 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 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 as shown in FIG. 10D is obtained and the hierarchical image of the container entry is changed.
The schema version Sv is updated so that 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.

The difference update information of the directory structure is not limited to the above example, and can be in various formats depending on the applied system.

Further, regarding the leaf entry, in addition to the deletion from the subordinate of the container entry and the addition to the subordinate of the container entry, only the content may be corrected. No changes in the directory structure will occur if only the contents are modified. In this case, for example, the difference update information is composed of a leaf entry name and a column of the attribute name and the attribute value that are modified in the leaf entry. As an example, In this way, the difference update information is described.

In the system to which the present invention is applied, as described above, the difference update information is unidirectionally transmitted from the transmission side 1 to the reception side 3 via the broadcast network 2. Also, there are multiple receivers 3 for one sender 1,
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. 11 will be described in more detail with reference to the flowchart of FIG. All the processing according to the flowchart of FIG. 12 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. 11 will be described in more detail with reference to the flowchart of FIG. All the processing according to the flowchart of FIG. 13 is 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. And, Oh this reception at the reception for the first time
If it is determined that, 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 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. 14 will be described in more detail with reference to the flowchart of FIG. All the processing according to the flowchart of FIG. 15 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. 15 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.

The process of step S32 in the flowchart of FIG. 14 will be described in more detail with reference to the flowchart of FIG. The processing according to the flowchart of FIG. 16 is all performed on the receiving side replicator 17. In the first step S50, the leaf update information Msg. x1 is received by the receiving replicator 17.

In step S51, the reception in step S50 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 not the first reception, the process proceeds to step S53, and the received leaf update information Msg. x1 message ID
Is copied to a recording or storage medium, such as a memory or a hard disk, which the replicator 17 on the receiving side has.
Is stored as

In the next step S54, the received leaf update information Msg. x1, that is, the leaf update information Msg. Based on the difference update information described in x1,
Of the directory information managed by the receiving server 16, the content of the corresponding leaf entry is changed. After the processing of step S54, the processing is returned to step S50.

On the other hand, in the above step S51, the leaf update information Msg. If it is determined that the reception of x1 is not the first reception, the process proceeds to step S52. In step S52, the received leaf update information Msg. It is determined whether the message ID described in x1 and the message ID stored as the copy 6 in the process of step S53 at the time of the previous reception are the same. If they are the same, the process returns to step S50.

On the other hand, if it is determined in step S52 that both message IDs are different, the process proceeds to step S53. In step S53, as described above, the message ID is stored in the storage medium as the copy 6. In this case, the newly received message ID overwrites the previously received and stored message ID, for example. Then, in the next step S54, the received leaf update information Msg. Based on x1, the content of the corresponding leaf entry on the receiving server 16 is changed.

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
, All leaf update information Msg. x1 is received,
Performing the process according to the flowchart of FIG. 16 is a heavy burden. Therefore, on the receiving side 3, the leaf update information Msg.
x1 only, a large number of broadcast leaf update information Msg.
It is necessary to filter efficiently from x1.

For example, a processing capacity and a storage capacity such as a set top box (STB) used when the receiving side replicator 17 is connected to a television receiver at home are limited, that is, a computer resource is used. It is assumed that it will be implemented in a restricted environment. In this case, the leaf update information Msg. There is a limit to the acquisition of x1. Therefore, the received leaf update information M
sg. It is necessary to select x1 and load it into the device to reduce the storage cost and message processing cost. That is, it is necessary to limit unnecessary storage and processing costs in the receiving-side replicator 17. In particular,
As the directory service spreads and the target directory structure managed by the transmitting server 11 becomes huge, the leaf update information Msg. The selection of x1 is
It becomes more important.

Below, the leaf update information Msg. A method of performing filter processing on x1 will be described. The transmitting side replicator 12 uses the leaf update information Ms to be broadcast.
g. 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. The structure of the message (Msg.x1 ') in which the filtering mask is added to x1 is defined as follows, and the above-mentioned leaf update information Ms is defined.
g. x1 for all the leaf update information Msg. Replace with x1 '. 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 mask values will be described. In this embodiment, 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. 17A as an example,
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 subordinate to the container entry X to which the mask value is thus given, the processing is performed according to the flowchart of FIG. 18 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. 17A 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 of the pre-update container hierarchy among the container entries of 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 of 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. 17B.
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. 17A 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.

Further, it is assumed that a container entry "... X.G" is newly added to the state of FIG. 17C and the state of FIG. 17D 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 made serially 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. If the mask value is in bytes, the total mask length may be expressed in bytes.

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. When the mask length is in bytes, the mask length and the allocation mask length may be expressed in bytes.

The encoding of the container entry mask schema will be described with reference to FIG. FIG. 19A is a diagram corresponding to FIG. 17A described above, in which the container entry name “...” 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. 19B shows the 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 inside the 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 above-mentioned mask schema, 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 a 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 container structure update information Ms described above is used.
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. 15, 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 ′.

In this embodiment, the receiving-side replicator 17 creates a target mask list in which masks for filtering the target container hierarchy are listed.

The target mask list will be described with reference to FIG. First, assume a directory structure as shown in FIG. 20A. It is assumed that the directory hierarchy in FIG. 20A is made up of container entries except for the highest root entry. 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. 20A, 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 are traced from the higher order in the directory structure, and the mask 1 is (000), the mask 2 is (0010), and the mask 3 is (01
0), mask 4 is (10000) and mask 5 is (1
0010).

FIG. 20B 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. The method of creating the target mask list will be described later.

The present invention relates to the directory structure managed by the transmission side server 11, and relates to the transmission side replicator 12
Mask value assigned based on the pre-update mask schema before the update is detected by and the mask value of the corresponding container entry in the new mask schema after the update after the update is detected by the sender replicator 12. The transmitting side replicator 12 notifies the receiving side replicator 17 of the correspondence relationship with. for that reason,
In the present invention, the previous mask value is added to the above-mentioned container entry mask schema. That is, the container entry mask schema with a priori mask value is It is defined in this way. `` Container entry name (Contain
erEntryName) "," Offset Length (OffSetLength) ",
Mask Length and Assignment Mask Value (P
"reviousMaskValue)" corresponds to each item in the above-mentioned container entry mask schema.

The prior mask value can be obtained, for example, in the transmitting side replicator 12 based on the copy 1 stored in step S10 of the above-described flowchart of FIG.

The PreviousMaskValue (previous mask value) is information for specifying the mask value of the container entry corresponding to the relevant container entry mask schema, which is assigned based on the mask schema before update. The prior mask value is It is defined in this way. Each item corresponds to each item in the above-mentioned container entry mask schema. In this way, the prior mask mask value describes the mask schema of the container entry before updating. The prior mask value is optional and can be omitted if unnecessary.

Next, FIGS. 21 and 2 show examples of the transition of the mask value of a certain container entry in the container hierarchy before update to the mask value in the container hierarchy after update.
This will be described using 5.

21 to 25, the allocation mask value assigned to each container entry is shown in parentheses () at the bottom of each container entry. As the mask value of the container entry, the mask value for the offset length up to the upper container entry "... X" is indicated by (...), and each container hierarchy is separated by a comma.
For example, the mask value of the container entry "... X.A" in FIG. 21A becomes (..., 00), and the mask value of the container entry "... X.A. a" in FIG. 25A becomes (... , 0, 0
0).

FIG. 21 shows an example in which the number of container entries under the certain container entry "... X" increases without changing the number of digits of the allocation mask value. 21A shows a state before the container hierarchy is updated, and the schema version is, for example, V.70. a1. Under the container entry "... X", the mask values are (..., 00), (..., 0), respectively.
1) and (..., 10) are the container entries "... XA", "... XB" and "... X.
C "exists.

At this point, the container hierarchy is updated, and as shown in FIG.
As shown in B, it is assumed that the container entry "... X. D" is added under the container entry "... X". Based on the flowchart of FIG. 18 described above, the number of container entries N = 4 under the upper container entry (container entry "... X") is 4, and the updated mask digit number M is 2. Therefore, the container entries "... X.A", "... X. B" and "... X.
The same allocation mask value as before the updating is given to C ", and the allocation mask value (11) is newly given to the container entry" ... X.D ".

In the case of the example shown in FIG. 21, only the allocation mask value corresponding to the container entry "... X.D" is added, and the correspondence relationship of the mask values of other container entries changes. Does not happen. Therefore, from the transmitting side replicator 12 to the receiving side replicator 17,
Although the update information to which the container entry "... X.D" is added is notified, it is not necessary to notify the mask value correspondence. That is, the container structure update information Msg. 1 ′ does not require a container entry mask schema for storing a priori mask value.

For example, the container structure update information Msg. The mask schema stored in 1'is It looks like this. Container entry "... X.A"
, "... X. B", "... X. C" and "... X.
D "Each mask schema is stored. Note that the contents in parentheses () are for explanation purposes and do not need to be described. In addition, [....] The structure of can be described.

FIG. 22 is an example in which the number of digits in the mask does not change and the number of container entries under a certain container entry "... X" decreases. The container entry "... X.C" is changed from the state of FIG. 22A which is the same state as that of FIG.
Is deleted and the container hierarchy is updated, resulting in a container hierarchy as shown in FIG. 22B. In this case, the mask value allocation is based on the flowchart of FIG. 18 described above, where the number of container entries under the upper container entry is N = 3 and the number of mask digits is M = 2.

Also in the case of FIG. 22, the allocation mask value (10) corresponding to the container entry "... X.C"
Is deleted, but the corresponding relationship of the mask values of other container entries does not change. Therefore, the container structure update information Msg. In 1 ', the update information notifying that the container entry "... X.C" has been deleted is stored and notified, but it is not necessary to notify the change of the mask value correspondence.

At this time, the container entry "... X.
The allocation mask value (10) of C ″ was deleted,
It is preferable in terms of implementation that the notification is also given. In this case, among the elements of the container entry mask schema corresponding to the container entry "... X.C", from the container entry name to the allocation mask value, for example, Null
As the value, only the structure of the prior mask value fills the element.

That is, the container structure update information Msg.
The mask schema stored in 1'is, for example, It looks like this. The part of the container entry "... X.C" is written as "Null", and the container entry "...
The mask value of the pre-update container entry "... X. C" is written in the previous mask value portion stored in X. C ".

In the receiving side replicator 17, the container structure update information Msg. When 1'is received, the mask corresponding to the container entry "... X.C" is deleted from the already set target mask list. That is, the offset value = 77, the mask length = 2, and the allocation mask value (1
Delete the mask corresponding to the container entry "... X.C" having 1).

FIG. 23 is an example in which the number of digits in the mask increases and the number of container entries under a certain container entry "... X" increases. Before the update, two container entries "... X. A" and "... X. B" are provided under the container entry "... X", as shown in FIG. 23A. They exist, and are assigned one-digit assignment mask values (0) and (1), respectively. In this state, as shown in FIG. 23B, the container entry "... X.C" is added.

After the update, the number of container entries under the upper container entry is N = 3, and the number of mask digits is M =
2, the number of mask digits has increased from before the update. Therefore, based on the flowchart of FIG. 18 described above, a new allocation mask value is added to each of the container entries “... X.A”, “... X. B” and “... X. C”. Is assigned.

In this case, the container entry "... X.A" in FIG. 23A and the container entry "... in FIG. 23B".
X.A ”corresponds to the container entry“ ...
X.B "and the container entry" ... X.B "in FIG. 23B.
And correspond. That is, the states of FIG. 23A and FIG. a1 and V.I. b
1, the schema version V. The mask value (..., 0) of a1 is the schema version V.a. It has been changed to the mask value (..., 00) of b1. Similarly, schema version V. The mask value (..., 1) of a1 is the schema version V.a. It has been changed to the mask value (..., 01) of b1. The change in these correspondences is transmitted from the replicator 12 on the transmitting side to the replicator 17 on the receiving side by updating the container structure update information Msg. Notified by 1 '.

The container structure update information Msg.
The mask schema stored in 1'is, for example, It looks like this. The previous mask value is added to the container entry mask schema of each of the container entries "... X.A" and "... X.B".

FIG. 24 shows an example in which the number of digits in the mask is reduced and the number of container entries under a certain container entry "... X" is reduced. Before updating, as shown in FIG. 24A, the container entries "... X. A", "... X. B" and "..." are subordinate to the container entry "... X".
X.C "exists, and a 2-digit mask value is assigned to each of them.

From this state, the container entry "... X.
After C "is deleted and the container structure is updated, FIG.
Suppose that the state shown in is reached. In FIG. 24B, there are two container entries “... X. A” and “... X. B” under the container entry “... X”, and the subordinate container of the upper container entry. The number of entries N = 2, the number of mask digits M = 1, and the number of mask digits M has decreased from before the update. Therefore, in this example, based on the flowchart of FIG. 18 described above, the updated container entries “... X. A” and “... X. B”.
A new assignment mask value is assigned to each of these.

In this case, the container entry "... X.A" in FIG. 24A is the container entry "... X.A" in FIG. 24B.
X. A "corresponds to the container entry" ... X. B "
And the container entry “... X.B” in FIG. 24B correspond to each other. That is, the states of FIG. 24A and FIG. a2 and V. b2, the schema version V. Mask value of a2 (..., 0
0) is the schema version V. b2 mask value (...,
Has been changed to 0). In addition, the schema version V.
The mask value (..., 01) of a2 is the schema version V.a. It has been changed to the mask value (2, ...) Of b2. The change in these correspondences is transmitted from the replicator 12 on the transmitting side to the replicator 17 on the receiving side by updating the container structure update information Msg. Notified by 1 '.

The container structure update information Msg.
The mask schema stored in 1'is, for example, It looks like this. The previous mask value is added to the container entry mask schema of each of the container entries "... X.A" and "... X.B". In addition, “Null” is used to notify the change of the container entry “... X.C” that does not exist under the container entry “... X” after the update, and the previous mask value is The allocation mask value of the container entry "... X.C" before update is described.

FIG. 25 is an example in which a container entry under a certain container entry is moved under another container entry. In FIG. 25A, the container entry “...
There are container entries "... X. A" and "... X. B" under X ". Furthermore, a container entry" ... "Exists under the container entry" ... X. A ". .
X.A.a "," ... X.A.b "," ... X.A.
c ”and“ ... X.A. d ”exist, and the number of container entries under the upper container entry is N = 4.
Under the container entry "... X.B", there is a container entry "... X.B. x", and N = 1.

For the container entries "... X. A" and "... X. B", a one-digit allocation mask value (0)
And (1) are assigned respectively. Also, the container entries "... XA a", "... XA b", "..." under the container entry "... XA".
In each of X.A.c "and" ... X.A.d ", since N = 4, the number of mask digits is M = 2, and two-digit allocation mask values (00), (01 ), (10) and (11), respectively, and N = 1 for the container entry “... X.B. x” under the container entry “... X. B”. Therefore, the number of mask digits M is 1, and a one-digit assignment mask value (0) is assigned.

From the state shown in FIG. 25A, the container entry "... X.A. b" is under the container entry "... X. A" and the container entry "...
X.B ”is moved to the subordinate of the container entry“ ...
X.B.b ", and the state shown in FIG. 25B is obtained.
The leaf entry under the container entry "... X.A. b" is a container entry "... X. A. b".
Moved with the movement of. In this case, under the container entry “... X.A”, the same state as described in FIG. 21 above is obtained, and the mask value of each container entry does not change. Meanwhile, the container entry "... X.
Under the control of “B”, a new allocation mask value is assigned to the moved “... X.B.b”.

The states of FIGS. 25A and 25B correspond to the schema version V. a3 and V.I. b3.
The container entry "... X.A. b" in FIG. 25A is shown in FIG.
5B container entry "... X.B.b" has been changed. That is, the schema version V. The mask value (..., 0, 01) of a3 is the schema version V.a. b3
Is changed to the mask value (..., 0, 1). The change in these correspondences means that the sender replicator 12 sends the container structure update information Ms to the receiver replicator 17.
g. Notified by 1 '.

The container structure update information Msg.
The mask schema stored in 1'is, for example, It looks like this. Container entry "... X.A.
a "," ... X.A.c "," ... X.A.
Each of the container entry mask schemas corresponding to "d", "... X.B. x" and "... X. B. b" is described in order. The previous mask value is added to the container entry mask schema of the container entry "... X.B.b" which is moved from the subordinate to the subordinate of the container entry "... X.B".

According to the present invention, when the above-mentioned target mask list is created, the correspondence relationship between the mask value of the updated container entry and the mask value of the container entry before the update (mask (Referred to as mapping information) is used. As a result, the receiving side can automatically update the target mask list.

FIG. 26 is a flowchart of the processing for creating the target mask list. This flowchart is executed by the receiving side replicator 17. Prior to the execution of this flowchart, it is assumed that a preset target mask list exists. The target mask list is created, for example, by displaying the directory structure stored in the receiving side server 16 on the user interface 33 of the receiving side client 15 and selecting an appropriate container entry from the displayed directory structure by the user. It The created target mask list is passed to the reception side replicator 17, and is stored in a storage or recording medium such as a memory or a hard disk included in the reception side replicator 17.

First, in step S70, a timer (not shown) included in the receiving side replicator 17 sets a cycle T and the timer is started. The cycle T corresponds to the container structure update information Msg. 1'is the buffering cycle. In the next step S71, the container structure update information Msg. 1 ′ is received by the receiving side replicator 17.

Container structure update information Msg. 1'is received, in step S72, the received container structure update information Msg. The same container structure update information M as 1 '
sg. It is determined whether 1'has been previously received. This is, for example, in the receiving side replicator 17, the container structure update information Msg.
The message ID of 1'is stored, and step S71 is performed.
The container structure information Msg. This is done by checking whether the 1'message ID exists in the accumulated message IDs. If the same container update information Msg. If it is determined that the first container structure update information Msg.1 'has been received, the process returns to step S71. 1'is received.

On the other hand, in step S72, step S71
The container hierarchy update information Msg. 1'the same information Msg. If 1'is not received, the process proceeds to step S73. In step S73,
The received container structure change information Msg. Based on the contents of 1 ', the container hierarchy of the directory structure stored in the receiving side server 16 is changed.

In the next step 74, the received container structure update information Msg. A new target mask list is generated based on the mask mapping information described in 1'and the target mask list already set.

For example, the received container structure update information Msg. If the description of the prior mask value is written in 1 ', a mask value that matches the mask value indicated by the prior mask value is searched for in the existing target mask list. If there is a matching mask value, the mask value on the existing target mask list is set to the received container structure update information Msg. 1'is replaced with the mask value described in the container entry mask schema corresponding to the previous mask value.

In the next step S75, it is determined whether or not the period T set in step S70 has been exceeded. If it is judged that the cycle T is not exceeded,
The process is returned to step S71, and the next container structure update information Msg. 1'is received.

On the other hand, if it is determined in step S75 that the period T is exceeded, the process proceeds to step S76. In step S76, the information indicating the container hierarchy changed in step S73 described above is received by the receiving replicator 1.
7 is presented to the client 15 on the receiving side and prompted to select a container entry to be specified. 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.

Thus, when the container entry is selected in step S76, the filtering mask corresponding to the selected container hierarchy is set in the next step S77. The list of set filtering masks is added to the target mask list. When additional writing is made to the target mask list, the process proceeds to step S
Returned to 70.

It should be noted that it is possible to automatically create and determine a new target mask list based on the prior mask values by omitting the process of step S76 or selecting whether or not to perform it.

FIG. 27 is based on the target mask list created according to the flow chart of FIG.
The leaf update information Msg. It is a flowchart which shows the process which selectively receives x1 '. The reception-side replicator 17 determines that the leaf update information Msg. x
1'is the leaf update information Msg. x1 'is selectively received. The leaf update information Msg. The process of step S32 in the flowchart of FIG. 14 described above is executed by x1 ′.

In FIG. 27, first, the first step S
At step 80, the reception side replicator 17 causes the leaf update information Msg. x
1'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 the filtering mask shown in x1 'exists in the target mask list. If it does not exist in the target mask list, the process returns to step S80.

On the other hand, if it is determined in step S81 that the filtering mask is present in the target mask list, the process proceeds to step S82, and the reception in step S80 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 S84, and the received leaf update information Msg. The message ID shown in x1 ′ has, for example, the receiving side replicator 17,
The copy 7 is stored in a recording or storage medium such as a memory or a hard disk. Then, in the next step S85, the received leaf update information Msg. x
1 ′ is selected as a processing target in the receiving side replicator 17.

On the other hand, in step S82, the leaf update information Msg. If it is determined that the reception of x1 ′ is not the first reception, the process is step S83.
Move to. In step S83, the received leaf update information Msg. The message ID of x1 ′ is the leaf update information Msg. Step S upon reception of x1 '
At 84, it is determined whether the message ID is the same as the message ID stored in the storage medium as copy 7.

If it is judged that they are the same,
The process is returned to step S80. On the other hand, step S8
If it is determined that they are not the same in step 3, the process proceeds to step S84, and the container structure update information Msg. The message ID of x1 ′ 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 x1 '.

As described above, in the directory structure managed by the receiving server 16, only the portion of the directory structure managed by the transmitting server 11 that reflects the preference of the user who uses the receiving server 16 is reflected. Can be accumulated and updated. Therefore, the receiving server 16 can effectively use the storage medium for storing the directory structure. At the same time, the storage cost of the directory structure in the receiving server 16 can be suppressed. Further, it is possible to significantly improve the processing efficiency for the search request of the contents of the receiving server 16 by the receiving client 15.

Although the assignment mask length assigned to each container entry is variable in the above description, this is not limited to this example. The allocation mask length may be a fixed length such as byte unit.

[0182]

As described above, according to the present invention, the difference update information of the directory structure managed by the transmitting side server, which is broadcast from the transmitting side, is
Only the part reflecting the preference of the user who uses the receiving side server is selectively accumulated by the target mask list. At that time, the information of the directory structure before the change and the directory structure after the change are associated with the information in the directory structure of the sender server by the prior mask value, and the information is broadcast from the sender to the receiver. . Therefore, on the receiving side, there is an effect that it is possible to automatically create the target mask list that reflects the change in the directory structure made on the transmitting side.

Therefore, according to the present invention, in the receiving side, the pressure of the calculation resources and the frequent interruption to the application execution at the time of creating the target mask list corresponding to the change of the directory structure managed by the transmitting side are reduced. There is an effect that can be.

[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 flowchart illustrating a method of managing container entry synchronization.

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

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

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

FIG. 15 is a flow chart for explaining the leaf entry synchronization management method in more detail.

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

FIG. 17 is a schematic diagram for explaining a bit array structure of mask values of a filtering mask.

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

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

FIG. 20 is a schematic diagram illustrating a target mask list.

FIG. 21 is a schematic diagram for explaining a transition of mask value allocation due to a change in container hierarchy.

FIG. 22 is a schematic diagram for explaining a transition of mask value allocation due to a change in container hierarchy.

FIG. 23 is a schematic diagram for explaining a transition of mask value allocation due to a change in container hierarchy.

FIG. 24 is a schematic diagram for explaining a transition of mask value allocation due to a change in container hierarchy.

FIG. 25 is a schematic diagram for explaining a transition of mask value allocation due to a change in container hierarchy.

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

FIG. 27 is a diagram showing broadcasted leaf update information Msg. It is a flowchart which shows the process which selectively receives x1 '.

[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 ...
・ Recipient directory server, 17 ・ ・ ・ Recipient directory server replicator

─────────────────────────────────────────────────── ─── 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-10-303983 (JP, A) JP-A-8-185348 (JP, A) Yoko Hirashima, Development of directory replication server for backbone systems, Research report of Information Processing Society of Japan, Japan, Information Processing Society, February 26, 1998, vol. 98 no. 15, pp. 227-232 (58) Fields surveyed (Int.Cl. ⁷ , DB name) G06F 12/00 G06F 13/00 G06F 17/30 H04L 12/00

Claims (12)

(57) [Claims] 1. A transmission device for transmitting a directory hierarchical structure that hierarchically manages the location of contents, wherein a container entry capable of storing information on a node of the hierarchical structure of the directory, which is under its control, Management means for managing a hierarchical structure of a directory consisting of leaf entries which are under the control of a container entry and which cannot store information on nodes under the container entry; and a change in the hierarchical structure of the directory managed by the management means is detected. Then, based on the detection result, the number assigned to each of the container entries in the hierarchical order from the upper side of the directory hierarchical structure before the change occurs.
The first filtering mask value consisting of an array and from the upper side of the directory hierarchical structure after the change has occurred.
Second filtering consisting of a numerical array attached in hierarchical order
A detection unit that obtains a mask value and difference information that is a difference between changes in the container entry, and the first filtering matrix obtained by the detection unit .
The mask value and the second filtering mask value are associated with each other for each container entry, and the first filtering mask value and the second filtering mask value are associated with each other.
And a filtering means for transmitting the filtering mask value together with the difference information obtained by the detecting means . The transmitter as claimed in claim 1, be present in the before the changes occur corresponding to the container entries extinguished by the change the second full
Transmitting apparatus according to claim <br/> that the I filter ring mask value to be replaced with a predetermined value. 3. A transmission method for transmitting a directory hierarchical structure for hierarchically managing the location of contents, wherein a container entry capable of storing information of a node under the hierarchical structure of the directory, which is under its control, A management step of managing a hierarchical structure of a directory consisting of leaf entries that are subordinate to a container entry and that cannot store information about nodes under the container entry, and a change in the hierarchical structure of the directory managed by the management step. On the basis of the detection result, and for each of the container entries, the hierarchical order from the upper side of the directory hierarchical structure before the change occurs
First filtering mask values <br/> consisting assigned number sequence, of the directory hierarchy structure after the change has occurred
The second file, which consists of a number array assigned in hierarchical order from the top
The filtering filter value and the difference information consisting of the difference between the changes of the container entries, and the first filter filter obtained in the detection step.
And the second filtering mask value is associated with each other for each container entry, and the associated first filtering mask value and the second filtering mask value are detected in the detecting step. And a step of transmitting together with the obtained difference information. 4. A receiving device for receiving a hierarchical structure of a directory that hierarchically manages the location of contents, which is transmitted, and which is a node of the hierarchical structure of the directory, which is subordinate to itself. Of the above-mentioned container entry, which is obtained by detecting a change in the hierarchical structure of the directory consisting of a container entry capable of storing For each of the above-mentioned container entries, the difference information consisting of the difference between changes, and from the upper side of the directory hierarchy structure before the change occurs to the floor
The first filtering matrix consisting of an array of numbers in layer order .
And risk values, the second having upper Symbol change the number sequence attached to a hierarchical order from the upper side of the directory hierarchy structure after produced
Selecting a receiving means for receiving and filtering mask values, and a management means for managing the hierarchical structure of directories configured on the basis of the difference information received by the receiving means, which is set in advance, the upper SL container entry Do
Change means for selectively fetching the difference information received by the receiving means based on a get mask list , and changing the hierarchical structure of the directory managed by the managing means based on the fetched difference information. And the first filtering filter received by the receiving means .
The receiving apparatus is characterized in that the target mask list is changed based on the corresponding relationship between the mask value and the second filtering mask value . 5. The receiving device according to claim 4 , wherein the modification of the target mask list further comprises a user.
A receiving device, which is automatically performed based on the user 's preference . The receiving device according to 6. The method of claim 4, further comprising a user interface means for presenting a hierarchical structure of the directory to the user, the target Ma
The receiver is characterized in that the list is further changed by a predetermined operation on the user interface means. 7. A receiving method for receiving a hierarchical structure of a directory that hierarchically manages the location of contents, which is transmitted, and is information of a node of the hierarchical structure of the directory that is subordinate to itself. Of the above-mentioned container entry, which is obtained by detecting a change in the hierarchical structure of the directory consisting of a container entry capable of storing For each of the above-mentioned container entries, the difference information consisting of the difference between changes, and from the upper side of the directory hierarchy structure before the change occurs to the floor
The first filtering matrix consisting of an array of numbers in layer order .
And risk values, the second having upper Symbol change the number sequence attached to a hierarchical order from the upper side of the directory hierarchy structure after produced
A step of receiving for receiving and filtering mask values, and a management step of managing the hierarchical structure of the configured directories based on the difference information received in step of the reception, which is set in advance, the upper SL container entry ter to select a Li
A change that selectively fetches the difference information received in the receiving step based on the get mask list and changes the hierarchical structure of the directory managed in the managing step based on the fetched difference information. And the first filter received in the receiving step.
The receiving method, characterized in that the target mask list is changed based on the corresponding relationship between the coding mask value and the second filtering mask value . 8. A transmission / reception system for transmitting a hierarchical structure of a directory that hierarchically manages the location of contents and receiving the hierarchical structure of the transmitted directory, wherein a node of the hierarchical structure of the directory is First management means for managing a hierarchical structure of a directory, which comprises a container entry capable of storing node information and a leaf entry which is under the container entry and is incapable of storing node information under its own; A change in the hierarchical structure of the directory managed by the first managing means is detected, and based on the detection result, each container entry is added in a hierarchical order from the upper side of the directory hierarchical structure before the change occurs.
A first filtering mask value consisting of an array of numbers
Higher level of the above directory hierarchy after the above changes
A second filter consisting of a numerical array assigned in hierarchical order from the side
A ring mask value and a detecting means for obtaining difference information consisting of a difference between changes in the container entry, and the first filtering matrix obtained by the detecting means .
The mask value and the second filtering mask value are associated with each other for each container entry, and the first filtering mask value and the second filtering mask value are associated with each other.
Transmitting means for transmitting a filtering mask value together with the difference information obtained by the detecting means, the difference information transmitted by the transmitting means, the first filtering mask value and the second filter
Receiving means for receiving a ring mask value, and second management means for managing the hierarchical structure of directories configured on the basis of the difference information received by the receiving means, which is set in advance, the upper SL container entry ter to select
The difference information received by the receiving means is selectively fetched based on the get mask list, and the hierarchical structure of the directory managed by the second management means is changed based on the fetched difference information. Change means, and the first filtering filter received by the receiving means .
Based on the above correspondence relationship between the risk value and the second filtering mask values, transmitting and receiving system is characterized in that so as to modify the target mask list. 9. The transmission / reception system according to claim 8 , wherein the second flag corresponding to the container entry that existed before the change occurred and disappeared due to the change.
A transmission / reception system characterized in that a predetermined value is substituted for the filtering mask value . 10. The transmission / reception system according to claim 8 , wherein the modification of the target mask list further comprises a user.
A transmission / reception system characterized by being automatically performed based on the user 's preference . 11. The transmission / reception system according to claim 8 , further comprising user interface means for presenting a hierarchical structure of the directory to a user, wherein the target mask list is changed by a predetermined operation on the user interface means. A transmission / reception system characterized by being further modified . 12. 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, wherein a node of the hierarchical structure of the directory and a subordinate A first management step of managing a hierarchical structure of a directory consisting of a container entry that can store node information and a leaf entry that is under the container entry and that cannot store node information under its own; A change in the hierarchical structure of the directory managed in the step of the first management is detected, and based on the detection result, for each of the container entries, a hierarchical order from the upper side of the directory hierarchical structure before the change occurs
The first filtering mask consisting of a number array attached to
Value and above directory hierarchy structure after above changes
The second file, which consists of a number array assigned in hierarchical order from the upper side of
And a filtering step for obtaining difference information consisting of a difference between changes in the container entries, and the first filter filter obtained in the detecting step.
Linking masking value and the second filtering mask value to each other for each container entry, and the matched first filtering mask value and the second filtering mask value are detected in the detecting step. A step of transmitting together with the obtained difference information and the difference information transmitted by the step of transmitting,
The first filtering mask value and the second flag value.
A receiving step of receiving the I filter ring mask value, and a second management step of managing the hierarchical structure of directories configured on the basis of the difference information received in step of the reception, which is set in advance, the upper SL container ter to select an entry
Based on the get mask list , the difference information received in the receiving step is selectively fetched, and based on the fetched difference information, the hierarchical structure of the directory managed in the second managing step is set. Changing step of changing the first filter filter received in the receiving step.
A transmitting / receiving method, characterized in that the target mask list is changed based on the corresponding relationship between the coding mask value and the second filtering mask value .