JP2010097678A - Content information tree generating device, and program thereof - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To quickly generate a content information tree even if there are a large number of contents. <P>SOLUTION: A content information tree generating device includes: a deciding means for deciding whether the number of contents stored in a content storage part is larger than the number of the prescribed limit contents or not; and a priority content information tree generating means in which when it is decided that the number of contents is larger than the number of the limit contents, content of the number of the limit contents or less is selected according to the prescribed conditions out of contents stored in the content storage part, and the priority content information tree in which content information of only selected content is stored is generated. Accordingly, even when there are a large number of contents, since the priority content information tree of the number of the limit content or less is generated, a time until finishing generation of the priority content information tree is shortened. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a content information tree generation device that generates a content information tree in which content information of content recorded in a content storage unit is stored, and a program thereof.

  2. Description of the Related Art In recent years, a reproduction apparatus that includes an HDD (Hard Disk Drive) and reproduces a music file selected from a plurality of contents (for example, music files) recorded on the HDD has become widespread. In such a playback apparatus, a content information tree in which content information (artist name, album name, track name, etc.) of content recorded on the HDD is managed in a hierarchical structure when shifting from the standby state to the power-on state. To construct. The content information is recorded in a content information database (hereinafter referred to as content information DB) stored in the HDD. When the content list is displayed on the display unit, the content information is searched from the content information DB each time. Since it takes a lot of time, the content information search time can be shortened by searching the content information from the content information tree. For example, when searching for content in the artist mode, an artist tree in which a hierarchical structure is formed in the order of artist, album, and track is generated from the upper hierarchy.

  However, if the number of contents recorded on the HDD becomes enormous, it takes a long time to complete the generation of the content information tree when shifting from the standby state to the power-on state. The problem of not being able to listen.

