JP2001008163A - Storage device and playback device - Google Patents

Abstract

(57) [Summary] [PROBLEMS] To efficiently store a program provided with a scenario in a storage device such as a digital broadcast. SOLUTION: In a storage device which creates a new content by using a scenario by using a tag as a part of a digital broadcast program or the like as an object, a storage control means 30
5 is the one that interprets the scenario and is not related to the scenario,
What is already stored is not stored. When the range of the object to be newly accumulated overlaps with the existing object, the overlapping accumulation processing means 308 collectively accumulates the objects. When the objects are continuously reproduced according to the scenario,
Accumulate so that they are arranged continuously. When a selection is made, the prefetch accumulation processing means 312 first accumulates a head portion of an object as an option. As a result, the storage capacity can be minimized, and the content can be reproduced efficiently.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a storage device for storing a program provided together with a scenario in a digital broadcast or the like and a reproduction device for reproducing the program, and it is possible to perform efficient storage and reproduction based on the scenario. And a storage device and a playback device.

[0002]

2. Description of the Related Art In digital broadcasting, different from conventional TV programs, not only video and audio, but also various control information and program additional information are transmitted. An example is the EPG (Electronic Program Guide). By sending, as additional information of the program, a tag describing a part of the program and a scenario describing the relationship between the tags, the viewer can view the program as new content using these. For example, by storing a program in advance and also storing a scenario and a tag related to the program, it is possible to use the scenario and the tag later to view only the highlight scene of baseball, or to use a news program. In such a case, it becomes possible for the viewer to selectively watch in units such as economy and sports.

A storage device for realizing such a service is provided with a program automatic storage function and the like, written by Tatsuya Kurioka.
“Home system” Journal of the Institute of Image Information and Television Engineers Vol.52, N
o. 10, pp. 1404 to 1406 (1998) requires a storage device such as a home server introduced in. The home server has a primary storage device and a secondary storage device. The primary storage device has the advantage of being capable of random access and having a high data transfer rate, such as an HDD and a semiconductor memory, but cannot be freely carried, has a fixed capacity, and has a relatively low bit rate. This device has the disadvantage of being expensive. The secondary storage device is, for example, a DVD-RAM
And D-VHS, which are interchangeable, easy to carry, have the advantage of cheap media and large capacity storage, but have the disadvantages of not being able to random access or having a low data transfer speed. It is a device to have. The home server is configured such that these are combined to compensate for each other's disadvantages.

[0004]

In a storage device such as a home server, it is assumed that a program which a viewer wants to save is transferred from a primary storage device having a limited capacity to a secondary storage device. . However, at this time, since the content is stored in units of programs, when only the content described by the scenario is stored in the secondary storage device, for example,
In the case of a highlight scene of a baseball broadcast, even if only the highlight scene is desired to be saved, the entire baseball broadcast is accumulated, resulting in a lot of waste. Also, when trying to reproduce each highlight scene continuously, the physical positions on the storage device are separated as shown in FIG. 46.
There is a problem that it takes a long time to move the reproduction position, and the video is interrupted at the joint of the scene. This is particularly problematic in sequential access media such as tapes, because it takes longer to move the playback position than in random access media.

[0005] Further, in the case of selectively watching in a news program or the like, the positions where the respective corners such as economy and sports are stored are far apart, and which is selected is actually selected. I do not know until. For example, assume that news programs are accumulated as shown in FIG. 47, and after watching the top news, a next corner to be viewed can be selected from among politics, economy, society, and sports. If you want to see the sports section after watching the top news, you need to cue from the end of the top news to the beginning of the sports. Therefore, in a relatively low-speed device used as a secondary storage device, there is a problem in that it takes time to select and then search for a reproduction position, and the viewer is kept waiting during that time.

[0006] It is an object of the present invention to solve the above-mentioned problems and to provide a storage device and a reproduction device which can efficiently store and reproduce contents described by a scenario.

[0007]

In order to solve the above-mentioned problems, the present invention firstly uses a scenario among objects specified by tags indicating a part of a program based on a scenario representing a method of presenting content. It is characterized in that only contents constituting the described content are stored in the storage means. As a result, the capacity required for storage can be minimized. Further, since unnecessary contents are not stored in the contents, the positions of the objects are close to each other, so that the time for locating the objects can be reduced as compared with the case of storing all the programs.

[0008] Second, when an object to be newly stored already exists in the storage means, the object is not stored. As a result, the capacity required for storage can be minimized.

Third, when the range of the already stored object and the newly stored object in the program overlaps in the storage means, the already stored object and the newly stored object are stored. Are stored as one. As a result, the overlapped portion is not accumulated twice, so that the capacity required for accumulation can be minimized.

[0010] Fourth, when continuous reproduction is required, the objects are stored in such a manner that the objects are collectively arranged and continuously arranged on the storage means. As a result, the cueing time does not occur at the joint between the objects, and the scene can be reproduced without interruption.

Fifth, at the time of storing the content, if a part of the object constituting the content has not been acquired and is not on the primary storage means, the object is stored on the secondary storage means for storing the content. It is characterized in that an area for storing an unacquired object is reserved, and after acquisition, is written in that location.

Thus, when continuous reproduction is required, even if not all objects are present at the time of accumulation,
By writing to a reserved area when an unacquired object is acquired, the objects can be continuously arranged. In addition, since the storage area for storing the entire content is reserved at the time of the first storage, it is possible to eliminate the possibility that the storage cannot be performed due to a shortage of capacity in the middle.

Sixth, at the selection node where the viewer makes a selection, the leading part of each of the objects to be selected is first stored as a pre-reading area, and the data is stored at a standard speed or higher by the storage means during content reproduction. Read-ahead, storing the pre-read area in a buffer until the viewer makes a selection, and performing cueing to the main part of the object while reproducing the head of the selected object from the buffer. Things. This allows
The selected object can be reproduced immediately without making the viewer wait at the selected node.

[0014] Seventh, the length of accumulating the leading part of each of the objects as options is determined according to the moving time from the position where the leading part is recorded to the position where each object is recorded. The longer the time, the longer the time. As a result, while the prefetch area is equally provided to the objects as options, the area for prefetch can be reduced.

Eighthly, when the content is reproduced, a preview of the object specified by the tag as an option is created using the data of the leading part stored as the prefetch area. Thus, in order to create a preview, it is possible to eliminate the need to search for each object as an option and obtain the respective data.

[0016]

