JP2001189069A - Change operational information recording method and device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a method for recording change operational information of a contents tree in a storage medium so that the deformed contents tree is displayed faithfully and the contents selected from the contents tree are reproduced in a reproducing side. SOLUTION: When the change operational information for changing the tree structure of the contents is recorded in the storage medium, a change series generation means 12 sets the recording order of the change operational information of the contents. When the child contents are added to the parent contents, the change operational information of the addition of the child contents is recorded, and then, the change operational information updating the parent contents is recorded. When the child contents are updated, the change operational information adding the updated new child contents, and then, updating the parent contents, and canceling the old child contents are recorded successively. When the child contents are canceled, the change operational information updating the parent contents, and then, canceling the child contents are recorded successively. Simultaneous addition, renewal, cancel of plural contents are performed in such a order.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a recording method for recording, on a storage medium, content tree change operation information composed of contents linked in a tree shape, a storage medium for recording the same, and a method for recording the recording medium. Device that reproduces a content tree from change operation information recorded on a storage medium, and in particular, displays a changing content tree by efficiently using the storage capacity of a storage medium or a reproduction device, and displays the content tree. The content selected from the tree can be reproduced.

[0002]

2. Description of the Related Art In recent years, package media such as DVDs having a large storage capacity have been developed, and it has become possible to record video and audio for a long time, such as picture books, encyclopedias, sports yearbooks and concerts. 2. Description of the Related Art Software has been developed that stores multimedia information, which is a combination of moving images, still images, audio, text, and the like, such as video, in a package, reproduces the information on a browsing device, and provides the information to a user.

FIG. 33 shows an example of a screen for displaying such multimedia information. On this screen, a window 61 for displaying a moving image, a window 62 for displaying a tree shape, and a window 63 for displaying contents such as still images and text are opened. The tree displayed in the window 62 hierarchically represents a display menu of contents in the window 63. When a user clicks a node of this tree with a mouse, the contents corresponding to the node are displayed in the window 63. For example,
While the concert video / audio is being reproduced in the window 61, a display menu of contents such as the artist name, lyrics and episode appearing in the window is displayed in the window 62, and the substance of the content is displayed in the window 63.

In order to display such multimedia information, for example, as shown in FIG. 34, a time zone for displaying various trees (tree 1, tree 2, tree 3) in accordance with the progress of a moving image is defined. A scenario is created that defines the content corresponding to the nodes of the tree.

[0005] A DVD that records multimedia information stores video and audio for a moving image, as well as content corresponding to each tree node and content link information. Further, the presentation means for displaying the multimedia information includes a cache for temporarily storing information read from the DVD.
The necessary data is read from the VD, stored in the cache, and displayed at a specified time.

[0006] The presenting means for displaying the tree shape of the content must display the content corresponding to the node of the tree when the node of the tree is selected. In this case, the content and the link information are sent from the DVD to the presenting means, and the presenting means constructs a tree structure (content tree) of the content from the information, and creates a tree from the content tree. It is desirable to extract and display the shape. When displaying a tree shape that changes along the time axis, the DVD sends to the presenting means the difference information of the location to be changed next time from the DVD to the presenting means, and the presenting means sends the content tree based on this information. Is modified to extract and display a tree shape from the modified content tree, so that the used storage capacity of the DVD and the cache can be reduced.

For example, when the tree shape shown in (701) of FIG. 30 is displayed, the content a, the content b, and the parent content p linked to the content a and b are transmitted from the DVD to the presentation means. . The presentation means generates a content tree of (701) from the received content,
The tree shape of (701) extracted from the content tree is displayed. The presentation means can display the corresponding content when the viewer selects the tree-shaped node.

The tree shape of (701) is expressed by (704)
In the case of transforming into the tree shape of (2), the content c is added from the DVD to the presenting means (702), and the parent content p accumulated by the presenting means is linked to the contents a, b, c, and d. The information to be replaced with p1 is sent from the DVD to the presentation means (703), and the content d is added from the DVD to the presentation means (704). The presentation unit that receives these data can generate the content tree of (704), and extracts the content tree from this content tree (704).
Can be displayed in a tree shape.

As shown in FIG. 31, a tree shape (801) composed of parent contents p and child contents a and b
Is transformed into a tree shape (803) composed of parent contents p and child contents a1 and b1, information (802) for replacing child contents a with child contents a1 and information (802) for replacing child contents b with child contents Child content b
The information (803) to be replaced with 1 is sent. Upon receiving these data, the presentation unit can generate the content tree of (803) and extract it from this content tree (80).
3) The tree shape can be displayed.

As shown in FIG. 32, a tree shape (901) composed of parent contents p and child contents a and b
Is changed to only the parent content p1 (904) by deleting the child contents a and b, the information to delete the content b (902) and the parent content are provided from the DVD to the presentation means. Information to replace with no p1 (90
3) and information (904) for deleting the content a.
The presentation means receiving these data sets the parent content p
Since only 1 is held, the tree shape to be displayed can be changed to the shape of (904).

[0011]

However, when the change operation information of the content tree is read from the storage medium and the presenting means generates and displays the content tree from this information, the content tree is not transformed. There is a problem that it takes a lot of time to finish.

The situation during this time will be described in more detail.

Although the maximum reading speed of the package medium is constant, as shown in FIG. 29, the data amount of the video / audio data (shaded portion 64) is not constant due to the pattern and tone. In order to maintain the highest quality of video and audio during reproduction, it is necessary not to cut off the mountain of the video and audio data.

If a fixed bit rate is assigned to the content tree change operation information, it may be necessary to restrict a part of the video / audio data. It is desirable to record this change operation information in a gap between video and audio (white portion 65). However, at this time, the bit rate that can be used for the change operation information is not constant.

When recording the change operation information of the content tree in the gap between video and audio, when the bit rate of the gap is small, it takes a long time to read out all the change operation information of the content tree from the package medium. become.

As a countermeasure in such a case, a first area for storing the currently displayed content tree and a second area for storing the modified content tree are provided in the cache of the presenting means. Is read out from the package medium as soon as possible to generate the modified content tree in the second area of the cache by the time specified by the scenario, and at the specified time,
A method of switching to display the content tree of the second area may be considered. However, this method has a drawback that a cache having a large storage capacity must be provided in the presentation means.

On the other hand, when the cache changes the content tree by using only one area, the content that should be visible is not displayed during the change of the content tree,
There is a problem that invisible content is displayed.

For example, in the case of FIG. 30, it is possible to access the content c at the stage of (703).

In the case shown in FIG. 31, the content a1 can be accessed at the stage (802).