JP 2004-4245

  The present invention has been made to solve the above-described conventional problems, and an object of the present invention is to provide a content information tree generation apparatus capable of quickly generating a content information tree even when the number of contents is large. It is to be.

  A content information tree generation device according to a preferred embodiment of the present invention is a content information tree generation device that generates a content information tree in which content information of content recorded in a content storage unit is stored. A determination means for determining whether or not the number of recorded contents is greater than a predetermined limit number of contents, and if it is determined that the number of contents is greater than the limit number of contents, the content stored in the content storage unit Priority content information tree generation means for selecting a content equal to or less than the limit content number according to a predetermined condition and generating a priority content information tree in which content information of only the selected content is stored.

  When the number of contents is larger than the limit content number, contents equal to or less than the limit content number are selected, and a priority content information tree including only the content information of the selected content is generated. Therefore, even if the number of contents is large, a priority content information tree equal to or less than the limit content number is generated, and thus it is possible to shorten the time until generation of the priority content information tree.

  In a preferred embodiment, there is further provided residual content information management means for managing a residual content information database in which content information of content recorded in the content storage unit but not stored in the priority content information tree is stored. .

  In a preferred embodiment, the content information for determining whether or not the content information of the content to be displayed is stored in the priority content information tree when displaying the content information of the content recorded in the content storage unit When the content information of the content to be displayed is stored in the priority content information tree, the content information is acquired from the priority content information tree, and the content information of the content to be displayed is the priority content information. Content information acquisition means for acquiring the content information from the remaining content information database and display control means for displaying the content information acquired by the content information acquisition means on a display device when not stored in the tree .

  In this case, even if the content information is not stored in the priority content information tree, the content information can be displayed by acquiring the content information from the remaining content information database.

  In a preferred embodiment, when reproducing the content recorded in the content storage unit, location information determining means for determining whether or not location information of the content to be reproduced is stored in the priority content information tree; When the location information of the content to be reproduced is stored in the priority content information tree, the location information is acquired from the priority content information tree, and the location information of the content to be reproduced is stored in the priority content information tree If not, the location information acquisition unit that acquires the location information from the remaining content information database, and the content is read from the content storage unit to the playback unit based on the location information acquired by the location information acquisition unit And a reproduction control means for reproducing.

  In this case, even if the location information of the content is not stored in the priority content information tree, the location information can be identified and the content can be reproduced by acquiring the location information from the remaining content information database.

  In a preferred embodiment, there is further provided final content information tree generation means for generating a final content information tree by adding content information recorded in the remaining content information database to the priority content information tree.

  In this case, the final content information tree can be generated later based on the priority content information tree and the remaining content information database. Accordingly, it takes a long time to search for content information from the remaining content information database, but since all the content information can be searched from the final content information tree, the content information can be searched quickly.

  In a preferred embodiment, the content information includes a last reproduction date and time, and the priority content information tree generation unit selects content not more than the limit content number in order of the latest reproduction date and time.

  Content with a new last playback date (that is, close to the present) has a high possibility that content information is displayed or a content is highly likely to be reproduced by a user operation. Therefore, the possibility that the user is uncomfortable can be reduced by preferentially including the content with the latest last reproduction date / time in the priority content information tree.

  Even if the number of contents is large, a priority content information tree equal to or less than the limit content number is generated, so that it is possible to shorten the time until generation of the priority content information tree is completed.

  Hereinafter, preferred embodiments of the present invention will be specifically described with reference to the drawings. However, the present invention is not limited to these embodiments.

  FIG. 1 is a block diagram showing a configuration of a playback apparatus 1 to which a content information tree generation apparatus according to a preferred embodiment of the present invention is applied. The content is a general term for video data, music (music) data, still image data, and the like, but in this example is a music file (also called a track). The reproducing apparatus 1 reproduces a music file selected from a plurality of music files recorded in an HDD (Hard Disk Drive) 5 in the reproducing unit 6 and outputs sound from a speaker (not shown).

  The playback apparatus 1 includes a control unit 2, a RAM 3, a ROM 4, a content storage unit 5 such as an HDD, a playback unit 6, an operation unit 7, and a display unit 8. These are connected to each other via a bus.

  A plurality of contents (music file) are recorded in the HDD 5. The music file recorded in the HDD 5 is read by an instruction from the control unit 2 and reproduced by the reproduction unit 6.

  The HDD 5 stores a content information database (hereinafter referred to as a content information DB). The content information DB is a database that manages content information and location information regarding all content recorded in the HDD 5. FIG. 2 shows an example of the content information DB.

  As shown in FIG. 2, the content information DB registers content information (track name, artist name, album name, last reproduction date, etc.), artist ID, and album ID in association with the index. Although not shown, the content information DB also stores information such as the file path indicating the location of the content in the HDD 5 and the number of playbacks.

  The index is a serial number assigned to the track, and is assigned in the order of recording in the HDD 5. The artist ID is a serial number assigned to all artist names registered in the content information DB in alphabetical order and / or alphabetical order. Therefore, every time a new artist name is registered in the content information DB, all artist IDs are assigned again. The album ID is a serial number assigned to all album names registered in the content information DB in the order of 50 notes and / or alphabets. Therefore, every time a new album name is registered in the content information DB, all album IDs are assigned again. The last reproduction date / time is the date / time when the track was last reproduced.

  Returning to FIG. 1, the control unit 2 controls the entire playback device 1, and reads out and executes the content information tree generation program stored in the ROM 4 or the HDD 5 in the RAM 3 to execute each process described later. To do.

  The control unit 2 generates a content information tree based on the content information recorded in the content information DB. The content information tree is displayed when a content list (for example, an artist list that is a list of artist names, an album list that is a list of album names, or a track list that is a list of track names) is displayed on the display unit 8. It is used to easily search and obtain content information (artist name, album name, track name) to be obtained. Hereinafter, a case where the content information tree is an artist tree used in an artist mode for searching for a track from an artist name will be described.

  FIG. 3 is a conceptual diagram showing an artist tree. The artist tree forms a hierarchical structure in the order of artist ID, album ID, and track in order from the upper hierarchy. A box described in a tree is called a node. In the artist ID node, the artist name specified by the artist ID is stored. In the album ID node, an album name specified by the album ID is stored. The track node stores a track name of the track and a file path (address) which is location information in the HDD 5 of the track.

  When generating the artist tree, the control unit 2 determines whether or not the number of contents recorded in the content information DB (that is, the number of contents recorded in the HDD 5) exceeds a predetermined limit number of contents. . The limit content number is a number that is considered to cause discomfort to the user because it takes a long time to complete the generation of the artist tree when the content number exceeds the limit content number. Set by Note that the limit content number may be changed to an arbitrary number by a user operation.

  When the number of contents exceeds the limit number of contents, the control unit 2 displays the priority content information database (hereinafter referred to as priority DB) shown in FIG. 4 and the remaining content information database (hereinafter referred to as residual DB) shown in FIG. .) Is generated and stored in the HDD 5. The priority DB extracts contents equal to or less than the limit content number from the contents information of contents in the contents information DB according to a predetermined condition, and the contents information of the extracted contents is registered. Here, the predetermined condition is, for example, the order of the latest reproduction date / time (newest) or the order of the largest number of reproductions. In the remaining DB, content information of content other than the content registered in the priority DB among the content information of content in the content information DB is registered.

  When the control unit 2 generates an artist tree, for example, when shifting from the standby state to the power-on state, the control unit 2 first generates an artist tree (hereinafter referred to as a priority artist) from a priority DB that includes only content information of content equal to or less than the limit content number. A tree). Accordingly, when the number of contents in the content information DB exceeds the limit number of contents, it is possible to shorten the time until the generation of the priority artist tree is completed, compared to the case where the artist tree is generated for all contents in the content information DB. It is possible to prevent the user from feeling uncomfortable. Further, the control unit 2 adds the content information of the content included in the remaining DB to the priority artist tree when no load is applied (or nothing is operating) later, An artist tree (hereinafter referred to as the final artist tree).

  Returning to FIG. 1 again, the operation unit 7 receives an instruction from the user and transmits it to the control unit 2, and is an operation button, a remote control, or the like. The display unit 8 is an LCD (liquid crystal display), an FL tube, or the like, and displays a content list, content information of a music file being reproduced, and the like based on an instruction from the control unit 2. The playback unit 6 plays back the song file read from the HDD 5 (for example, decoding, D / A conversion, amplification processing, etc.).