DESCRIPTION OF THE PREFERRED EMBODIMENTS (First Embodiment) FIG. 1 is a block diagram of a basic configuration of a storage device according to a first embodiment of the present invention. In FIG. 1, data input means 10
Reference numeral 1 denotes a unit for inputting various data such as a scenario, a tag, video, and audio. The primary input / output unit 103 is an interface for exchanging data and commands between the primary storage unit 104 and the storage control unit 105.
The secondary input / output unit 109 is an interface for exchanging data and commands between the secondary storage unit 110 and the storage control unit 105. Primary storage means 104
Mainly stores various data input from the data input unit 101. The secondary storage unit 110 mainly stores the content created by the scenario and the tag from the program stored in the primary storage unit 104. Scenario selection means 1
02 presents a list of scenarios stored in the primary storage unit 104 to the viewer, and the secondary storage unit 1
The designation of a scenario describing the content to be stored in 10 is accepted. Also, the options at the selected node are presented to the viewer, and the selection is accepted. The storage control unit 105 outputs necessary object and tag data from the primary storage unit 104 to the secondary storage unit 110 based on the scenario.
The tag-to-file conversion table processing unit 106 performs processing of a tag-to-file conversion table or a tag-to-time code conversion table that describes the relationship between the tags in the secondary storage unit 110 and the position where the object is recorded.
The continuous accumulation processing unit 107 performs a process of continuously arranging objects on the secondary accumulation unit 110 when the objects are continuously reproduced according to the scenario. Duplicate accumulation means 108
If a part of the object specified by the tag to be newly stored overlaps with an object already existing in the storage means, one object to be newly stored and one already existing object And collectively store them. As the temporary storage means, for example, an HDD or a semiconductor memory can be used. As the secondary storage means, for example, a DVD-RAM, D-VHS, or the like can be used.

Next, tags and scenarios will be described first. The tag specifies an object that is a part of the program as shown in FIG. The object here is, for example, a video of a corner of a program or a famous scene, or in a data broadcast,
This is one module or the like. The structure of the tag is, for example, as shown in FIG.
It is as follows. Tags are tags that uniquely identify the tag
ID, tag name, description of the tag, program ID that uniquely identifies the program to which the object pointed to by the tag belongs, offset time from the program start time specifying the position of the object in the program, duration from the offset time, and , The capacity of the object pointed to by the tag.

The scenario describes content by describing the relationship between tags in the form of a node and its children, that is, nodes or tags linked to the node. The structure of the scenario is, for example, as shown in FIG. Then, a tree as shown in FIG. 5 can be created based on a node described in the scenario, a tag linked to the node, and a link of another node. The scenario includes a scenario ID that uniquely identifies the scenario, a scenario name, a description of the scenario, a node ID that uniquely identifies the node, a playback mode that describes the presentation method during playback, and a link to each node. Node and tag IDs to
The presentation order at the time of reproduction is included for each ID. here,
The playback mode is three modes: continuous playback, selective playback, and normal playback, but other modes may be provided. Continuous playback is
Objects pointed to by multiple tags belonging to that node
Play continuously. In the selective reproduction, the viewer selects and reproduces one from objects and nodes indicated by a plurality of tags belonging to the node. In the normal reproduction, when only one tag belongs to the node, the object indicated by the tag is reproduced.

The contents are reproduced by following the tree while reproducing the objects indicated by the tags belonging to each node in accordance with the reproduction mode and presentation order of the nodes along the scenario tree as shown in FIG. it can.

FIG. 6 is a flowchart showing the basic operation of content storage. The basic operation of the storage device will be described with reference to FIG.

As a precondition, data such as a scenario, a tag, a video, an audio, and the like input from the data input unit 101 are first stored in the primary storage unit 104.

When storing the content described by the scenario, the viewer uses the scenario selection means 102 to request a list of the scenarios stored in the primary storage means 104 from the storage control means 105 (S601). .
The accumulation control unit 105 acquires a list of scenarios from the primary accumulation unit 104 (S602), and displays it on the scenario selection unit, for example, as shown in FIG. 8 (S603). The viewer selects the scenario selecting means 1 from the displayed scenario list.
The scenario to be stored in the secondary storage unit 110 is selected by using “02” (S604). The storage control unit 105 reads the selected scenario from the primary storage unit 104 (S605) and stores the selected scenario in the secondary storage unit 110. Further, tags and objects are stored in the secondary storage unit 110 based on the scenario (S606).

FIG. 7 is a flowchart showing an operation for storing tags and objects based on a scenario. With reference to FIG. 7, a method of storing tags and objects based on a scenario will be described.

The accumulation control means 105 creates a tree of nodes from the scenario as shown in FIG. 5 (S701).
First, at the time of scenario playback, nodes are processed for each layer from layer 1 to layer 2, 3,...

First, the accumulation control means 105 determines whether there is a tag linked to the node (S702).
If there is a tag to be linked, it is determined whether the object specified by the tag exists in the primary storage unit 104 (S704). If it exists, the playback mode of the node is checked (S705). If it is continuous playback, it is included in the same tag in the secondary storage means 110 or included in the tag already existing in the secondary storage means 110 and newly stored. It is determined whether a tag exists (S706).

If the same tag or the included tag does not exist, the object specified by the tag linked to the node is combined into one as shown in FIG. The data is accumulated so as to be continuously arranged in the accumulation means 110 (S707).
As a result, for example, in the case of a magnetic tape such as D-VHS or the like, there is no need to find a head at a joint between objects at the time of reproduction, and reproduction can be performed smoothly. If the same tag or an included tag exists, whether or not the object specified by the tag is continuously accumulated for continuous reproduction, that is, whether or not the object cannot be rearranged, a tag-file conversion table described later. (S708).
If relocation is possible, the object is deleted from the secondary storage means 110 (S710). At this time,
In the tag-file conversion table processing means 106 described later, the tag pointing to the deleted object points to the newly stored object or a part of the object.

Then, the continuous accumulation processing means 107
The objects specified by the linked tags are collected into one and stored in the secondary storage unit 110 so as to be continuously arranged (S707).

If the reproduction mode is selected reproduction or normal reproduction or the like, and a tag linked to the node is tag 1, first, a list of tags already stored is acquired from the secondary storage unit 110, and the tag 1 It is determined whether or not there is the same item as (S712). If there is the same object, the tag 1 and the object indicated by the tag 1 are not accumulated (S714). If not, the program ID of the tag already stored and the program of tag 1
The IDs are compared (S713). If there is a program with the same program ID, the offset time and the duration are further compared (S715). If the range of objects overlaps, the overlapping tag is set to tag 2 by the overlap accumulation processing means 108. If the range of the object indicated by tag 2 includes the range of the object indicated by tag 1, the object indicated by tag 1 Indicates a part of the object pointed to by the tag 2 already stored without newly storing (see FIG. 10). When the tag 2 partially overlaps or when the range of the object indicated by the tag 1 includes the range of the object indicated by the tag 2, it is determined whether the tag 2 does not belong to the node for continuous reproduction and can be rearranged. Judge by looking at the flag. (S717). If relocation is not possible, tag 1 and the object pointed to by tag 1 are accumulated as usual. If relocation is possible, the object pointed to by the tag 2 already stored is deleted (S719).
Then, as shown in FIG. 11, the smaller one of the offset times of the tag 1 and the tag 2 and the larger one of the offset time and the duration are taken and stored (S720). Thereby, the storage capacity can be minimized.