In the case of FIG. 32, the content b cannot be accessed at the stage (902).

If the operation of changing the content tree is started early, such an abnormal state will continue for a long period of time.

If a content tree change operation is to be performed at the last minute of the time specified by the scenario, the bit rate 65 in which the content tree change operation information is recorded.
Must be integrated and the transmission start time of the change operation information must be obtained by calculation, which complicates the processing. In a situation where the bit rate is not known in advance (for example, when video and audio are encoded in real time), such processing cannot be performed. On the side receiving the change operation information, the change and display of the content tree must be performed instantaneously, and the processing capability of the browsing device needs to be extremely high, which is not easy to realize.

The present invention solves such a conventional problem, and is a recording method for recording change operation information of a content tree on a storage medium. Thus, the present invention provides an efficient recording method capable of faithfully displaying a content tree to be deformed and reproducing a content selected from the content tree. It is an object of the present invention to provide a medium, a device for performing the recording method, and a device on the reproduction side.

[0024]

Therefore, according to the present invention, in a recording method for recording change operation information for changing a tree structure of a content in a storage medium, when a child content is newly added to a parent content, Change operation information for adding a child content is recorded first, and then change operation information for updating the parent content to a parent content having a link to the child content to be added is recorded.

When the child content linked to the parent content is updated with the new child content, the change operation information for adding the new child content to be updated is recorded first, and then the new parent content is updated. Change operation information for updating to parent content having a link to child content is recorded, and then change operation information for deleting old child content is recorded.

Further, when deleting a child content linked to the parent content, change operation information for updating the parent content to the parent content in which the link to the child content to be deleted is deleted is recorded, and then the child content is deleted. The change operation information is recorded.

Further, a difference tree containing only the content to be changed is generated from the tree structure of the content, an operation binary tree representing an operation sequence is generated from the difference tree, and the operation nodes of the operation binary tree are depth-prioritized in order. The search is performed, and the change operation information specified for the operation nodes in the search order is sequentially recorded in the storage medium.

Further, in a production apparatus for producing a storage medium storing video / audio data and change operation information for changing a tree structure of the content, a content production means for producing the content, A change sequence generation unit that sets a recording order, an encoder that encodes video and audio data, and a multiplexing unit that multiplexes the change operation information transmitted from the change sequence generation unit and the encoded video and audio data, Writing means for writing the output of the multiplexing means to the storage medium is provided, and the change sequence generation means sets the recording order of the change operation information according to the order defined by the recording method.

In a reproducing apparatus for reproducing a storage medium on which video and audio data and change operation information for changing a tree structure of content are recorded, a reading means for reading data recorded on the storage medium; Separating means for separating video / audio data and change operation information from the output data; storage means for reproducing and storing the tree structure of the content in accordance with the sequentially read change operation information; A presentation dialogue unit for extracting a tree shape of a tree structure, and a presentation unit for combining and displaying video and audio and the extracted tree shape are provided.
When content is selected from the displayed tree shape,
The corresponding content is read from the storage means and displayed on the presentation means.

When the content tree change operation information is recorded on the storage medium by the recording method of the present invention, the reproducing apparatus can simultaneously add, update, or update a plurality of contents constituting the content tree at a specific time. It can be displayed as deleted. Such content tree display can be performed by efficiently using the storage medium and the storage capacity of the playback device.

[0031]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS (First Embodiment) FIG. 1 shows a package media production apparatus 1 for recording content tree change operation information on a package medium 17 according to a recording method of the present invention. 1 shows a package media browsing device 2 to be played back.

The package media production device 1 comprises a video / audio storage means 13 for storing video / audio to be stored in the package media 17 in order to produce a package media 17 storing multimedia information, and encodes the video / audio. Video / audio encoder 14, content generating means 11 for producing still image or text content, and change sequence generating means for adjusting the recording order of content tree change operation information so that the content tree can be correctly reproduced on the reproducing side.
12 and multiplexing means for multiplexing audio and video and content
And package medium writing means 16 for writing the multiplexed information to the package medium 17.

In this production apparatus, the contents constituting the tree structure are produced by the content production means 11. The change sequence generating means 12 arranges the change operation information including the produced content and the link information in an order to be read on the reproduction side.

As will be described later, the reproducing side reads the change operation information from the package medium in this order, and generates / changes / displays the content tree. Therefore, this order is set so that the content tree can be reproduced in the correct order on the reproducing side.

The change operation information arranged by the change sequence generation means 12 has a fixed bit rate or less together with the coded video and audio, and all changes are instantaneously reflected in the last change operation information. The data amount is controlled and multiplexed so as to be recorded at the proper timing, and is written to the package medium 17. In this way, the content and link information, that is, the content tree change operation information is recorded in the gap between the video and audio shown by 65 in FIG.

On the other hand, the package media browsing device 2
Package medium reading means 21 for reading data from the package medium 17, and separating means 22 for separating the read data into video / audio and content tree change operation information.
A video / audio decoder 23 for decoding encoded video / audio, a presentation information cache unit 25 for storing the content tree, and a content tree stored in the presentation information cache unit 25 by the separated change operation information. Sequential updating means 24 for changing, an operation input means 29 for the viewer to select a tree-shaped node, and a tree shape extracted from the content tree stored in the presentation information caching means 25, and selected by the operation input means 29 Presentation dialogue means 27 for reading the extracted content from the presentation information caching means 25, and the video / audio decoded by the video / audio decoder 23 and the presentation dialogue means.
Combining means 26 for combining the content tree output from 27
And a presentation means 28 for displaying the synthesized video and audio and the content tree.

In this browsing device, the package media 17
When the multimedia information recorded on the package media is reproduced, the package medium reading means 21 reads the recording data of the package medium 17, and the separating means 22 separates the data into video / audio data and content tree change operation information. . The video / audio data is decoded by the video / audio decoder 23 and input to the synthesizing means 26.

Further, the content tree change operation information is input to the sequential update means 24, and the sequential update means 24 changes the content tree held in the presentation information cache means 25 based on the change operation information. . The content tree is sequentially changed by the change operation information sequentially read from the package medium 17.

The presentation interactive means 27 extracts the tree shape by following the link relationship of the content tree, and outputs the tree shape to the synthesizing means 26.

The content tree output from the presentation dialogue means 27 is synthesized with the decoded video and audio and displayed on the presentation means 28. When the viewer selects a node of the displayed content tree using the operation input unit 29, the presentation dialogue unit 27 reads out the content corresponding to the selected node from the presentation information cache unit 25 and sends the content to the combining unit 26. Output and this content is displayed.