The operation of the playback apparatus 1 having the above configuration will be described.
[Priority Artist Tree Generation Processing]
The priority artist tree generation process will be described with reference to FIG. For example, when the playback device 1 shifts from the standby state to the power-on state, the control unit 2 searches the content information DB and acquires the number of contents whose content information is registered in the content information DB (S1). The control unit 2 determines whether or not the acquired content number is larger than the limit content number limit (S2). When the number of contents is equal to or less than the limit content number limit (NO in S2), the control unit 2 directly generates a final artist tree for all contents in the content information DB without generating a priority artist tree (S6). This is because even if the final artist tree is generated for all contents in the content information DB, it does not take time to make the user feel uncomfortable.

  When the number of contents is larger than the limit content number limit (YES in S2), the control unit 2 prioritizes the last reproduction date and time from the newest track until the limit content number limit is reached among the tracks in the content information DB. The priority DB is generated by registering the content information in (S3). Accordingly, the content information of tracks corresponding to the limit content number is registered in the priority DB. It should be noted that the content information of tracks for (number of limit contents−predetermined number) may be registered in the priority DB instead of the number of limit contents.

  Next, the control unit 2 generates the remaining DB by registering in the remaining DB the content information of the remaining tracks that are not registered in the priority DB in S3 among all the contents in the content information DB (S4). Accordingly, the content information of tracks corresponding to (the number of contents in the content information DB−the number of contents in the priority DB) is registered in the remaining DB.

  Next, the control unit 2 generates a priority artist tree shown in FIG. 7 based on the track content information registered in the priority DB (S5). Since the priority DB includes only the content information of tracks corresponding to the limit content number, the priority artist tree does not include the content information of some tracks. In the example of FIG. 7, artist ID3, which is an artist ID surrounded by a broken line, is not included in the priority artist tree because the track to which artist ID3 is assigned is not included in the priority DB. Similarly, the album ID 5 that is the album ID surrounded by a broken line is not included in the priority artist tree because the track assigned the album ID 5 is not included in the priority DB. Also, the track P surrounded by the broken line is not included in the priority DB, and thus is not included in the priority artist tree.

  On the other hand, artist IDs 1, ID2, and ID4, which are artist IDs surrounded by a solid line, are included in the priority artist tree because the content information of the tracks to which these artist IDs are assigned is included in the priority DB. That is, each artist name is acquired from the priority DB and stored in these artist ID nodes. Similarly, the album ID 1 that is an album ID surrounded by a solid line is included in the priority artist tree because the content information of the track to which the album ID is assigned is included in the priority DB. That is, the album name is acquired from the priority DB and stored in the node of the album ID. Further, since the track content information is included in the priority DB for tracks A and Q, which are tracks surrounded by a solid line, the nodes of these tracks are included in the priority artist tree. That is, track names and file paths are acquired from the priority DB and stored in the nodes of these tracks.

  As described above, the control unit 2 generates the priority artist tree based on the priority DB including only the content information of the track having the limit content number or less, so the time until the generation of the priority artist tree is completed is compared with the prior art. And can be shortened. In addition, since the track with the newest playback date is preferentially included in the priority artist tree, even when a content list such as an artist list (album list and track list is also displayed) is displayed, the user Can display artist names, album names, and track names for tracks that are frequently heard recently. Note that the priority artist tree may be generated directly from the content information of some tracks in the content information DB without generating the priority DB.