Next, the tags are stored in the secondary storage means 110 (S709). Then, the tag-file conversion table processing unit 106 creates a tag-file conversion table that describes the correspondence between tags and files recording objects in a device having a file system, for example, a device such as a DVD-RAM or an MO. Yes (S71
1). The tag-file conversion table is, for example, as shown in FIG.
As described above, the correspondence between the tag ID, the file name in the device-specific file system, and the position in the file is performed. Devices without a file system, for example, D-VHS
In such a case, a tag-time code conversion table that describes the correspondence between tags and the time at which the object is recorded, for example, the time code representing the recording time from the beginning of the tape, is created. The tag-time code conversion table makes correspondence between the tag ID and the time code as shown in FIG. 13, for example. Here, in order to indicate the position where the object was recorded, a time code indicating the recording time from the beginning of the tape was used, but this is a type that can uniquely specify the start position and the end position of the object on the tape. Anything is fine. In addition, if objects that are continuously arranged for continuous playback are moved, the positions of the objects to be continuously played are separated,
A problem occurs when playing back content that is continuously played. In order to prevent this, a flag indicating whether or not the object specified by the tag can be rearranged is prepared. If the object cannot be rearranged by continuous reproduction, it is described as impossible, otherwise, it is described as possible.

If the playback mode of the node is continuous playback, the continuous accumulation processing means 107 accumulates the objects specified by the tags so that the objects are grouped together and arranged continuously (see FIG. 9). At this time, the tag-file conversion table is as shown in FIG. 14, and in this example, three tags correspond to one file. In the tag-file conversion table, for each tag, a file name of a file in which an object specified by the tag is recorded and a position in the file are written. As a result, even if the objects are collectively stored in one file, they can be accessed as one object. In the tag-file conversion table of FIG. 14, the objects specified by the three tags, tag 1, tag 2, and tag 3, are put together into one, and the files 1 are respectively 0000 to 0100, 0100 to 0200, and 0200 to 0300. It is described that the data is continuously accumulated at the position of. The tag-time code conversion table is as shown in FIG. 15, and each tag and a time code indicating a position where an object specified by the tag is recorded are written. In the tag-time code conversion table of FIG.
The objects identified by the two tags, Tag 1, Tag 2, and Tag 3, are 00: 00: 00: 00-00: 00: 29: 29, 00: 00: 30: 00- 00: 00: 5
9:29, 00: 01: 00: 00 to 00: 01: 29: 29 are described as being continuously accumulated. However, the format of the time code used here as an example is hour: minute:
Second: A frame number, and the frame number takes a value from 0 to 29. Also, if an object that performs continuous playback moves, it will not be able to perform continuous playback. Therefore, in both the tag-file conversion table and the tag-time code conversion table, the relocation flag is disabled.

If an object specified by a tag which does not belong to a node performing continuous reproduction overlaps with an object specified by a tag to be newly stored and is already present on the secondary storage means 110, the duplicate storage is performed. The processing unit 108 collectively stores the object to be newly stored and the existing object so as not to store the overlapped portion twice. At this time, there are a case where the existing object includes the object to be newly stored, a case where the object partially overlaps, and a case where the object to be newly stored includes the existing object. First, when an existing object includes an object to be newly stored, the portion indicated by the tag 1 has already been stored as a part of the object indicated by the tag 2 as shown in FIG. Therefore, no new object is stored, and only the tag-file conversion table for tag 1 is created. At this time, the tag-file conversion table is as shown in FIG. 16, and the object pointed to by tag 1 to be newly stored corresponds to the portion of 0100 to 0300 of file 1 in which the object pointed by tag 2 is recorded. What you are doing is described.

Next, in the case where the objects partially overlap or the object to be newly stored includes an existing object, the tag-file conversion table is referred to.
Check the relocation flag corresponding to the tag that identifies the existing object. If relocation is not possible, the object to be newly stored is stored as it is. If relocation is possible, the object pointed to by the tag 2 already stored is first deleted as shown in FIG. Then, the smaller of the offset time of the tag 1 and the tag 2 and the larger of the offset time + the duration are stored. At this time,
The tag-file conversion table is as shown in FIG.
File 1 that records the object pointed to by tag 2
Has been deleted, the tag 2 corresponds to 0100 to 0300 of the newly stored file 2. And tag 1 is 0000
A description corresponding to ~ 0400 is described.

At the time of reproduction, by interpreting the tag-file conversion table, the file in which the object indicated by the tag is recorded and the position in the file can be specified and reproduced from the tag ID. When using the tag-time code conversion table, the tag ID
From, the location where the object pointed to by the tag was recorded,
It can be specified and reproduced by the time code. If the medium used as the secondary storage means is portable, the medium stored in the storage device can be taken to another device and reproduced. For example, a reproduction-only device without a storage function is also conceivable.

Next, a specific operation example will be described. The news program used here as an example consists of an opening, politics and economy, society, sports, weather forecast, and ending. The program is tagged as shown in FIG. Using this program, the content described by the news digest scenario FIG. 19 is stored in the secondary storage unit 110. The news digest scenario enables a digest of each corner of a news program to be selectively viewed. As a prerequisite,
The news digest scenario and its related tags and news programs have already been broadcast and
It is assumed that it is stored in the next storage unit 104. Also,
It is assumed that the sports portion including the tag 5, the tag 6, and the tag 7 is stored in the secondary storage unit 110 in advance as the file 1 (see FIG. 22). FIG. 20 shows the correspondence between tags and tag names, FIG. 21 shows the correspondence between nodes and node names, and FIG. 23 shows a tag-file conversion table before content storage.
FIG. 2 shows a tag-file conversion table after storing contents.
It is shown in FIG.

Under this condition, the scenario selecting means 10 allows the viewer to store the content described by the news digest scenario in the secondary storing means 110.
It is assumed that an instruction is given from 2. Then, first, the accumulation control unit 105 reads out a news digest scenario from the primary accumulation unit 104. And interpret the scenario,
The scenario tree of FIG. 19 is created.

Next, processing is performed for each layer of the scenario tree. First, in layer 1, there is a node 1 which is a scenario start point. Here, since there is no tag linked to the node 1, the processing moves to the next layer 2.

Layer 2 has nodes 2, 3, 4, and 7. First, processing is performed from the node 2.