The following three forms are available for changing the content tree.
There are types. (1) “Add”: Add a content to the content tree (in the drawing, the content to be added is indicated by “+”). (2) “Update”: Replace the content of the content making up the content tree (update in the drawing) (3) “Delete”: Deletion of the content from the content tree (in the drawing, the content to be deleted is indicated by “−”). Further, as shown in FIG. Although there may be a plurality of layers, here, for simplicity, a simplified process of changing a content tree in which child contents have a single layer will be described.

FIG. 2 shows a change processing order when content is added to the content tree. This order indicates the order in which the content tree change operation information is recorded on the package medium in the package media production device 1, and at the same time, the content tree held in the presentation information cache unit 25 of the package media browsing device 2 is changed. The order is shown.

As shown in FIG. 2A, the content tree initially has a content p as a parent content and a content a of a child content linked to the parent content.
And the content b, and are stored in this state in the presentation information cache unit 25 of the package media browsing apparatus 2.

When adding the contents c and d as child contents to the contents tree and changing the contents tree to the form of FIG. 2 (3), first, FIG. 2 (2)
As shown in (2), the contents c and d of the child contents are added, and then, as shown in FIG. 2 (3), the content p is updated to the content p1. Content p1
Is obtained by adding links to the contents c and d to the contents p.

According to this order, the package media 17
, The change operation information for adding the content c, the change operation information for adding the content d, and the change operation information for updating the content p to the content p1 are recorded in this order.
When the package media 17 is reproduced, the content tree stored in the presentation information cache unit 25 of the package media browsing device 2 is changed in the order shown in FIG.

At this time, the contents c and d
Since the links to the contents c and d are not completed at the stage of FIG. 2B stored in the presentation information caching means 25, the tree shape extracted from the contents tree is as shown in FIG. It is the same as the tree shape of the stage. Therefore, there is no change in the shape of the content tree displayed on the presentation means 28, and the viewer cannot reproduce the content c and the content d and cannot recognize the existence of the content c and the content d. Note that the content a and the content b can be selected and displayed as before.

At the stage of FIG. 2 (3) in which the content p1 is stored instead of the content p, a link connecting the content p1 and the content a, b, c, d is completed.
The presentation dialogue means 27 extracts the tree shape of FIG. 2 (3) from the content tree, and the extracted tree shape is displayed instead of the tree shape of FIG. 2 (1).

When the viewer selects content c or content d from the displayed content tree,
The corresponding content is read from the presentation information cache unit 25 and displayed.

As described above, the contents c and d are stored in the contents p
It is activated simultaneously when 1 is accumulated. In this way, the addition of activating multiple contents at the same time,
Here, it is referred to as "addition requiring synchronization".

In the case of the addition requiring the simultaneity, the storage time of the content p1 (that is, the timing of reading the change operation information of the content p1 from the package medium)
Is simply adjusted to the point in time when the tree shape specified by the scenario is changed.

Note that the recording order of the change operation information for generating the initial content tree shown in FIG. 2 (1) is such that the content p, the content a, and the content b in FIG.
Is the same as the recording order of the content c, the content d, and the content p1 when the content does not exist, that is, the change operation information of the content a, the change operation information of the content b, and the change operation information of the content p are written in this order.

In a case where a plurality of contents are added to the contents tree, there is a case where it is not necessary to make their validity coincide with a specific time. FIG. 3 shows an example of a change operation sequence in the case of “addition without requiring concurrency”. In FIG. 3 (2), child content c is added to the content tree.
3 (3), the parent content p of the content tree is updated to p1, and in FIG. 3 (4), the child content d is further added to the content tree.

In this case, at the stage of FIG. 3 (3), a tree shape composed of the parent content p1 and the child contents a, b, c is displayed, and the viewer can select the child contents a, b, c. Become. At the stage of FIG. 3D, a tree shape including the parent content p1 and the child contents a, b, c, and d is displayed, and the viewer can view the child contents a, b, c, and d.
Can be selected.

FIG. 4 is a flowchart showing the operation procedure of the package medium producing means 1 when writing change operation information for adding a content to the content tree to the package medium. Hereinafter, the additional processing of FIG. 2 will be described as an example.

Step 1: The content creator instructs the content created by the content creation means 11 to be added to the content tree, and step 2: registers the content.

Step 3: Also, the content creator
Specifies whether adding content requires concurrency.

Step 4: When it is specified that additional synchronization is required, the change sequence generation means 12 sends the content to be added to the multiplexing means 15; Step 7: Processing after Is identified in the reservation list for reserving the content.

In this reservation list, as shown in FIG.
The content of the reservation process and the content are described. In the case of adding a content, a process of updating the parent content is reserved, and the content of the content is a parent content to which a link to the added child content is added.

Step 8: When the content to be added (c in FIG. 2) is transmitted to the multiplexing means 15 for the first time, since the parent content is not described in the reservation list, a link to the content (c) to be added is added. The parent content is described (reserved) in the reservation list.

Step 10: If the instruction of the content to be added has not been completed, the procedure from step 1 is repeated.

When the second content to be added (d in FIG. 2) is transmitted to the multiplexing means 15 in the second round procedure (step 6), since the parent content has already been described in the reservation list, Step 9: Add a link to the child content (d) to be added to the reserved parent content.

As a result, the content p1 to which the links to the content c and the content d are added is described in the “content” of the reservation list.

On the other hand, if no additional concurrency is required in step 4, step 5: The child content to be added and the changed parent content (p1) are sent to the multiplexing means 15.

In step 10, when all the contents to be added are instructed, the change sequence generation means 12
Step 11: Identify whether there is reserved data in the reservation list. If there is reserved data, Step 12: send the reserved data to the multiplexing means 15.

The data of the change operation information sent to the multiplexing means 15 according to the above procedure is sequentially multiplexed with the video / audio data, and written on the package medium in the order of transmission.

Next, a description will be given of a change processing order when updating the content of the content tree.

FIG. 6 shows a case where a plurality of contents in the contents tree are updated simultaneously, that is, “update requiring synchronization”.
Are shown in the order of the change processing for executing. This order is the order in which the content tree change operation information is recorded on the package medium in the package media production device 1, and at the same time, the content tree held in the presentation information cache unit 25 of the package media browsing device 2 is changed. Order.