[Artist list display processing]
The artist list display process using the priority artist tree will be described with reference to FIG. In this example, although the priority artist tree including only the artist names of some tracks is used, the artist names of all tracks can be displayed without omission by using the remaining DB together.

  When an instruction to display the artist list is input by the user operation, the control unit 2 determines the start number ST of the artist name to be displayed for the artist list sorted in alphabetical order according to the user operation. The end number EN is specified (S11). For example, when ten artist names from the first to the tenth are displayed, ST = 1 and EN = 10. When displaying the tenth artist names from the fifth to the 14th, ST = 5 and EN = 14.

  Next, the control unit 2 initializes an artist ID for which an artist name is to be acquired to a start number ST (S12). Here, since ST = 1, the artist ID is set to artist ID1. Next, the control unit 2 determines whether or not the current artist ID node is included in the priority artist tree (S13). For example, as shown in FIG. 7, the node of artist ID 1 is included in the priority artist tree (YES in S13). Accordingly, the control unit 2 acquires the artist name from the artist ID node of the priority artist tree and stores it in the RAM 3 (S14). Thereafter, the control unit 2 determines whether or not the artist ID is the end number EN (S16). If the artist ID has not yet reached the end number EN (NO in S16), the control unit 2 increases the artist ID by 1 (S18). , Return to S13. That is, the above process is repeated for the artist IDs from the start number ST to the end number EN, and the artist name is stored in the RAM 3.

  As shown in FIG. 7, the node of artist ID 3 is not included in the priority artist tree (NO in S13). In this case, the control unit 2 searches the remaining DB, not the priority artist tree, acquires the artist name of the artist ID 3 registered in the remaining DB, and stores it in the RAM 3. Although it takes more time than searching from the priority artist tree, the artist name can be acquired.

  When the artist ID reaches the end number EN (YES in S16), that is, when the artist names from the start number ST to the end number EN have been stored in the RAM 3, the controller 2 stores the artist name stored in the RAM 3. Is displayed on the display unit 8 (S17). As described above, by using the priority artist tree and the remaining DB together, it is possible to display the artist names of tracks that are not included in the priority artist tree.

[Album list display processing]
A process of displaying a list of albums, which is a list of album names of selected artists, by selecting a desired artist from the artist list displayed by the process of FIG. 8 by a user operation, will be described with reference to FIG. . Here, from the priority artist tree, the actual number of album IDs that each artist ID includes in the lower layer (that is, the number of album IDs that each artist ID in the final artist tree includes in the lower layer) cannot be determined. The album IDs included in each artist ID are not arranged in order, so when the album IDs are not continuous, the album ID is not actually included in the lower layer, or the album ID remains This is because it cannot be determined from the priority artist tree alone whether it is included in the DB. Therefore, in this example, the problem is solved by acquiring the number of album IDs corresponding to the artist ID from the remaining DB.

  As shown in FIG. 9, the control unit 2 determines whether or not an artist ID has been selected (that is, one artist name has been selected by a user operation from the artist list) (S21). When the artist ID is selected (YES in S21), the control unit 2 refers to the priority artist tree in FIG. 7 and acquires the album name from each node of the album ID included in the lower layer of the selected artist ID. And stored in the RAM 3 (S22). For example, referring to FIG. 7, when artist ID 1 is selected, the album name is acquired from the node of album ID 1 in the lower layer and stored in RAM 3. Actually, album ID 5 is also included in the lower layer of artist ID 1, but album ID 5 is not included in the priority artist tree, so obtaining the album name of album ID 5 from the priority artist tree is not possible. Can not.

  Therefore, the control unit 2 searches and acquires the number of album IDs corresponding to the selected artist ID from the remaining DB (S23). Then, the control unit 2 determines whether or not the number of acquired album IDs is greater than 0 (S24). If the number of acquired albums is 0 (NO in S24), the album IDs included in the selected artist ID are all included in the priority artist tree, so S25 is skipped and the process proceeds to S26. .

  On the other hand, if the number of acquired album IDs is greater than 0 (YES in S24), the control unit 2 acquires the album name corresponding to the selected artist ID by searching the remaining DB, and stores it in the RAM 3. Store. For example, in the priority artist tree of FIG. 7, artist ID1 should actually include a node with album ID5, so album ID5 is included in the remaining DB. In this case, YES is determined in S24, and the album name of the album ID 5 is acquired from the remaining DB and stored in the RAM 3.

  Through the above processing, the album names of all album IDs corresponding to the selected artist ID can be stored in the RAM 3. If necessary, the album names stored in the RAM 3 are rearranged in alphabetical order and / or alphabetical order. Thereafter, the control unit 2 reads out the number of album names stored in the RAM 3 by the number displayed on the display unit 8 and displays it on the display unit 8.