Tag 1 and tag 2 are linked to node 2. In this case, as a prerequisite, the news program is stored in the primary storage unit 104 in advance, so that the primary storage unit 104 has objects indicated by the tags 1 and 2. In the following description, a process of determining whether or not the primary storage unit 104 has an object specified by a tag is omitted. Next, the playback mode of the node 2 is
Because it is continuous playback, the same tag as tag 1, tag 2, tag 1,
It is checked whether the tag included in the tag 2 exists on the secondary storage unit 110. This time, the same tag and the included tag do not exist, so the objects pointed to by tag 1 and tag 2
“Politics / Economy 1” and “Politics / Economy 2” are combined into one file 2 according to the presentation order, and the secondary storage means 1
Store in 10. Then, tag 1 and tag 2 are stored.
Next, the tag-file conversion table processing unit 106 creates a tag-file conversion table. Here, the file name of the object specified by the tag and the position in the file, that is, tag 1 is 0000 to 0150 of file 2 and tag 2 is 0150 to 0250 of file 2. Further, since the reproduction is continuous, the rearrangement flag is disabled (see FIG. 24).

Next, the processing of the node 3 is performed. Tag 3 and tag 4 are linked to node 3. Since the playback mode of the node 3 is continuous playback, it is checked whether there is a tag included in the tags 3 and 4 that is the same as the tags 3 and 4. In this case, since the same tag and the included tag do not exist, the objects “society 1” and “society 2” indicated by the tags 3 and 4 are converted into one file according to the reproduction order.
It is stored in the next storage unit 110. And tag 3 and tag 4
To accumulate. Next, the tag-file conversion table shows that tag 3 is 0000 to 0100 of file 3 and tag 4 is
0100 to 0250. Further, since the reproduction is continuous, the rearrangement flag is disabled (see FIG. 24).

Next, in the processing of the node 4, the node 4 has no tag to be linked, so the processing shifts to the next node 7.

A tag 8 is linked to the node 7.
Since the playback mode of the node 7 is the normal playback mode, it is determined whether the same tag or a duplicate tag has already been stored in the secondary storage unit 110. Here, since the object is not stored, the object “weather in the Kanto region” indicated by the tag 8 is stored in the secondary storage unit 110 as one file. And
The tag 8 is stored. Next, the tag-file conversion table makes the tag 8 point to 0000 to 0100 of the file 4. Then, since it is not continuous playback, the relocation flag is enabled (see FIG. 24).

As described above, the processing of the layer 2 is completed.

Layer 3 has nodes 5 and 6. First, tag 5 and tag 6 are linked to node 5. First, since the playback mode of the node 5 is continuous playback, it is checked whether or not there is the same tag or an included tag.
Here, since the sports portion including the tag 5 and the tag 6 is stored as the file 1, the same tag exists.
Therefore, the relocation flags of the tags 5 and 6 in the tag-file conversion table shown in FIG. Since the relocation flags of the tags 5 and 6 are disabled, the objects “Sumo 1” and “Sumo 2” indicated by the tags 5 and 6 are stored in the secondary storage unit 110 as one new file according to the reproduction order. accumulate. And tag 5
And tag 6 are stored. Next, the tag-file conversion table processing means 106 updates the tag-file conversion table, and the tag 5 becomes 0000 to 0100 of the file 5 and the tag 6 becomes 0100 to 0200 of the file 5. Furthermore, because it is continuous playback,
The relocation flag is disabled (see FIG. 24).

Next, in the processing of the node 6, the tag linked to the node 6 is the tag 7. Since the playback mode of the node 6 is the normal playback mode, it is determined whether the same tag or a duplicate tag has already been stored in the secondary storage unit 110. As a precondition, since the sports including the tag 7 are already stored in the file 1 of the secondary storage unit 110, the same tag exists. Therefore, it does not accumulate.

As described above, the news digest scenario can be stored in the secondary storage unit 110. FIG. 22 shows the correspondence between the file and the tag in the secondary storage unit 110 after the completion of the storage. FIG. 24 shows an example of the tag-file conversion table. Here, like tag 5 and tag 6,
There may be more than one item with the same tag. In this case, at the time of reproduction, the object stored closest to the reproduction position is reproduced.

Thereafter, it is assumed that the viewer accumulates the content described by another scenario in the secondary accumulating means 110. This content includes the partial tag 9 of the weather forecast in FIG. Here, when storing the object specified by the tag 9, first, it is checked whether or not the same tag exists in the secondary storage unit 110. This time,
The same tag does not exist. Next, by checking the program ID described in the tag, it is confirmed whether there is a tag having the same program ID.
This corresponds to the tags 1 to 8 accumulated in the news digest scenario. From among these, it is determined from the offset time and the continuation time whether there is a tag overlapping with the tag 9. Then, it is found that the tag 8 overlaps the tag 9. Here, the tag 8 does not include the range indicated by the tag 9. Next, the tag 8 looks at the rearrangement flag of the tag-file conversion table to check whether or not the tag 8 is continuously arranged for continuous reproduction. Since the tag 8 can be rearranged, the accumulation control means 105 sets the duplicate accumulation processing means 10
8, the overlapping storage processing means 108 first deletes the file 4 in which the object specified by the tag 8 is recorded. Then, accumulation is performed by taking the smaller of the offset time of each tag and the larger of the offset time + continuation time, and is referred to as file 6 in this case. Then, the part corresponding to the tag 8 in the tag file conversion table is updated, and the part corresponding to the tag 9 is created. As a result, the tag 8 is changed from 0000 to 0100 of the file 4 to the file 6
Is updated to point to 0100-0200. Then, the correspondence between the file and the tag in the secondary storage unit 110 after storage is shown in FIG.
It is shown in FIG. FIG. 26 shows an example of the tag-file conversion table.

As described above, in the present embodiment, the provision of the storage control means makes it possible to store only necessary programs without storing all programs.
The storage capacity of the secondary storage means can be minimized. In addition, since unnecessary portions are not accumulated for composing the content, the time for locating the object can be reduced. The provision of the overlapping storage processing means makes it possible to minimize the storage capacity of the secondary storage means. Further, the provision of the continuous accumulation processing means eliminates the need for cueing at the seam between objects that need to be reproduced continuously, and allows reproduction without interruption.

(Second Embodiment) FIG. 27 is a block diagram of a basic configuration of a storage device according to a second embodiment of the present invention. This is because, in the storage device according to the first embodiment, an area necessary for storing the content represented by the scenario based on the capacity described in the tag and required for storing the object. Is added to the storage means in advance.

Next, a specific example will be described. The scenario given as an example is a scenario in which successive scenes of a program broadcast five times in succession are viewed. Here, as a precondition, it is assumed that this program is automatically stored in the primary storage means 204 every time, and that the program can be freely accessed after the end of the broadcast. Further, it is assumed that the scenario and all the tags related to the scenario are broadcast for the first time and stored in the primary storage unit 204. FIG. 29 shows the correspondence between tags and tag names.