This content tree is initially stored in the presentation information cache means 25 of the package media browsing apparatus 2 in a form in which the content a and the content b are linked to the parent content p, as shown in FIG. . The child content a of the content tree is set as the child content a1,
When simultaneously updating the child content b with the child content b1, first, as shown in FIG. 6 (2), the child content a1 and the child content b1 are added to the content tree.
Next, as shown in FIG. 6C, the parent content p is updated to the parent content p1, and finally, the child content a and the child content b are deleted.

According to this order, the package media 17
Include change operation information for adding child content a1, change operation information for adding child content b1, and parent content p.
Is updated in the order of the change operation information for updating the parent content p1, the change operation information for deleting the child content a, and the change operation information for deleting the child content b. The content tree stored in the presentation information caching means 25 is changed in the order shown in FIG.

However, a separate content id is given to each content, and a content id to be pointed is stored in the link to the content. Then, when another content having the same content id is input, the presentation information caching unit 25 overwrites the content with the content of the same content id. Therefore, another content having the same content id does not exist in the presentation information cache unit 25 at the same time.

At this time, the child content a1 and the child content b1 are stored in the presentation information cache means 25 as shown in FIG.
In the stage (2), the content a1 and the content b1
Since the link to is not completed, the tree shape extracted from this content tree is the same as the tree shape in the stage of FIG. Therefore, there is no change in the content tree displayed on the presentation means 28, and the viewer cannot reproduce the content a1 and the content b1 and cannot recognize the existence of the content a1 and the content b1. Note that the content a and the content b can be selected and displayed as before.

At the stage of FIG. 6 (3) in which the content p1 is stored in place of the content p, since the link connecting the content p1 and the content a1, b1 is completed, the presentation dialogue means 27 converts the content tree into FIG. The tree shape of 3) is extracted, and the extracted tree shape is displayed instead of the tree shape of FIG.

When the viewer selects the content a1 or the content b1 from the displayed content tree, the corresponding content is read from the presentation information cache means 25 and displayed.

As described above, the child content a1 and the child content b1 are simultaneously activated when the parent content p1 is stored. Therefore, the content tree to be displayed can be changed in accordance with the scenario only by adjusting the timing of reading the change operation information of the parent content p1 from the package medium to the time when the tree shape specified by the scenario is changed.

FIG. 7 shows a change processing order in the case of performing “update without requiring concurrency” on child contents of the content tree. In FIG. 7 (2), the child content a in the content tree is updated to the child content a1.
In (3), the child content b of the content tree is updated to b1.

In this case, at the stage of FIG. 7 (2), a content tree including the parent content p1 and the child contents a1 and b is displayed, and the viewer can select the child content a1 and the child content a1b. At the stage of FIG. 7C, a content tree including the parent content p1 and the child contents a1 and b1 is displayed, and the viewer can select the child content a1 and the child content b1.

FIG. 8 is a flowchart showing the operation procedure of the package media producing means 1 when writing change operation information for updating the content of the content tree to the package medium. Hereinafter, the update process of FIG. 6 will be described as an example.

Step 11: The content creator instructs the content to be added to the content tree with the child content a1 created by the content creating means 11, and step 12: registers the content.

Step 13: Also, the content creator
Specifies whether the update requires concurrency.

Step 14: When the update sequence is required to be synchronized, the change sequence generation means 12 adds a new content id to the designated content and sends it to the multiplexing means 15, 17: Identify whether or not the parent content is reserved in the reservation list. If not, step 18: Add the linked child content a to the reservation list.
Step 20: Add a reservation at the end of the reservation list to delete the old content (a).

On the other hand, if the update is not required to be synchronized in step 14, step 15: The content a1 is sent to the multiplexing means 15 for updating the content a.

Step 21: If the instruction of the content to be updated has not been completed, the procedure from step 11 is repeated.

When the content b1 requiring the update synchronization is transmitted by the second round procedure (step 16), step 19: link the child content b of the parent content described in the reservation list to the child content Step 20: Add a reservation to delete the content b at the end of the reservation list.

As a result, in the reservation list, as shown in FIG. 9, the parent content p is updated to the content p1 linked to the content a1 and the content b1, the content a is deleted, and the content b is deleted. The processing to be performed is reserved.

If it is determined in step 21 that all the operations for instructing the child content to be updated have been performed, the change sequence generation means 12 determines whether or not there is reserved data in the reserved list. If there is reserved data, Step 23: multiplex the reserved data in the order of reservation.
Send to 15.

The data of the change operation information sent to the multiplexing means 15 in such a procedure is sequentially multiplexed with the video / audio data, and is written on the package medium in the order of transmission.

Next, a description will be given of the order of the change processing when deleting the content of the content tree.

FIG. 10 shows a change operation sequence for simultaneously deleting a plurality of contents in the contents tree, that is, executing “deletion requiring concurrency”. This order is the order in which the content tree change operation information is recorded on the package medium in the package medium production device 1 and at the same time, the package medium viewing device 2
This is the order in which the content tree stored in the presentation information cache means 25 is changed.

This content tree is initially shown in FIG.
As shown in (2), child content a and child content b are stored in the presentation information cache means 25 in a form linked to the parent content p. When deleting the child contents a and b at the same time in the content tree, first, as shown in FIG. 10 (2), the parent content p is updated with the content p1 from which the link to the child content has been deleted. 1
0 (3), the content a and the content b
Remove.

In accordance with this order, the package media 17
, The change operation information for updating the parent content p to the parent content p1, the change operation information for deleting the child content a, and the change operation information for deleting the child content b are recorded in this order, and the package medium 17 is reproduced. At times, the content tree stored in the presentation information cache unit 25 of the package media browsing apparatus 2 is changed in the order shown in FIG.

In this case, since the links to the child contents a and b disappear at the stage of FIG. 10B in which the parent contents are updated at p1, the displayed contents tree is changed. Therefore, even if the content a and the content b remain in the presentation information cache unit 25, the viewer cannot select the content a and the content b. As a result, the content a and the content b are effectively It is equal to the case where they are deleted at the same time.

Therefore, the content tree to be displayed can be changed according to the scenario simply by adjusting the timing of reading the change operation information of the parent content p1 from the package medium to the time of changing the tree shape defined by the scenario.

FIG. 11 shows a change processing order in the case of performing “deletion that does not require synchronization” on child contents of the content tree. In FIG. 11 (2), the child content b in the content tree is deleted, and in FIG. 11 (3), the parent content p is updated to the parent content p1.
In (4), the child content a is deleted.

In this case, at the stage of FIG. 11 (2), the displayed content tree changes to a tree shape composed of the parent content p and the child content a, and at the stage of FIG. 11 (3), the shape of only the parent content p1 is changed. Changes to The viewer is shown in FIG.
At the stage of (2), the child content b cannot be selected,
At the stage of FIG. 11 (3), the child content a cannot be selected.