[Track list display processing]
FIG. 10 shows a process in which a desired album name is selected by the user operation from the album list displayed by the process of FIG. 9 and the track list of the selected album is displayed. The track list display process is the same as the album list display process of FIG. 9 except that “artist” is replaced with “album” and “album” is replaced with “track”. Use the explanation.

[Track playback processing]
A process in which a desired track is selected by a user operation from the track list displayed by the process of FIG. 10 and the selected track is identified and started to be played will be described with reference to FIG. The control unit 2 determines whether or not a track ID has been selected (that is, whether or not a desired track name has been selected by a user operation from the track list) (S41).

  When the track ID is selected (YES in S41), the control unit 2 determines whether or not the node of the selected track ID exists in the priority artist tree (S42). If the selected track ID node exists in the priority artist tree (YES in S42), the file path of the selected track ID is obtained from the selected track ID node of the priority artist tree, and the HDD 5 The file path is accessed, the track is read, and playback is started (S43). For example, when track A is selected in the priority artist tree of FIG. 7, the file path is read from the track A node of the priority artist tree, and playback of track A is started.

  On the other hand, when the node of the selected track ID does not exist in the priority artist tree (NO in S42), the file path of the selected track cannot be acquired from the priority artist tree. Therefore, the control unit 2 searches and acquires the file path corresponding to the selected track from the remaining DB, accesses the file path of the HDD 5 to read the track, and starts playback (S44). For example, when the track P is selected in the priority artist tree of FIG. 7, the file path corresponding to the track P is read from the remaining DB, and the reproduction of the track P is started.

[Final artist tree generation processing]
When the load factor of the control unit 2 is small because, for example, the track reproduction process is not executed, the control unit 2 adds the content information of the track recorded in the remaining DB to the priority artist tree. By doing so, a final artist tree is generated.

  As shown in FIG. 12, the control unit 2 determines whether or not the track content information still exists in the remaining DB (S51). If no track content information remains in the remaining DB (NO in S51), the final artist tree is completed, and the process is terminated.

  When the content information of the track exists in the remaining DB (YES in S51), the control unit 2 uses, for example, an artist as a track to be added to the priority artist tree among the track content information included in the remaining DB. One track having the smallest ID is selected (S52).

  Subsequently, the control unit 2 specifies a position where the node of the artist ID of the selected track is to be inserted in each artist node of the priority artist tree (S53). Then, the control unit 2 inserts the artist ID node of the selected track at the specified position (S54). After inserting the artist ID node, the artist name is acquired from the remaining DB and stored in the generated node. Here, when the node of the artist ID of the selected track already exists in the priority artist tree, it is not necessary to insert the node of the artist ID into the priority artist tree. For example, in the priority artist tree of FIG. 7, if the artist ID of the track selected from the remaining DB is artist ID1, a new node is not inserted, and if it is artist ID3, a new artist ID3 node is added to artist ID2. Insert at the next position of the node.

  Subsequently, the control unit 2 specifies the position where the node of the album ID of the selected track is to be inserted in each album node of the priority artist tree (S55). Then, the control unit 2 inserts the album ID node of the selected track at the specified position (S56). After inserting the album ID node, the album name is acquired from the remaining DB and stored in the generated node. If the album ID node of the selected track already exists in the priority artist tree, it is not necessary to insert the album ID node in the priority artist tree. For example, in the priority artist tree of FIG. 7, when the album ID of the track selected from the remaining DB is album ID1, a new node is not inserted. When the album ID is album ID5, a new node of album ID5 is added to album ID1. Insert at the next position of the node.

  Subsequently, the control unit 2 specifies a position where the node of the selected track is to be inserted in each track node of the priority artist tree (S57). Then, the control unit 2 inserts the node of the selected track at the specified position (S58). After the track node is inserted, the track name and file path are acquired from the remaining DB and stored in the generated node. For example, in the priority artist tree of FIG. 7, when the track selected from the remaining DB is the track P, the node of the track P is inserted at the position next to the node of the track A.

  After inserting each node into the priority artist tree, the control unit 2 deletes each content information of the selected track from the remaining DB (S59). Thereafter, the process returns to S51, and the final artist tree is generated by executing the above process for all tracks existing in the remaining DB.

  As described above, the final artist tree is finally generated by adding the track content information in the remaining DB to the priority artist tree. As a result, there is no need to search for content information from the remaining DB, and the time for searching for content information can be shortened.

  As mentioned above, although preferable embodiment of this invention was described, this invention is not limited to these embodiment. The present invention may be provided in the form of a computer program for operating the above-described content recording / playback apparatus or a recording medium on which the computer program is recorded.

  The present invention can be suitably applied to HDD recorders, PCs, and the like.