After the third broadcast is completed, it is assumed that the viewer instructs the scenario selection unit 202 to store the content described by this scenario in the secondary storage unit 210. Then, the storage control unit 205 reads the scenario from the primary storage unit 204 and creates a node tree. The node tree at this time is as shown in FIG. In this scenario, tags 1 to 5 are linked to node 1. Here, the accumulation control unit 205 determines that the object specified by the tags 1 to 5 is the primary accumulation unit 2
Check if it exists in 04. At this point, FIG.
Obj1, which is the object up to the third time as shown in FIG.
Only obj2 and obj3 are accumulated. By the way, since the reproduction mode of the node 1 is continuous reproduction, accumulation is performed so that objects are arranged continuously. At this time, the storage area reservation unit 211 looks at the storage capacities described in the tags 4 and 5 corresponding to the unbroadcast objects, that is, the objects obj4 and obj5 that do not exist in the primary storage unit 204.
An empty object obj with the same capacity as obj 4 and obj 5
4e and obj5e are generated (see FIG. 30). Then, the continuous storage processing unit 207 stores the objects obj1 to obj3 and the objects obj4e and obj5e in the secondary storage unit 210 so as to be arranged continuously. Note that obj
Regarding 4e and obj5e, if the area to be accumulated can be reserved, the accumulation processing need not be actually performed. Subsequently, tags 1 to 5 are stored. Then, the tag-file conversion table is created by the tag-file conversion table processing means. The objects specified by the tags 4 and 5 are stored in the tag-file conversion table in order to indicate that they have not been stored. A flag indicating whether the object corresponding to the tag has been stored is prepared. If the object has been stored, it is described as completed, and if not, the object is described as not. here,
The entry specified by the tag 4 and the tag 5 is marked with a mark indicating non-accumulation (see FIG. 31).

Next, the viewer instructed to store this content again after the end of the fifth broadcast. Then, first, the accumulation control unit 205 acquires a list of scenarios from the secondary accumulation unit 210. Since the scenario of the content to be accumulated is present in the list of scenarios, the tag-file conversion table is obtained next and interpreted by the tag-file conversion table processing means 206. Here, the objects marked with “non-accumulated”, that is, the objects obj 4 and obj 5 are stored in the primary accumulating unit 204.
Check if the object exists, and if so, reserve the object as obj4e and obj5e in advance.
It is stored in the area on the next storage means 210 (see FIG. 30),
The tag-file conversion table processing means 206 sets the stored flag in the tag-file conversion table of the tag specified by the stored object to be stored.

As described above, in the present embodiment, the provision of the storage area reserving means makes it possible to store the contents described by the scenario when the objects constituting the contents have not been broadcast yet. If not acquired, an empty object with the same size as the capacity is created based on the capacity required to store the object described in the tag, and an area for storage is reserved. Even when the object is acquired and stored, it is possible to prevent the content from being completed due to insufficient storage due to insufficient capacity. Also,
For example, assume that there are objects obj1 and obj2, and that continuous playback is performed in the order of 1 → 2. At the time of storing content for the first time, even if obj 2 has not been acquired,
By arranging an empty object of the same size as obj 2 consecutively with obj 1, by acquiring obj 2 and writing obj 2 to the empty object, the continuity of obj 1 and obj 2 Can be secured.

(Third Embodiment) FIG. 32 is a block diagram of a basic configuration of a storage and reproducing apparatus according to a third embodiment of the present invention. This is because in the storage device according to the second embodiment, in a selection node where a viewer makes a selection, a prefetch storage process in which a part of the head of an object specified by an option tag is first stored as a prefetch area. Means 312, a reproduction control means 313 for reading data to be reproduced from the storage means and outputting the data to the data output means 316 and the like, and reading data from the secondary storage means 310 through the reproduction control means 313 at a standard speed or higher. By using the prefetch reproduction processing means 314 that stores the prefetch area in the buffer until the viewer makes a selection and reproduces the selected object from the buffer and the data of the prefetch area, a preview of an object as an option is created, and a scenario selection is performed. Preview creation means 3 for outputting to means 302
15 and data output means 31 for outputting data to be reproduced
6 is added. In addition, a buffer area 317 is secured in a partial area of the primary storage unit 304 for use as a buffer. Although a partial area of the primary storage unit 304 is used here as a buffer, a semiconductor memory or the like may be separately used as a buffer.

Next, a first specific example will be described using a news selection viewing scenario shown in FIG.

In this scenario, the news program shown in FIG. 34 is divided by four tags. First, the top news is reproduced, and then each of the political, economic, social, and sports corners can be selected and reproduced. Things. As a premise, the news program of FIG. 34 is currently stored in the primary storage unit 304. FIG. 35 shows the correspondence between tags and tag names at this time. Also, the secondary storage unit 310
It is assumed that a magnetic tape medium such as D-VHS is used, and object data can be read at a standard speed or higher. Then, a prefetch area flag is prepared in the tag-file conversion table to indicate that the area is a prefetch area, and is set to 1 if the area is a prefetch area and to 0 otherwise.

Here, it is assumed that the content described by the news selection viewing scenario of FIG. First, the reproduction mode of the node 1 is continuous reproduction, and the reproduction order of the child tag 1 is 1 and the reproduction order of the node 2 is 2. Therefore, the object obj1 indicated by the tag 1 is stored in the secondary storage unit 310. To accumulate. Next, the processing shifts to the processing of the node 2 which is the reproduction order 2. Node 2
Is a selective reproduction mode, and the objects obj specified by the tag 2, tag 3, and tag 4 that are children
2. Store obj3, obj4. First, the prefetch accumulation processing means 312 accumulates a part of the head of each of obj2, obj3, and obj4 as a prefetch area as shown in FIG. Then, the main body of obj2, obj3, and obj4, that is, the remaining part except for the top part stored here as the prefetch area is stored. At this time, obj2, obj
3. The length of storing the first part is determined according to the time required to move the playback position to the position where the remaining part of each of obj4 is stored. Here, in the case of a magnetic tape, the time required to move from the position where the pre-read area is stored to the position where the remaining portions of obj2, obj3 and obj4 are stored is the time until obj2 <the time until obj3 <the time until obj4. Therefore, the length of the first part is set to satisfy obj2 <obj3 <obj4.
In this example, the length of the first part is 5 seconds for obj2, obj3
Is 10 seconds and obj4 is 15 seconds. This length depends on the cueing speed of the device used as the secondary storage means. In order to immediately reproduce the selected object, cueing is performed to at least the position where the first part is reproduced and the remaining part is stored. Needs to be possible. For example, the length may be longer if a relatively long time is required for cueing, such as a magnetic tape, or shorter if a random access is possible and the access speed is relatively fast, such as a magneto-optical disk. As shown in FIG. 37, if the lengths of the first part are all the same, in order to immediately reproduce the selected object, the maximum time required for moving the reproduction position is set as a reference. , It is necessary to determine the length of the leading part. The tag-time code conversion table after the end of the storage is, for example, as shown in FIG. Here, a magnetic tape is used as an example, but this may be a magneto-optical disk. When a tag-file conversion table is used for a magneto-optical disk or the like, it is created in the same manner. In addition, only the remaining part excluding the head part is stored as the body of the object, but this may be stored entirely from the head of the object. In this case, the capacity required for storage increases, but for example, in a playback device that does not have a buffer and cannot read ahead, it is possible to prevent a situation in which a video or the like is interrupted at a joint between a beginning portion and a remaining portion during playback. I can do it.