FIG. 12 is a flowchart showing the operation procedure of the package media producing means 1 when writing change operation information for deleting the content of the content tree to the package medium. Hereinafter, the deletion process of FIG. 10 will be described as an example.

Step 31: The content creator specifies the content a to be deleted, and Step 32: specifies whether or not the deletion requires concurrency.

Step 33: The change series generating means 12 identifies whether or not the parent content has been reserved in the reservation list when the deletion simultaneity is necessary. Step 36: : Reserving the parent content from which the link to the child content a has been deleted in the reservation list. Step 38: Add a reservation for deleting the content (a) at the end of the reservation list.

On the other hand, if simultaneous deletion is not necessary in step 33, step 34: information for deleting the content a and the parent content from which the link to the content a has been deleted are transmitted.

Step 39: If the instruction of the content to be deleted has not been completed, the procedure from step 31 is repeated.

When the content b requiring simultaneous deletion is specified by the second round procedure, step 37: delete the link to the content b of the parent content described in the reservation list, and step 38: reserve list. At the end of the list, a reservation for deleting the content b is added.

As a result, in the reservation list, as shown in FIG. 13, the process of updating the parent content p to the content p1 from which the links to the content a and b have been deleted, the process of deleting the content a, The process of deleting b is reserved.

In step 39, if all the operations for designating the content to be deleted have been performed, the change sequence generation means 12 determines whether or not there is data reserved in the reservation list, and If there is data, step 41: multiplex the reserved data in the order of reservation
Send to 15.

As a result, the parent content is first updated to p1, and the contents a and b are effectively deleted at the same time.

FIG. 14 shows an operation procedure of the package medium producing means 1 in a case where change operation information for adding, updating and deleting contents constituting the contents tree in a combined manner is written in the package medium. .

In this case, Step 51: The content creator indicates the content to be operated, Step 52: Designate the type of operation, Step 53: If the operation type is update or addition, Step 54: Register the content of the content, Step 55: Specify whether the change requires concurrency.

Step 56: The change sequence generating means 12 sends information for adding, updating or deleting contents to the multiplexing means 15 when the change is not required to be synchronized.

On the other hand, in step 56, if the simultaneity of the change is necessary, the procedure of steps 58 to 62 and 74 to 76 is added according to the type of operation (step 6 in FIG. 4). In the case of updating, the procedure from step 63 to step 68 and the procedure from step 74 to step 76 (same as the procedure after step 16 in FIG. 8)
And, in the case of deletion, steps 69 to 73 and step
The procedure from step 74 to step 76 (same as the procedure from step 35 onward in FIG. 12) is performed.

FIG. 15 shows that the child content a is updated to the child content a1, the child content b is deleted, and the child content c is added from the content tree in which the child content a and the child content b are linked to the parent content p. FIG. 16 shows a reservation list at this time.

By taking such a procedure, in the content tree, change operation information that specifies addition, update, and deletion that requires synchronization of contents, or addition, update, and deletion that does not require synchronization is recorded on the package medium. can do.

On the other hand, the reproducing side sequentially reads the change operation information from the package medium, changes the content tree, extracts a tree shape from the content tree, and displays it. As a result, multiple nodes can add, update, or delete content trees at the same time,
Alternatively, a content tree in which each node is individually added, updated, or deleted can be displayed, and when a content is selected from the content tree, the corresponding content can be displayed.

(Second Embodiment) In the second embodiment,
The order in which the content tree having a plurality of layers is changed will be described. This order is a generalization of the order when performing a change process that requires concurrency on the content tree. The order in a single hierarchy described in the first embodiment is the generalized change process. It corresponds to one form.
However, here, change processing that does not require synchronization is not dealt with.

This order is the order in which the content tree change operation information is recorded on the package medium in the package media production device 1, and at the same time, the content tree held in the presentation information cache unit 25 of the package media browsing device 2 is The order in which they will be changed.

When changing a content tree having a plurality of hierarchies, first, a change operation for each content is registered.
FIG. 17 illustrates a content tree in which a content change operation is registered. The nodes of the content tree each represent the content, and the node for adding operation is indicated by +, the node for updating operation is indicated by *, and the node to be deleted is indicated by-.

A subtree (subtree) composed of only nodes to be changed is defined as a difference tree. FIG.
8 shows a difference tree in which a change operation is registered in the content tree of FIG. Here, the difference tree is divided into two subtrees having no link to each other.

When the change operation is registered in the difference tree, an operation binary tree is created from the difference tree.

The operation binary tree is a binary tree in which a node includes zero or more pieces of operation information as an operation list, defines an order relationship between nodes, and represents a series of operations. That is, when focusing on a certain node, the operation of the focused node is performed after the operation sequence represented by a subtree composed of descendants on the left side of the focused node (hereinafter, referred to as a descendant subtree) and on the right side of the focused node. Defines what is done before the operation sequence represented by the descendant subtree.

As shown in FIG. 19, the operation binary tree is a sequence of operation procedures. The operation binary tree is in-order (In Order) and has a left-first depth-first (Depth First) order. A) A search is performed, and operations described in an operation list defined by the searched nodes are sequentially executed. Note that the depth-first search is a search method that gives priority to a search in the vertical direction of the tree structure, and is a method for a “width-first search” that gives priority to a search in the horizontal direction.

FIG. 20A shows an algorithm for executing a left-first depth-first search in order. In this search algorithm, the descendant subtree on the left side of the parent node is searched first, then the parent node, and then the descendant subtree on the right side. Data structures such as binary trees and their search algorithms are a category of information engineering called "graph theory". For example, Wilson's "Introduction to Graph Theory" and Aho's "Data Structure and Algorithm" Explained.

When the operation binary tree is created as shown in FIG. 21, a left child node (hereinafter referred to as a "left child node") of the root node (Fr) at the vertex is searched for, and the left child node F1 is searched. Is found, the left child node of the node F1 is searched, and if the left child node F3 is found, the left child node of the node F3 is searched. If no left child node of node F3 is found, node F3 is set as the first operation node. Next, the node F1 which is the parent of F3 is set as the second operation node, and then a child node on the right side of the node F1 (hereinafter referred to as a "right child node") is searched. When the right child node F4 is found, the left child node of the node F4 is searched. When the left child node F7 is found, the left child node of the node F7 is searched. When the left child node of the node F7 is not found, the node F7 is searched. Set as the third operation node.
Next, a node F4 which is a parent of F7 is set as a fourth operation node. Next, the right child node of the node F4 is searched. If the node F8 is found, the left child node of the F8 is searched. If not found, the F8 is set as the fifth operation node. Since the search for the descendant subtree on the left side of the root node Fr has been completed in this way, the root node Fr is set as the sixth operation node. Next, a search is made for a descendant subtree on the right side of the root node Fr. First, the root node Fr
If the node F2 is found, the left child node of this node F2 is searched. If the node F5 is found, the left child node of the node F5 is searched. If not found, F5 is set as the seventh operation node. Set. Next, the node F2 which is the parent of F5 is set as the eighth operation node. Next, a right child node of F2 is searched, and if a node F6 is found, it is searched for a left child node in F6. If no left child node is found, F6 is set as a ninth operation node.