It is a block diagram which shows the structure of the reproducing | regenerating apparatus 1 by preferable embodiment of this invention. It is a figure which shows an example of the data structure of content information DB. It is a conceptual diagram which shows the last artist tree. It is a figure which shows an example of the data structure of priority DB. It is a figure which shows an example of the data structure of residual DB. It is a flowchart which shows a priority artist tree refinement | purification process. It is a conceptual diagram which shows a priority artist tree. It is a flowchart which shows an artist list display process. It is a flowchart which shows an album list display process. It is a flowchart which shows a track list display process. It is a flowchart which shows a track reproduction process. It is a flowchart which shows the last artist tree refinement | purification process.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Playback apparatus 2 Control part 3 RAM
4 ROM
5 HDD
6 Playback section 7 Operation section 8 Display section

Claims (7)

A content information tree generation device that generates a content information tree in which content information of content recorded in a content storage unit is stored,
Determining means for determining whether or not the number of contents recorded in the content storage unit is greater than a predetermined limit number of contents;
When it is determined that the number of contents is larger than the limit content number, content less than the limit content number is selected from the contents recorded in the content storage unit according to a predetermined condition, and only the selected content A content information tree generation device comprising: priority content information tree generation means for generating a priority content information tree in which information is stored.   The residual content information management means for managing a residual content information database in which content information of content that is recorded in the content storage unit but not stored in the priority content information tree is stored. Content information tree generator. Content information determination means for determining whether or not content information of content to be displayed is stored in the priority content information tree when displaying content information of content recorded in the content storage unit;
When content information of content to be displayed is stored in the priority content information tree, the content information is acquired from the priority content information tree, and content information of content to be displayed is stored in the priority content information tree. Content information acquisition means for acquiring the content information from the remaining content information database,
The content information tree generation apparatus according to claim 2, further comprising display control means for displaying content information acquired by the content information acquisition means on a display device. Location information determining means for determining whether or not location information of content to be reproduced is stored in the priority content information tree when reproducing the content recorded in the content storage unit;
When the location information of the content to be reproduced is stored in the priority content information tree, the location information is acquired from the priority content information tree, and the location information of the content to be reproduced is stored in the priority content information tree. If not, location information acquisition means for acquiring the location information from the remaining content information database,
4. The content information tree generation device according to claim 2, further comprising: a reproduction control unit that causes the reproduction unit to read and reproduce the content from the content storage unit based on the location information acquired by the location information acquisition unit. .   5. The final content information tree generation means for generating a final content information tree by adding content information recorded in the remaining content information database to the priority content information tree. Description content information tree generation device. The content information includes the last playback date and time,
The content information tree generation device according to claim 1, wherein the priority content information tree generation unit selects content not more than the limit content number in order of newest reproduction date and time.   A content information tree generation program for causing a computer to execute each means of the content information tree generation device according to claim 1.

Images