Next, in the above procedure, the secondary storage means 310
Next, a procedure for reproducing the content stored as shown in FIG. 36 will be described. FIG. 39 shows a flow at the time of reproduction. In FIG. 39, the upper part shows the flow as viewed from the viewer, and the lower part shows the flow of the internal processing. The horizontal axis is time.

When the viewer instructs the reproduction control means 313 from the scenario selection means 302 to reproduce the news selection / viewing scenario, the reproduction control means 313 reads the news selection / viewing scenario from the secondary storage means 310. Then, a scenario tree as shown in FIG. 33 is created. Then, the tag related to the scenario and the tag-time code conversion table are read from the secondary storage unit 310 and passed to the tag-file conversion table processing unit 306.

Next, the reproduction of the content starts. Since the playback mode of node 1, which is the start point of the scenario, is continuous playback, the playback order for tag 1 and node 2, which are children of node 1, is checked. Here, since the reproduction order of the tag 1 is first, the object obj1 indicated by the tag 1 is reproduced first. At this time, the prefetch reproduction processing means 314
The data of the object obj1 is read at a standard speed or higher than 0, and the buffer area 3 provided in the primary storage means 304
Write 17 At the same time, the prefetch reproduction processing means 31
Reference numeral 4 reads data from the buffer area 317 at a standard speed and outputs the reproduced data to the data output means 316 via the reproduction control means 313. Then, after writing the data of obj1 to the buffer area 317, subsequently, the data of the pre-read area where the pre-read area flag of the tag-time code conversion table is 1 is read, and the buffer is read at least until the reproduction of obj1 is completed. The writing into the area 317 is completed.

Next, the processing shifts to the processing of the node 2. Since the reproduction mode of the node 2 is the selective reproduction, the option of the tag 2, the tag 3, and the tag 4 is provided to the viewer by the scenario selecting means 30.
2 is displayed. At this time, in order to facilitate selection, a preview of an object as an option is also displayed. Therefore, the preview creating unit 315 uses the data of the pre-read area in the buffer area 317 to generate the object obj specified by the tag 2, tag 3, and tag 4.
A preview screen in which the first frames of 2, obj3, and obj4 are displayed as still images as shown in FIG. 40 is created and output to the scenario selecting means 302. Although the first frame is displayed as a still image this time, for example, a part of the head of each object may be simultaneously reproduced as a moving image. The viewer can select the scenario selection means 3 from the preview screen.
Use 02 to make a selection. In this example, tag 3 is selected. After the selection, the prefetch reproduction processing means 3
14 reproduces the look-ahead area of obj3 stored in the buffer area 317 in advance, performs cueing during that,
It is moved from the reproduction position in FIG. After the cueing is completed, the prefetch reproduction processing means 314 reads the remaining part of obj3 and writes it to the buffer area 317. When the data of the pre-read area of obj3 on the buffer area 317 ends, the data of the remaining part of obj3 stored in the buffer area 317 is continuously read and reproduced. This time,
When the reproduction of obj3 ends, the scenario ends.

Next, a second specific example will be described using the scenario of FIG. In such a complicated scenario, the prefetch area can be more efficiently arranged by performing the following two processes in addition to performing the process for each layer as described in the first embodiment. First, when there is a selected node, a part of the head of an object indicated by a tag which can be reached from that node without reproducing another object is stored as a prefetch area. After storing the pre-read area, the main body of the object is stored. Since the processed portion has already been processed, the process for each layer excludes this portion. And the second
In the case where a continuous playback node is linked to the selected node as shown in FIG. 42, only the head of the object to be played first among the objects pointed to by the tags belonging to the continuous playback node is stored as a prefetch area. in this case,
After accumulating the head of the object indicated by tag 1, the head of the object indicated by tag 2 is accumulated. Then, accumulation is performed in the order of the main body of the object indicated by the tag 1, the main body of the object indicated by the tag 2, and the main body of the object indicated by the tag 3.

In the scenario of FIG. 41, first, the playback mode of the node 1 is continuous playback,
Is 1 and the playback order of node 2 is 2.
First, the object indicated by the tag 1 is stored in the secondary storage unit 310. Next, the processing shifts to the processing of the node 2 in the reproduction order 2. Since the reproduction mode of the node 2 is the selective reproduction, the tag which can be reached from the node 2 without reproducing another object is examined as described above. Since the tags that can be reached from the node 2 are the tags 2 and 3, the pre-read areas of the tags 2 and 3 are first stored in the secondary storage unit 310, and then the main body of the object is stored. Next, the process proceeds to the node 3. Here, since the tag 2 has already been processed, nothing is performed. Similarly, nothing is done for node 4. Next, the processing of the node 5 is performed. Since the playback mode of the node 5 is the selective playback, a tag that can be reached from the node 5 is checked. Since the tags that can be reached from the node 5 are the tag 4, the tag 5, and the tag 6, the object pointed to by each tag is stored in the secondary storage unit 310.
First, the pre-read area is stored, and then the object body is stored. Similarly, the node 6 accumulates the objects indicated by the tags 7, 8, and 9 in the order of the prefetch area and the object body. Next, in the processing of the node 7, no processing is performed because the tag which is a child of the node 7 has already been processed. Node 8,
9 and 10 do nothing as well. As described above, the content described by the scenario in FIG. 41 can be stored.
The image after accumulation is as shown in FIG.

By the way, it is conceivable that the viewer may return to the higher-order selected node that has already made a selection and reproduce another option. At this time, the pre-read reproduction processing means 314
When the reproduction position is returned using the data of the prefetch area already in the buffer area 317, the apparent waiting time can be reduced by reproducing the data of the prefetch area of the return destination object. In order to realize this, the buffer area 317 needs to hold prefetch area data of an object that may be selected from the current node. In this case, it is only necessary to hold the data of the pre-read area of all the objects pointed to by the tags that can be reached without reproducing other objects in the traveling direction and the returning direction of the scenario.

Here, as an example, the buffer area 31 for reproducing the content described by the scenario of FIG.
7 will be described.

It is assumed that the viewer proceeds through the scenario diagram 41 in the order of node 1 → node 2 → node 3 → node 5 → node 7 and selects tag 5 at node 7. At the points of nodes 2 and 5, which are selected nodes, data is held as follows.