When the operation binary tree is created from the difference tree, the operation nodes are searched in such an order, and when the contents of the operation list of the node are executed, the operation nodes are extracted from the content tree at the intermediate stage. The operation content of each operation node is set so that the tree shape does not change.

For example, when applied to the change of the single-level content tree described in the first embodiment, the difference tree in the case of adding the contents c and d shown in FIG.
become that way. An operation binary tree having an operation node corresponding to the parent content p of the difference tree as a root node Fr, a left child node of F1 and a right child node of F2 is created,
Set the operation content of each node. As is clear from the description of the first embodiment, the operation list of the root node Fr describes the operation content for updating the content p to the content p1, and the list of the left child node F1 includes the content of the content p1. The addition of the contents c and d to be executed prior to the update is described. Thus, the operation binary tree of FIG. 22B is completed.

The change sequence generating means 12 of the package media production apparatus 1 sends the change operation information described in the list of the left child node F1 to the multiplexing means 15 from the operation binary tree according to the algorithm of FIG. Next, the change operation information described in the list of the root node Fr is transmitted,
Next, the change operation information described in the list of the right child node F2 is transmitted (in this case, there is no change operation information described in the list of the right child node F2). The plurality of pieces of change operation information described in the operation list of one node may be transmitted in any order.

On the package medium, the change operation information of the content tree is described in the order transmitted from the change sequence generating means 12. Reading device 2 for this package media
, The content tree stored in the presentation information cache unit 25 is changed in the order shown in FIG.

When the content a is updated to the content a1 and the content b is updated to the content b1 as shown in FIG. 6, the difference tree becomes as shown in FIG. An operation node corresponding to the parent content p of the difference tree is defined as a root node Fr, and its left child node is F1 and its right child node is F
2, an operation binary tree is created, and the list of the right child node F2 describes the deletion of the content a and the content b operated last, and the list of the left child node F1 includes the content a1 and the content operated first. The addition of the content b1 is described, and the update of the parent content p is described in the list of the root node Fr. Thus, the operation binary tree of FIG. 23 (2) is completed.

The change sequence generation means 12 of the package media production apparatus 1 sends, from the operation binary tree, additional change operation information of the contents described in the list of the left child node F1 to the multiplexing means, Sending the change operation information of the parent content described in the list of the node Fr;
Next, change operation information for deleting the content described in the list of the right child node F2 is transmitted.

In the package medium, the change operation information of the content tree is described in the order transmitted from the change sequence generation unit 12, and when the package medium is reproduced by the browsing device 2, the change information is stored in the presentation information cache unit 25. The content tree is changed in the order shown in FIG.

When the content a and the content b are to be deleted as shown in FIG. 10, the difference tree is as shown in FIG.
become that way. An operation binary tree is created in which the operation node corresponding to the parent content p of the difference tree is the root node Fr, the left child node is F1, and the right child node is F2. The deletion of the contents a and b to be operated is described, and the root node Fr is described.
Describes the update of the parent content p executed prior to the deletion of the content a and the content b. Thus, the operation binary tree of FIG. 24 (2) is completed.

The change sequence generating means 12 of the package media production device 1 derives the root node Fr from the operation binary tree.
The change operation information for updating the parent content described in the list of the right child node F2 is transmitted to the multiplexing means, and then the change operation information for deleting the content described in the list of the right child node F2 is transmitted.

In the package medium, the change operation information of the content tree is described in the order transmitted from the change sequence generation unit 12, and when the package medium is reproduced by the browsing device 2, the information is stored in the presentation information cache unit 25. The content tree is changed in the order shown in FIG.

FIG. 25 shows a general procedure in the package media production apparatus 1 when adding, updating, and deleting contents requiring simultaneity with respect to a multi-level contents tree.

Step 81: The content creator specifies the content to be operated. Step 82: Designates the type of operation (addition / update / deletion). Step 83: If the operation type is update or addition, Step 84: Register the content of the new content to be updated or added.

Step 85: The content to be operated is registered in the operation difference tree in the procedure described later.

Step 86: When all the contents to be operated are registered in the difference tree, Step 87: The change sequence generation means selects partial trees one by one from the difference tree.

Step 88: If there is a subtree to be selected, Step 89: Create an operation binary tree for the selected subtree according to the procedure described later. Step 90: Change the operation binary tree with reference to the operation binary tree The operation information is sent to the multiplexing means. The procedure from step 87 to step 90 is executed until all subtrees are selected.

FIG. 26 shows the procedure for registering the content to be operated in the difference tree in step 85.

Step 91: It is determined whether or not a node corresponding to the content to be operated already exists in the difference tree. If not, a step 92: add a node corresponding to the content to be operated.

Step 93: Next, it is determined whether or not the parent node of the node corresponding to the content to be operated already exists in the difference tree. If not, step 94: the parent node is added to the difference tree. Add.

Step 95: When the operation attribute to be set to the node corresponding to the content to be operated is “update”, Step 96: When the operation attribute of the node is not set, Step 97: Operation attribute of the node Is set as "Update".

If it is determined in step 96 that "update" has been set as the operation attribute, the process proceeds to step 98. The state in which the operation attribute is already set to "update" occurs when this node corresponds to the parent node of another node and "update" is set as the operation attribute in the procedure of step 99 described later. .

Step 95: When the operation attribute to be set to the node corresponding to the content to be operated is “add” or “delete”, step 97: regardless of whether the operation attribute of the node is set or not set Then, the specified operation type is substituted for the operation attribute of the node.

Step 98: If the operation attribute of the parent node has not been set, Step 99: "Update" is set as the operation attribute of the parent node.

Thus, the content to be operated is registered in the difference tree.

FIG. 27 shows the procedure for creating an operation binary tree for a subtree in step 89. This procedure is shown in FIG.
This will be described in comparison with No. 9.

Step 101: Create an operation binary tree composed of the root node Fr and the right child node F1 and left child node F2 of the root. Step 102: Add correspondence information from the root Dr of the difference tree to Fr. This correspondence information indicates that the route Dr corresponds to the route Fr. In FIG. 19, an arrow extending from Dr to Fr indicates that Dr has the correspondence information to Fr. I have.

Step 103: Dr is added to the operation list of Fr.
Register change operation information that updates the to new content.

Step 104: One step of a depth order (Depth First) search of the pre-order (Pre Order) is performed on the difference tree to select one node (for example, D1), and this is set as D. The algorithm of the depth-first search of the preorder is shown in FIG.

Step 105: If there is something to select, Step 107: If the node is not the root Dr, Step 108: Parent node (Dr) of the node (D1)
Step 109: If there is no child node of the node F in the operation binary tree, a right child node and a left child node are added.

The following procedure differs depending on whether the operation attribute of the node D is added, updated, or deleted.

Step 110: When the operation attribute of D is additional, for example, when D is D3, Step 111: From D (D3) to the left child node (F1) of F
Step 112: Register change operation information instructing addition of the content of D (D3) to the operation list of the left child node (F1) of F.

Step 113: When the operation attribute of D is updated, for example, D
Is D2, Step 114: From D (D2) to the left child node of F (F1)
Step 115: Register change operation information instructing addition of new content (new D2) of D in the operation list of the left child node (F1) of F, and Step 116: : Generate a new content id (= i), Step 117: Replace the content id of the new content (new D2) of D with i, Step 118: Add D (Dr) to the content (Dr) of the parent node of D The content id of the reference to D2) is replaced with i. Step 119: Change operation information for instructing deletion of the old content of D (old D2) is registered in the operation list of the right child node (F2) of F.

Step 120: When the operation attribute of D is deleted, for example,
Is D1, Step 121: Right child node (F from D (D1) to F
Step 122: Register the change operation information instructing deletion of the content of D (D1) in the operation list of the right child node (F2) of F.

Step 112, step 119 or step
After 122 or when the operation attribute of D is not any of addition, update, or deletion (N in step 120)
o), returning to step 104, executing one step of depth-first search on the difference tree and selecting one node (step 104)
104), and repeat the procedure from step 108. If all nodes have been selected (Y in step 105)
es), the process ends (step 106).

Thus, as shown in FIG. 19, an operation binary tree is created from the difference tree.

FIG. 28 shows a procedure for generating a modified operation information sequence based on the created operation binary tree and sending it to the multiplexing means.

Step 131: For the operation binary tree, FIG.
The search is executed in one step on the basis of the above algorithm to select a node.

Step 132: If there is a node to be selected, Step 133: One piece of content change operation information is selected from the operation list of the node.

Step 134: If there is change operation information to select, step 135: send the selected change operation information.

When the procedure from step 133 to step 135 is repeated and all the change operation information has been selected (step
In Yes at 134), the process returns to step 131, selects the next node, and repeats the procedure from step 133 to step 135. When all nodes have been selected (step 132)
(Yes in), the process ends.

FIG. 21 shows the transmission order when the change sequence generation means 12 reads the change operation information from the operation binary tree of FIG.

As described above, by using the algorithm shown in the second embodiment, it becomes possible to change the content tree of a plurality of layers with simultaneousness.

[0161]

As is apparent from the above description, when the content tree change operation information is recorded on the storage medium by the recording method of the present invention, the content tree is reproduced and displayed from the change operation information. The device can display a content tree that changes complexly at a particular point in time.

A plurality of contents constituting the displayed content tree are displayed as if they were added, updated, or deleted at the same time. Also, only the content displayed in this content tree can be selected,
When a content is selected, the content of the content can be displayed. Therefore, a plurality of contents constituting the content tree are effectively changed simultaneously.

According to the present invention, such a content tree can be displayed by efficiently using the storage medium and the storage capacity of the playback device.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a package media production device and a package media browsing device according to an embodiment of the present invention.

FIG. 2 is a specific example of an addition process in the change operation information recording method according to the first embodiment;

FIG. 3 is a specific example of an additional process when synchronization is not required in the change operation information recording method according to the first embodiment;

FIG. 4 is a flowchart showing a procedure of an additional process in the change operation information recording method according to the first embodiment;

FIG. 5 is a specific example of a reservation list for additional processing in the change operation information recording method according to the first embodiment;

FIG. 6 is a specific example of an update process in the change operation information recording method according to the first embodiment;

FIG. 7 is a specific example of an update process when synchronization is not required in the change operation information recording method according to the first embodiment;

FIG. 8 is a flowchart showing a procedure of an update process in the change operation information recording method according to the first embodiment;

FIG. 9 is a specific example of a reservation list for update processing in the change operation information recording method according to the first embodiment;

FIG. 10 is a specific example of a deletion process in the change operation information recording method according to the first embodiment;

FIG. 11 is a specific example of a deletion process when synchronization is not required in the change operation information recording method according to the first embodiment;

FIG. 12 is a flowchart showing a procedure of a deletion process in the change operation information recording method according to the first embodiment;

FIG. 13 is a specific example of a reservation list for deletion processing in the change operation information recording method according to the first embodiment;

FIG. 14 is a flowchart showing a procedure when addition, update, and deletion processes are mixed in the change operation information recording method according to the first embodiment;

FIG. 15 is a specific example in a case where addition, update, and deletion processes are mixed in the change operation information recording method according to the first embodiment;

FIG. 16 is a specific example of a reservation list when addition, update, and deletion processes are mixed in the change operation information recording method according to the first embodiment;

FIG. 17 is a diagram showing a content tree to which the change operation information recording method according to the second embodiment is applied;

FIG. 18 is a diagram illustrating a difference tree extracted by the change operation information recording method according to the second embodiment;

FIG. 19 is a specific example of an operation binary tree created from a difference tree in the change operation information recording method according to the second embodiment;

FIG. 20 is an operation binary tree search algorithm in the change operation information recording method according to the second embodiment;

FIG. 21 is a specific example of generating a sequence of change operation information from an operation binary tree in the change operation information recording method according to the second embodiment;

FIG. 22 is a specific example of creating an operation binary tree from a single-level difference tree indicating addition in the change operation information recording method according to the second embodiment;

FIG. 23 is a specific example of creating an operation binary tree from a single-level difference tree indicating an update in the change operation information recording method according to the second embodiment;

FIG. 24 is a specific example of creating an operation binary tree from a single-level difference tree indicating deletion in the change operation information recording method according to the second embodiment;