First, at the node 2 point, the buffer area 317 has tags 2 and 3 as shown at 4401 node 2 point.
Holds the prefetch area data of the object indicated by. At the point of node 5, the buffer area 317
Is like 4402 node 5 points. Tags that can be reached from this node without reproducing other objects are tags 4, 5, and 6 in the traveling direction and tags 2 and 3 in the returning direction.
The prefetch area data of the object indicated by 3, 4, 5, and 6 is held.

Next, it is assumed that the scenario returns after the object pointed to by the tag 5 has been reproduced, and has returned to the node 2 again. At this time, the buffer area 317 looks like 4403 node 2 point. In order to proceed from the node 2 to the tags 4, 5, and 6, the data must pass through the continuous reproduction node 3, and at this time, the object indicated by the tag 2 must be reproduced. At this time, it is possible to write the prefetch area of the object indicated by the tags 4, 5, and 6 into the buffer while the object indicated by the tag 2 is being reproduced.
Therefore, the tag 4 held in the buffer area 317,
The prefetch area data of the objects indicated by 5 and 6 has been deleted because it is no longer needed.

At the selection node 2, it is assumed that the viewer wants to proceed in the direction of the node 4. The node 4 performs continuous reproduction, and first reproduces the object indicated by the tag 3. At present, the playback position is at the end of the object pointed by the tag 5, so the playback position must be moved from there to the recording position of the object pointed to by the tag 3. At this time, the buffer area 317 holds prefetch area data of the object indicated by the tag 3. Therefore, by reproducing the prefetch area data in the buffer area when moving the reproduction position, the waiting time can be reduced by the length of the prefetch area of the tag 3. If the pre-reading area has a sufficient length for the time to move the reproduction position, the object indicated by the tag 3 can be reproduced immediately. Since the node 4 is a continuous reproduction node, the object pointed to by the tag 3 is reproduced, and then the selection node 6 proceeds. At this time, the buffer area 317 has 4404 nodes 6
It looks like a point. Tags that can be reached from this node without reproducing other objects are tags 7, 8, 9 in the traveling direction and tags 2, 3 in the returning direction. , 8, and 9 are held.

As described above, in this embodiment, the provision of the prefetch accumulation processing means and the prefetch reproduction processing means makes it possible to perform cueing while reproducing the data stored in the buffer. Yes, this immediately
The object selected by the viewer can be reproduced.
Furthermore, since the length of accumulation in accordance with the time for moving the playback position is increased, there is more accumulation for objects that require more time to move the playback position, and less accumulation for objects that require less time to move the playback position. By providing the capacity, the storage capacity can be reduced as compared with the case where the pre-read area is equally provided to the objects as options. Also,
With the provision of the preview creation means, the data of the first part of the object stored as an option in the pre-reading area is used as preview data. This eliminates the need for cueing.
Furthermore, by managing the range of the prefetch area data held in the buffer area based on the scenario, it is possible to reduce the waiting time when returning to the top option of the scenario, and efficiently use the buffer area. You can do it.

[0070]

As described above, in the present invention, first, based on a scenario representing a method of presenting content, only objects related to the scenario among objects specified by tags indicating a part of a program are stored. With the storage control means characterized in that the program can be stored, only the necessary programs can be stored without storing all the programs. Since there is no unnecessary part to perform, the effect of minimizing the time required for cueing between objects can be obtained.

Second, when an object to be newly stored, which is specified by a tag, already exists in the storage unit, the object is not stored, thereby minimizing the storage capacity of the storage unit. The effect to be obtained is obtained.

Third, when a part of the object specified by the tag to be newly stored overlaps with an object already existing in the storage means, the object to be newly stored already exists in the object. By providing the overlapping storage processing unit, which is characterized in that objects that are present are collectively stored as one, an effect of minimizing the storage capacity of the storage unit can be obtained.

Fourth, in the case of continuous reproduction according to a scenario, the continuous storage processing means for arranging the objects consecutively is provided, so that the objects to be reproduced continuously are connected to each other. This eliminates the need for cueing, and provides an effect of reproducing without interruption.

Fifth, a capacity required for storing the object specified by the tag is described in the tag, and the storage means stores the area required for storing the content represented by the scenario. By providing storage area reservation means, which is characterized in that reservation is made in advance,
Even if there is an unacquired object, by writing to the reserved area after acquisition, the effect of maintaining the continuity of the object can be obtained. In addition, since the storage area for storing the entire content is reserved at the time of the first storage, an effect of preventing the storage from being unable to be performed due to a shortage of capacity in the middle is obtained.

Sixth, in a scenario, in a selection node at which a viewer makes a selection, a prefetch accumulation processing means for first accumulating a part of the head of an object specified by an option tag as a prefetch area, The data is read from the storage means at a standard speed or higher, the prefetch area is stored in the buffer before the viewer makes a selection, and the prefetch reproduction processing means for reproducing the selected object from the buffer is provided. It is possible to perform cueing while reproducing the data. As a result, the selected object can be immediately reproduced.

Seventh, in the prefetch storage processing means, the length of a part of the head of the object stored as the prefetch area is from the position where the prefetch area is stored to the position where the main body of the object is stored. According to the time to move the position, the longer the moving time is, the longer the accumulation length is, so that the pre-reading area is given equally to the optional objects, but the pre-reading area is Can be reduced.

Eighth, a preview is created by providing a preview creating means for creating a preview of an object specified by a tag as an option using data of a part of the head accumulated as a pre-reading area. In order to do this, search for each object as an option,
It is possible to eliminate the need to acquire each data.

[Brief description of the drawings]

FIG. 1 is a block diagram of a basic configuration of a storage device according to a first embodiment of the present invention;

FIG. 2 is a diagram illustrating the concept of a tag.

FIG. 3 shows an example of a tag.

FIG. 4 is a diagram showing an example of a scenario.

FIG. 5 is a diagram showing an example of a scenario tree.

FIG. 6 is a flowchart showing a basic operation of content storage.

FIG. 7 is a flowchart showing a storage method based on a scenario.

FIG. 8 is a diagram showing a display example of a scenario list.

FIG. 9 is a diagram illustrating continuous accumulation.

FIG. 10 is a view for explaining overlapping storage when an existing object includes an object to be newly stored;

FIG. 11 is a view for explaining overlapping storage when an object to be newly stored includes an existing object;

FIG. 12 is a diagram showing an example of a tag-file conversion table.

FIG. 13 is a diagram showing an example of a tag-time code conversion table.

FIG. 14 is a diagram showing an example of a tag-file conversion table when continuous accumulation is performed.

FIG. 15 is a diagram showing an example of a tag-time code conversion table when continuous accumulation is performed.

FIG. 16 is a diagram illustrating an example of a tag-file conversion table when performing overlapping accumulation when an existing object includes an object to be newly accumulated;