FIG. 25 is a flowchart showing a procedure in a change operation information recording method according to the second embodiment of the present invention;

FIG. 26 is a flowchart showing a registration procedure to a difference tree in the change operation information recording method according to the second embodiment;

FIG. 27 is a flowchart showing a procedure for creating an operation binary tree from a difference tree in the change operation information recording method according to the second embodiment;

FIG. 28 is a flowchart showing a processing procedure for transmitting change operation information from an operation binary tree in the change operation information recording method according to the second embodiment;

FIG. 29 is a diagram showing a recording state of video / audio data and content tree change operation information on a storage medium,

FIG. 30 is a specific example of an additional process in a conventional change operation information recording method,

FIG. 31 shows a specific example of an update process in a conventional change operation information recording method,

FIG. 32 shows a specific example of a deletion process in a conventional change operation information recording method,

FIG. 33 is a diagram illustrating a display screen of multimedia information,

FIG. 34 is a diagram illustrating a scenario of multimedia information.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Package media production device 2 Package media browsing device 11 Content production means 12 Change sequence generation means 13 Video / audio storage means 14 Video / audio encoder 15 Multiplexing means 16 Package media writing means 17 Package media 21 Package media reading means 22 Separation means 23 Video / audio decoder 24 Sequential updating means 25 Presentation information caching means 26 Synthesis means 27 Presentation dialog means 28 Presentation means 29 Operation input means 64 Video / audio data 65 Change operation information

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI Theme coat ゛ (Reference) H04N 5/93 C F term (Reference) 5B075 ND16 ND36 PQ02 PQ13 5C053 FA24 FA29 GB01 GB06 GB11 GB40 HA29 HA31 HA40 JA30 KA05 5D110 AA13 AA17 AA27 AA29 BB20 CA04 CA12 CA16 CA32 CA36 CB06 CD15 CF11 CJ18 DA01 DA11 DA12 DB03 DB05 DC05 DC15 DD13 DE04

Claims (13)

[Claims] 1. A recording method for recording, on a storage medium, change operation information for changing a tree structure of a content, wherein when a child content is newly added to a parent content, the change operation information for adding the child content is provided. Is recorded first, and then change operation information for updating the parent content to a parent content having a link to the child content to be added is recorded. 2. A recording method for recording, on a storage medium, change operation information for changing a tree structure of a content, wherein when a child content linked to a parent content is updated with a new child content, the new content is updated. First, the change operation information for adding the new child content is recorded, and then the change operation information for updating the parent content to the parent content having a link to the new child content to be updated is recorded. A change operation information recording method, characterized by recording change operation information for deleting a file. 3. A recording method for recording, on a storage medium, change operation information for changing a tree structure of a content, wherein when deleting a child content linked to a parent content, the child content to be deleted is deleted. A change operation information recording method, comprising: recording change operation information for updating a parent content in which a link to a content is deleted; and then recording change operation information for deleting the child content. 4. A recording method for recording change operation information for changing a tree structure of a content on a storage medium, comprising: generating a difference tree including only the content to be changed from the tree structure of the content; Generating an operation binary tree representing an operation sequence from the tree, performing a depth-first search of the operation nodes of the operation binary tree in order, and sequentially recording change operation information defined in the search operation nodes in the storage medium. A change operation information recording method, characterized in that: 5. When the operation type of the content of the difference tree is addition, change operation information for adding the content to a child operation node on the left side of the operation node of the operation binary tree corresponding to the parent content of the content Stipulates,
Making the content correspond to the child operation node on the left side,
5. The method according to claim 4, wherein the search is performed with priority given to the left. 6. When the operation type of the content of the difference tree is update, a new content of the content is added to a child operation node on the left side of the operation node of the operation binary tree corresponding to the parent content of the content. The change operation information is defined, the change operation information for deleting the old content of the content is defined in the child operation node on the right side of the operation node, the content is associated with the child operation node on the left side, and the search is performed on the left. 5. The method according to claim 4, wherein the change operation information is recorded on a priority basis. 7. When the operation type of the content of the difference tree is delete, change operation information for deleting the content is provided in a child operation node on the right side of the operation node of the operation binary tree corresponding to the parent content of the content. Stipulates,
Making the content correspond to the child operation node on the right side,
5. The method according to claim 4, wherein the search is performed with priority given to the left. 8. A storage medium in which change operation information for changing a tree structure of content is recorded, and in order to newly add child content to parent content,
Change operation information to add child content is recorded first,
A storage medium characterized by recording change operation information for updating the parent content to a parent content having a link to a child content to be added. 9. A storage medium in which change operation information for changing a tree structure of a content is recorded, and a new child to be updated in order to update a child content linked to the parent content with the new child content. Change operation information for adding content is recorded first, and then change operation information for updating the parent content to a parent content having a link to a new child content to be updated is recorded, and then deleting the old child content A storage medium characterized by recording change operation information to be changed. 10. A storage medium in which change operation information for changing a tree structure of a content is recorded. In order to delete a child content linked to a parent content, the parent content is changed to a child content to be deleted. A storage medium characterized by recording change operation information for updating a parent content with a deleted link, and then recording change operation information for deleting said child content. 11. A production apparatus for producing a storage medium in which video / audio data and modification operation information for modifying a tree structure of content are recorded, wherein a content production means for producing content, and a content modification operation Change sequence generation means for setting the recording order of information; an encoder for encoding video and audio data; and multiplexing for multiplexing the change operation information sent from the change sequence generation means and the encoded video and audio data. Means, and writing means for writing the output of said multiplexing means to a storage medium, wherein said change sequence generating means sets the recording order of change operation information by the method according to any one of claims 1 to 7. A production device characterized by that: 12. The multiplexing means should be such that the combined bit rate of the change operation information and the video / audio data is equal to or lower than a certain level, and that the last change operation information reflects all changes instantaneously. The production apparatus according to claim 11, wherein the change operation information is multiplexed so as to be recorded at a timing. 13. A reproducing apparatus for reproducing a storage medium in which video and audio data and change operation information for changing a tree structure of content are recorded, wherein a reading means for reading data recorded in the storage medium. Separating means for separating video / audio data and the change operation information from the read data; storage means for reproducing and storing a tree structure of the content in accordance with the change operation information read in order; Presentation interactive means for extracting a tree shape of the tree structure stored in the means, and presentation means for combining and displaying the video and audio and the extracted tree shape, and wherein the presentation interactive means comprises: A reproducing apparatus, wherein when a content is selected, the corresponding content is read from the storage means and displayed on a presentation means.