FIG. 17 is a diagram showing an example of a tag-file conversion table when duplicate storage is performed when an object to be newly stored includes an existing object;

FIG. 18 is a diagram showing correspondence between news programs and tags.

FIG. 19 is a diagram showing a scenario tree of a news digest scenario.

FIG. 20 is a diagram showing correspondence between tags and their tag names;

FIG. 21 is a diagram showing correspondence between nodes and their node names;

FIG. 22 shows secondary storage means 11 before and after storing content described by a news digest scenario.
Diagram showing correspondence between files and tags at 0

FIG. 23 is a diagram showing an example of a tag-file conversion table before storing content described by a news digest scenario;

FIG. 24 is a diagram showing an example of a tag-file conversion table when a news digest scenario is stored.

FIG. 25 is a diagram showing a state of a secondary storage unit 110 before and after storing a tag 9 and an object corresponding to the tag 9;

FIG. 26 is a diagram showing an example of a tag-file conversion table after accumulating a tag 9 and an object corresponding to the tag 9;

FIG. 27 is a block diagram of a basic configuration of a storage device according to a second embodiment of the present invention;

FIG. 28 is a diagram showing a scenario tree of a scenario in which a user successively views a name scene of a program broadcasted five times in a row.

FIG. 29 shows correspondence between tags and their tag names.

FIG. 30 is a diagram showing a state of a secondary storage unit 210;

FIG. 31 is a diagram showing an example of a tag-file conversion table when content is stored at the end of the third time

FIG. 32 is a block diagram of a basic configuration of a storage and reproduction device according to a third embodiment of the present invention.

FIG. 33 is a diagram showing a scenario tree of a news selection viewing scenario.

FIG. 34 is a diagram showing correspondence between news programs and tags.

FIG. 35 is a diagram showing correspondence between tags and their tag names.

FIG. 36 is a diagram showing a state of the secondary storage unit 310 when the content described by the news selection viewing scenario is stored.

FIG. 37 is a diagram in a case where a pre-reading area is equally given to an object as an option

FIG. 38 is a view showing an example of a tag-file conversion table when content described by a news selection viewing scenario is accumulated;

FIG. 39 is a diagram showing a flow at the time of reproducing a news selection viewing scenario.

FIG. 40 shows an example of a preview screen.

FIG. 41 is a diagram showing a scenario tree of the scenario of the specific example 2;

FIG. 42 is a diagram showing a scenario tree when a continuous playback node links to a selected node;

FIG. 43 is a diagram showing a state of the secondary storage unit 310 when content described by the scenario of the specific example 2 is stored.

FIG. 44 is a diagram showing prefetch area data held in the buffer area 317 when the content described by the scenario of the specific example 2 is reproduced.

FIG. 45 is a diagram showing a reproduction position at the time of selection and a cue destination to a selected object;

FIG. 46 is a diagram showing a movement at the time of continuous reproduction in a conventional example.

FIG. 47 is a diagram showing a movement at the time of selective reproduction in a conventional example.

[Explanation of symbols]

101 data input means 102 scenario selection means 103 primary input / output means 104 primary storage means 105 storage control means 106 tag-file conversion table processing means 107 continuous storage processing means 108 overlap storage processing means 109 secondary input / output means 110 secondary Storage means 201 Data input means 202 Scenario selection means 203 Primary input / output means 204 Primary storage means 205 Storage control means 206 Tag-file conversion table processing means 207 Continuous storage processing means 208 Duplicate storage processing means 209 Secondary input / output means 210 Secondary storage means 211 Storage area reservation means 301 Data input means 302 Scenario selection means 303 Primary input / output means 304 Primary storage means 305 Storage control means 306 Tag-file conversion table processing means 307 Continuous storage processing means 308 Double storage processing means 309 Secondary input / output means 310 Secondary storage means 311 Storage area reservation means 312 Prefetch storage processing means 313 Reproduction control means 314 Prefetch reproduction processing means 315 Preview creation means 316 Data output means 317 Buffer area 4401 Read-ahead area data held by the buffer area 317 of the buffer area 4402 read-ahead area data held by the buffer area 317 at the node 5 point 4403 The buffer area 31 when returning to the node 2 point
7 pre-reading area data held by buffer 4404 pre-reading area data held by buffer area 317 at 6 nodes

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI theme coat ゛ (reference) H04N 7/081 G11B 27/02 A 27/10 A F term (reference) 5C053 FA20 FA21 FA23 FA27 GB06 HA30 JA21 LA06 5C063 AA01 AB03 AC01 AC05 CA23 CA36 5D077 AA22 BA18 BB05 CA02 CB01 DC21 DE08 EA34 5D110 AA13 AA27 AA29 BB23 BB24 BB28 CA05 CA06 CA10 CA13 CA16 CB04 CF13 CJ13

Claims (10)

[Claims] A storage means for storing data and a control for storing the data in the storage means, based on a scenario representing a method of presenting content, described by a scenario among objects specified by tags indicating a part of a program. A storage device characterized by comprising storage control means for storing only what constitutes the content to be stored in the storage means. 2. An apparatus according to claim 1, wherein said storage control means does not store the object specified by the tag to be newly stored if the object already exists in the storage means. 2. The storage device according to 1. 3. When a part of an object specified by a tag to be newly stored overlaps with an object already existing in the storage means, an object to be newly stored and an object already existing 2. The storage device according to claim 1, further comprising: an overlap storage unit that collectively stores the data. 4. The storage apparatus according to claim 1, further comprising a continuous storage processing means for continuously arranging objects when the objects are continuously reproduced according to a scenario. 5. An area necessary for storing content represented by a scenario is stored in advance in storage means based on a capacity described in the tag and required for storing an object specified by the tag. 2. The storage device according to claim 1, further comprising storage area reservation means for making a reservation. 6. The scenario according to claim 1, wherein the selection node for the viewer to select is provided with a prefetch accumulation processing means for first accumulating a part of the head of the object specified by the tag as an option as a prefetch area. The storage device according to claim 1, wherein: 7. A storage device for storing data, a buffer for temporarily storing data to be reproduced, and a pre-read reproduction processing means for storing a pre-read area in the buffer when the data to be reproduced has a pre-read area. Playback device. 8. The prefetch accumulation processing means according to claim 1, wherein a length of a part of a head of the object to be accumulated as the prefetch area is a reproduction position from a position where the part of the prefetch area is accumulated to a position where the main body of the object is accumulated. 7. The storage device according to claim 6, wherein the storage device is changed according to a moving time. 9. The prefetching storage means according to claim 8, wherein the length of a part of the head of the object to be changed is made longer as the moving time of the reproduction position is longer. The storage device as described. 10. The method according to claim 1, wherein said prefetch reproduction processing means includes preview creation means for creating a preview of an object specified by a tag as an option by using data of a part of the head stored as a prefetch area. The playback device according to claim 7, wherein