WO2001095112A1 - Dispositif de reception/stockage, dispositif d'emission, systeme de diffusion, procede de reception/stockage, procede d'emission, procede de diffusion, programme et support - Google Patents
Dispositif de reception/stockage, dispositif d'emission, systeme de diffusion, procede de reception/stockage, procede d'emission, procede de diffusion, programme et support Download PDFInfo
- Publication number
- WO2001095112A1 WO2001095112A1 PCT/JP2001/004692 JP0104692W WO0195112A1 WO 2001095112 A1 WO2001095112 A1 WO 2001095112A1 JP 0104692 W JP0104692 W JP 0104692W WO 0195112 A1 WO0195112 A1 WO 0195112A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- content
- user
- receiving
- entity
- storing
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04H—BROADCAST COMMUNICATION
- H04H20/00—Arrangements for broadcast or for distribution combined with broadcast
- H04H20/42—Arrangements for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/433—Content storage operation, e.g. storage operation in response to a pause request, caching operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04H—BROADCAST COMMUNICATION
- H04H20/00—Arrangements for broadcast or for distribution combined with broadcast
- H04H20/16—Arrangements for broadcast or for distribution of identical information repeatedly
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04H—BROADCAST COMMUNICATION
- H04H60/00—Arrangements for broadcast applications with a direct linking to broadcast information or broadcast space-time; Broadcast-related systems
- H04H60/27—Arrangements for recording or accumulating broadcast information or broadcast-related information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/41—Structure of client; Structure of client peripherals
- H04N21/414—Specialised client platforms, e.g. receiver in car or embedded in a mobile appliance
- H04N21/4147—PVR [Personal Video Recorder]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/431—Generation of visual interfaces for content selection or interaction; Content or additional data rendering
- H04N21/4312—Generation of visual interfaces for content selection or interaction; Content or additional data rendering involving specific graphical features, e.g. screen layout, special fonts or colors, blinking icons, highlights or animations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/431—Generation of visual interfaces for content selection or interaction; Content or additional data rendering
- H04N21/4312—Generation of visual interfaces for content selection or interaction; Content or additional data rendering involving specific graphical features, e.g. screen layout, special fonts or colors, blinking icons, highlights or animations
- H04N21/4314—Generation of visual interfaces for content selection or interaction; Content or additional data rendering involving specific graphical features, e.g. screen layout, special fonts or colors, blinking icons, highlights or animations for fitting data in a restricted space on the screen, e.g. EPG data in a rectangular grid
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/433—Content storage operation, e.g. storage operation in response to a pause request, caching operations
- H04N21/4332—Content storage operation, e.g. storage operation in response to a pause request, caching operations by placing content in organized collections, e.g. local EPG data repository
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/433—Content storage operation, e.g. storage operation in response to a pause request, caching operations
- H04N21/4335—Housekeeping operations, e.g. prioritizing content for deletion because of storage space restrictions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/435—Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/442—Monitoring of processes or resources, e.g. detecting the failure of a recording device, monitoring the downstream bandwidth, the number of times a movie has been viewed, the storage space available from the internal hard disk
- H04N21/44213—Monitoring of end-user related data
- H04N21/44222—Analytics of user selections, e.g. selection of programs or purchase activity
- H04N21/44224—Monitoring of user activity on external systems, e.g. Internet browsing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/45—Management operations performed by the client for facilitating the reception of or the interaction with the content or administrating data related to the end-user or to the client device itself, e.g. learning user preferences for recommending movies, resolving scheduling conflicts
- H04N21/4508—Management of client data or end-user data
- H04N21/4532—Management of client data or end-user data involving end-user characteristics, e.g. viewer profile, preferences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/45—Management operations performed by the client for facilitating the reception of or the interaction with the content or administrating data related to the end-user or to the client device itself, e.g. learning user preferences for recommending movies, resolving scheduling conflicts
- H04N21/454—Content or additional data filtering, e.g. blocking advertisements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
- H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
- H04N21/835—Generation of protective data, e.g. certificates
- H04N21/8352—Generation of protective data, e.g. certificates involving content or source identification data, e.g. Unique Material Identifier [UMID]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N5/00—Details of television systems
- H04N5/76—Television signal recording
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/16—Analogue secrecy systems; Analogue subscription systems
- H04N7/162—Authorising the user terminal, e.g. by paying; Registering the use of a subscription channel, e.g. billing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/16—Analogue secrecy systems; Analogue subscription systems
- H04N7/162—Authorising the user terminal, e.g. by paying; Registering the use of a subscription channel, e.g. billing
- H04N7/165—Centralised control of user terminal ; Registering at central
Definitions
- information updated over time such as an electronic newspaper transmitted by radio wave broadcasting or Internet communication
- a receiving device a user views the stored content as needed.
- a service that automatically accumulates and updates the data distributed by broadcasting in the receiving device and allows the user to view the data accumulated at a desired time is called a “server type broadcasting service”.
- PC personal computer
- contents such as news and weather forecast broadcast from a broadcasting station on the Internet are received and stored by a receiving device such as a personal computer.
- the receiving device can start a browser that provides a user interface for browsing the stored content and operate the stored content by user operation.
- channels virtual distribution channels called “channels” that are independent for each content type and content provider, such as political news, international news, and weather forecasts. Then, the user selects some channels to be subscribed in advance and registers them in the receiving device, so that only the content of the registered channels is accumulated, You will be able to watch.
- FIG. 49 shows a screen display of the receiving device of the related art.
- reference numeral 4900 denotes a GUI (Gra HIC UsErIntE rF a c e) for selecting a channel and browsing contents, and by selecting a desired channel portion, the user can move to that channel.
- 4910 indicates that the channel "Economic-Youth" is selected. .
- Reference numeral 4920 displays a list of stored contents included in the selected channel.
- the 4920 displays five contents: 4920a, 4920b, 4920c, 4920d, and 4920e.
- 2920d and 4920e are highlighted as read content.
- the content of the current focus is represented by a triangular arrow 4930.
- an arrow 4930 indicates that the content 4 920 c is receiving attention.
- the content of current interest is displayed in the 4940 part. That is, the content of the content of 4920c is displayed in 4940.
- FIG. 48 is a configuration diagram of a conventional broadcasting system.
- a configuration diagram of the broadcasting system according to the present invention will be described later, the same reference numerals are given to components common to the two configuration diagrams for simplification.
- Reference numeral 4800 denotes the entire prior art broadcasting system, which includes a transmitting device 4810, a propagation means 0120, and a receiving device 4830.
- the transmitting device 4810 is a device on the broadcast station side, and information including content is transmitted to the receiving device 4830 installed in each home or the like via transmission by broadcasting or communication of the propagation means 0120.
- a plurality of receiving devices 4830 can correspond to one sending device 4810, but for simplicity, only one receiving device 4830 is shown.
- the sending device 4810 is composed of content producing means 01 11, channel information adding means 4811, sending information storage means 01 14, sending scheduler 0115, and sending means 01 16.
- the content production means 0111 is an authoring tool for producing specific individual data of the content.
- Content production means 01 1 1 Output content
- Each content is provided with a content id as information for identifying the content.
- the channel information assigning means 4 8 11 1 assigns, to each content produced by the content producing means 0 1 1 1, information specifying which channel the content belongs to.
- the transmission information storage means is used for storing the content to which the channel information is added after production.
- the receiving device 483 0 includes receiving means 0 1 3 1, channel managing means 4 8 3 1, channel filter 4 8 3 2, channel storing and changing means 4 8 3 3, storing means 0 1 3 5 , Input means 0 1 3 7, channel browser 4 8 3 4, and output means 0 1 3 4.
- Receiving apparatus 4830 receives data from propagation means 0120 as digital information.
- the channel management means 4 8 3 1 stores the currently subscribed channel.
- the channel filter 480 selects only the content related to the currently subscribed channel stored in the channel management means 483, and stores it in the storage means 015.
- the GUI shown in FIG. 49 is displayed by the channel ⁇ / browser 4 8 3 4, and the content stored in the storage means 0 1 3 5 is selectively reproduced by an operation from the input means 0 1 3 7. Then, the contents stored in the receiving device 480 of the prior art broadcasting system will be described with reference to a schematic diagram.
- FIG. 50 is a schematic diagram of the contents of a file system in the related art.
- Reference numerals 510, 520, 530, 540 each schematically show the contents of the file system at a certain point in time.
- reference numerals 510a and 510b denote contents stored in the receiving device 480 of the related art, respectively.
- the numbers shown in the small rectangles representing each content indicate the content id.
- the schematic diagram 520 is a schematic diagram when the content 510 Ob power 520 b stored in the schematic diagram 510 is replaced. Content 5 0 2 0 b
- the bold line indicates for convenience that the row of pite, which is the content of the content, has changed with respect to the schematic diagram in the previous state (in this case, schematic diagram 10) for clarity of explanation. .
- each content has an auto-deletion time limit, which is the time limit for automatic deletion.
- the automatic deletion deadline of the content 520b which existed in the schematic diagram 520, is set to "June 2", and when the date passes "June 2", the content is deleted. 5 0 20 b is deleted and changes to a schematic diagram 5 0 3 0.
- FIG. 51 shows an example of a data structure according to the related art.
- the data structure consists of a storage heap that physically stores the substance of content, that is, a byte sequence, and a file management table that manages the storage location of the storage heap and the identification of the content to be stored.
- the data structure corresponding to the schematic diagram 510 of FIG. 50 is a file management table 511 and a storage heap 510.
- Each row of the file management table 5110 represents each content stored in the storage unit 0135 of the receiving device 4830.
- Each row is an item that specifies the storage location of the content in the storage heap, an item that indicates the size of the pile column of the content, and an item that specifies the expiration date for the content to be automatically deleted. It consists of a certain automatic deletion time limit and content, which is an item used to identify content.
- FIG. 52 shows an example of a transmitted content table which is a bit string of transmitted content and information for its management in the transmission means 0 120 in the conventional technology.
- the file management table 510 corresponding to the schematic diagram 530, the storage heap 516, and the power schematic diagram 540 correspond to the schematic diagram 530.
- the transmission content information is in the form of a table with one or more rows, and each row stores the content to be transmitted at that point in time and information about the content.
- information is stored in the same format as the item of the same name in the file management table.
- the byte string itself, which is the substance of the content, is stored and transmitted.
- the size item is “5203”, and thus the item “content byte sequence” stores 503 bytes of data.
- the accumulated content only changes depending on whether or not each channel is subscribed. Specifically, the contents in each channel were only delivered, and it was only possible to confirm on a screen representation whether or not the content had been read.
- the arrangement of the channels and the contents in the channels was fixed. Therefore, the names of the files (contents in this case) can be freely defined, such as the file system of S, such as UNIX or Windows. I could't make changes or moves, duplicate them for backup, create my own files, etc. For example, even if a copy is made for backup, it does not appear in the list of contents accumulated from the broadcast, but is stored in a completely independent list. In other words, it was not possible to mix and manage data other than content from broadcasting in the same list.
- the present invention is directed to a receiving and storing apparatus, a transmitting apparatus, a broadcasting system, a receiving and storing method, a transmitting method, a broadcasting method, and a program capable of appropriately storing and managing broadcast contents in consideration of the above conventional problems. , And to provide media Things.
- a first aspect of the present invention is a receiving and storing apparatus for receiving and storing at least a content and a content ID for identifying the content, which are transmitted from a transmitting apparatus side,
- a path name corresponding to the content and the content ID is stored, and the path name is transmitted from the transmitting device side or generated by the receiving and storing device side, and the receiving and storing device side A receiving and storing device that can be presented to another user and can be changed based on an instruction from the user.
- a second aspect of the present invention when the same content ID as the already stored content ID is newly received, the content ID is stored together with the already stored content ID.
- This is the first storage device of the present invention that updates content by using overwriting by the received content together with the newly received content ID.
- the accumulation is performed on a predetermined recording medium.
- the path name corresponds to a hierarchical directory of the recording medium, and the hierarchical directory of the stored content is changed by changing a path name based on an instruction of the user.
- the receiving and storing device Of the receiving and storing device.
- the fourth invention (corresponding to claim 4) is that, even when the path name is deleted based on the instruction of the user, the content and the content ID corresponding to the deleted path name are not deleted.
- 1 is a reception and storage device of the first invention.
- a fifth aspect of the present invention (corresponding to claim 5) stores deletion date information relating to a date for deleting the content
- a reception and storage device according to a first aspect of the present invention, wherein the stored content is deleted based on the stored deletion date information.
- a sixth aspect of the present invention (corresponding to claim 6) comprises copy generation means for generating a copy of the stored content based on an instruction of the user,
- a seventh aspect of the present invention is the receiving and storing apparatus according to the sixth aspect of the present invention, wherein the generated copy is deleted based on an instruction of the user.
- An eighth aspect of the present invention is a method according to any one of the first to fifth aspects, further comprising a path name assigning means for assigning the path name to each of the plurality of users in correspondence with the one content.
- a path name assigning means for assigning the path name to each of the plurality of users in correspondence with the one content.
- a ninth aspect of the present invention includes a path name presenting means for presenting or not presenting a path name corresponding to the content based on user preference information on the user preference.
- the receiving and storing apparatus according to any one of the first to fifth aspects of the present invention.
- a tenth aspect of the present invention is that, when the user preference information is changed, a path name corresponding to the already stored content is presented based on a result of the change.
- a receiving and storing device according to a ninth aspect of the present invention.
- An eleventh invention is a transmission device for transmitting at least a content and a content ID for identifying the content, wherein the transmission device transmits the transmitted content and the content ID.
- a path name corresponding to the content and the content ID is stored in the receiving storage device side for receiving and storing.
- the path name is sent from the transmitting device side or generated by the receiving and storing device side, and can be presented to a user of the receiving and storing device side and changed based on an instruction of the user.
- a possible transmitting device is sent from the transmitting device side or generated by the receiving and storing device side, and can be presented to a user of the receiving and storing device side and changed based on an instruction of the user.
- a content is newly transmitted together with the same content ID as the content ID already stored in the receiving and storing apparatus,
- the content stored together with the content ID already stored is the transmission device according to the eleventh aspect of the present invention, which is updated using overwriting by the newly transmitted content.
- a thirteenth invention (corresponding to claim 13) is a transmitting device for transmitting at least a content and a content ID for identifying the content, and a receiving device for receiving the transmitted content and the content ID.
- a transmitting device for transmitting at least a content and a content ID for identifying the content
- a receiving device for receiving the transmitted content and the content ID.
- a path name corresponding to the content and the content ID is stored on the receiving and storing device side.
- the path name is transmitted from the transmitting device side or generated by the receiving and storing device side, and can be presented to a user of the receiving and storing device side and can be changed based on an instruction of the user. It is a broadcasting system.
- a fourteenth aspect of the present invention (corresponding to claim 14) is to receive and accumulate at least a content and a content ID for identifying the content transmitted from a transmitting side,
- the path name is transmitted from the transmitting side or generated by the receiving and storing side, and can be presented to a user of the receiving and storing side and can be changed based on an instruction of the user. Is the way.
- a fifteenth invention (corresponding to claim 15) includes a step of transmitting at least content and a content ID for identifying the content,
- a path name corresponding to the content and the content ID is stored.
- the path name is transmitted from the transmitting side or generated by the receiving and storing side, and is a transmission method that can be presented to a user of the receiving and storing side and can be changed based on an instruction of the user. It is.
- a sixteenth aspect of the present invention (corresponding to claim 16) is to transmit at least content and a content ID for identifying the content, and receive and accumulate the transmitted content ID. Steps,
- the path name is sent from the transmitting side or generated by the receiving and accumulating side, and can be presented to a user on the receiving and accumulating side and based on an instruction of the user. This is a broadcasting method that can be changed.
- a seventeenth aspect of the present invention is that, in the reception and storage method of the fourteenth aspect of the present invention, at least the content and the content ID for identifying the content are received from the transmission side. And storing the content and a path name corresponding to the content ID.
- An eighteenth aspect of the present invention (corresponding to claim 18) is to cause a computer to execute at least a step of transmitting at least a content and a content ID for identifying the content in the transmission method of the fifteenth aspect of the present invention. It is a program for.
- the nineteenth invention is a broadcast method according to the sixteenth invention, wherein at least the content and a content ID for identifying the content are transmitted.
- a twentieth invention (corresponding to claim 20) is the receiving and storing method according to the fourteenth invention, wherein at least the content and the content ID for identifying the content are received from the transmission side. And storing the content and a path name corresponding to the content ID, a medium carrying a program for causing a computer to execute all or part of the content and a path name corresponding to the content ID, which can be processed by a computer.
- the twenty-first invention is a transmission method according to the fifteenth invention, wherein the transmitting step of transmitting at least the content and the content ID for identifying the content to the computer is performed.
- a twenty-second invention is a broadcasting method according to the sixteenth invention, wherein at least the content and a content ID for identifying the content are transmitted, and Receiving and storing the received content and the content ID; and A medium carrying a program for causing a computer to execute all or a part of a step of storing a corresponding path name, the medium being characterized by being able to be processed by a computer.
- FIG. 1 is a configuration diagram of a broadcast system according to the first embodiment.
- FIG. 2 is a schematic diagram of the contents of the file system according to the first embodiment.
- FIG. 3 is a diagram illustrating an example of the data structure of the file system according to the first embodiment.
- FIG. 4 is a diagram illustrating an example of a transmission content table for adding content according to the first embodiment.
- FIG. 5 is a diagram showing a data structure of the DII message.
- FIG. 6 is a diagram showing a data structure of the DDB message.
- FIG. 7 is a schematic diagram of the contents of the file system after adding the contents according to the first embodiment.
- FIG. 8 is a diagram showing an example of a data structure after adding a content according to the first embodiment.
- FIG. 9 (a) is a processing flowchart (overall) of the storage change means at the time of receiving the content table in the first embodiment.
- FIG. 9 (b) is a processing flowchart (steps 0940, 0950, 0960) of the storage change means at the time of receiving the content table in the first embodiment.
- FIG. 9 (c) is a processing flowchart (steps 0970, 0980, 0990) of the storage change means at the time of receiving the content table in the first embodiment.
- FIG. 10 is a schematic diagram of the contents of the file system at the time of content update according to the first embodiment.
- FIG. 11 is a diagram illustrating an example of a transmission content table for updating content according to the first embodiment.
- FIG. 12 is a diagram illustrating an example of a data structure at the time of content update according to the first embodiment.
- FIG. 13 is a schematic diagram of the content of the finale system at the time of automatic content deletion according to the first embodiment.
- FIG. 14 is a diagram showing an example of a data structure at the time of automatic content deletion according to the first embodiment.
- FIG. 15 is a processing flowchart of a storage change means for performing automatic content deletion according to the first embodiment.
- FIG. 16 is a diagram showing an example of a GUI screen for content management according to the second embodiment.
- FIG. 17 is a schematic diagram of the contents of a file system when a user copies contents according to the second embodiment.
- FIG. 18 is a diagram illustrating an example 1 of a data structure when a user copies content according to the second embodiment.
- FIG. 19 (a) is a processing flowchart (steps 1900, 1910) of the accumulation changing means for copying contents by the user according to the second embodiment.
- FIG. 19 (b) is a processing flowchart (steps 1920 and 1930) of the storage changing means for copying the content by the user according to the second embodiment.
- FIG. 20 is a diagram illustrating a second example of the data structure when the content is copied by the user according to the second embodiment.
- FIG. 21 is a diagram illustrating an example of a transmission content table received when a user copies content according to the second embodiment.
- FIG. 22 is a schematic diagram of the content of the file system when the content is deleted by the user according to the second embodiment.
- FIG. 23 is a diagram illustrating an example of a data structure when content is deleted by a user according to the second embodiment.
- FIG. 24 shows a case where content is deleted by the user in the second embodiment. It is a processing flowchart of accumulation change means.
- FIG. 25 is a schematic diagram of the contents of the file system when the copied content is deleted by the user in the second embodiment.
- FIG. 26 is a diagram illustrating an example of a data structure when the user deletes the copied content according to the second embodiment.
- FIG. 27 shows the case of adding the third embodiment.
- FIG. 28 is a diagram illustrating an example of a data structure at the time of adding a core according to the third embodiment.
- FIG. 29 is a processing flowchart of the accumulation changing means at the time of reception of the table in the third embodiment.
- FIG. 30 is a schematic diagram of the contents of the file system at the time of updating in the third embodiment.
- FIG. 31 is a diagram showing an example of a data structure at the time of updating in the third embodiment.
- FIG. 32 is a diagram illustrating an example of a transmission content table for adding a : in the third embodiment.
- FIG. 33 shows the core according to the third embodiment.
- FIG. 34 is a diagram illustrating an example of a data structure at the time of automatic discarding according to the third embodiment.
- FIG. 35 shows the core according to the third embodiment.
- FIG. 36 is a schematic diagram of the contents of the file system when the user copies the contents according to the third embodiment.
- FIG. 37 is a diagram illustrating an example 1 of a data structure when a user copies content according to the third embodiment.
- FIG. 38 is a schematic diagram of the contents of the file system when the user deletes the contents according to the third embodiment.
- FIG. 39 is a diagram illustrating an example of a data structure when content is deleted by a user according to the third embodiment.
- FIG. 40 is a schematic diagram of the contents of the file system when the copied content is deleted by the user according to the third embodiment.
- FIG. 41 is a diagram illustrating an example of a data structure when the user deletes the copied content according to the third embodiment.
- FIG. 42 is a diagram illustrating an example of a filter matching table according to the fourth embodiment.
- FIG. 43 is a diagram illustrating an example of a transmission content table for adding content according to the fourth embodiment.
- FIG. 44 is a schematic diagram of the contents of the file system when adding contents according to the fourth embodiment.
- FIG. 45 is a diagram illustrating an example of a data structure when adding content according to the fourth embodiment.
- FIG. 46 is a processing flowchart of the storage changing means at the time of receiving the content table according to the fourth embodiment.
- FIG. 47 is a processing flowchart of the accumulation changing means at the time of changing the user profile in the fourth embodiment.
- FIG. 48 is a configuration diagram of a broadcasting system according to the related art.
- FIG. 49 is a diagram illustrating an example of a GUI in the related art.
- FIG. 50 is a schematic diagram of the contents of a file system in the related art.
- FIG. 51 is a diagram illustrating an example of a data structure according to the related art.
- FIG. 52 is a diagram illustrating an example of data to be transmitted in the related art. Explanation of reference numerals
- FIG. 1 is the configuration diagram of the broadcasting system according to the present embodiment.
- reference numeral 0100 denotes the entire broadcasting system according to the first embodiment.
- the broadcasting system 0100 includes a transmission device 0110, a propagation unit 0120, and a reception device 0130.
- the broadcasting system includes an entity layer for storing and managing the entity of the content identified by the content identification in the receiving device and a presentation layer for storing and managing the presentation node identified by the path name. . Then, upon receiving the content identification, the path name, and the entity, step 1 of adding the received entity to the entity layer, and a presentation node having the path name received by the presentation layer and referring to the entity added in step 1 Step 2 to add a new name (the path name is It may be generated on the transmitting side, but in the present embodiment, a default value is set on the transmitting side.)
- the transmitting device 0110 transmits storage type broadcast data.
- the sending device 0110 is composed of a content producing means 0111, a path name setting means 0112, a filter information providing means 0113, a sending information storing means 0114, a sending scheduler 0115, and a sending means 0116.
- Content producing means 0111 performs content authoring.
- the content is used as a language such as BML (Broadcast Mar ku La ngu a ge) used for description of content in data broadcasting of Japanese digital broadcasting.
- BML is a description language based on XML (Extensible Marque La Nuage), and is the second language of AR IBS TD-B24 "Data Broadcasting Code and Transmission Method in Digital Broadcasting" which is a Japanese broadcasting standard.
- the second volume is defined by “XML-based multimedia encoding”.
- Each content is provided with a content id which is an identification for uniquely identifying the content.
- Content with the same content id is identified as the same. That is, when contents having the same content id are not simultaneously stored in the receiving device 0130 and contents already stored are stored in the receiving device 0130, an operation in which one is overwritten by the other is expected. .
- the present invention can be implemented regardless of the description language of the content, such as HTML (Hyper Text Markup Language) used for description of an Internet homepage, and ATVEF (Advanced Te e) of the same HTML system. 1 e Vision Enhancement Method Forum), or MHEG (Mu1time dia Hypermedia Experts Group) -1 5, etc.
- HTML Hyper Text Markup Language
- ATVEF Advanced Te e
- MHEG Mobile Multimedia Experts Group
- the path name setting unit 0112 assigns a path name to each content.
- a character string meaningful to the user of the receiving device 0130 is given to the given path name.
- the path name is “0601 Weather”, which represents the weather forecast for June 1st.
- the filter information assigning unit 0113 assigns filter information to each content.
- the finoleta information is used to automatically select and accumulate appropriate contents for each user of the receiving apparatus 0130 from a large amount of contents.
- the filter information may be information on the genre of the content or free keywords such as characters appearing in the content attached to the content. Generally, input of filter information is also performed manually. ,
- the transmission information storage unit 0114 stores the content to be transmitted, and outputs the stored content to the transmission unit 0116 in response to a content read request from the transmission unit 0116.
- the transmission scheduler 0115 manages which data is transmitted at which time, and outputs a data transmission request to the transmitting means 0116 when the time to transmit is reached.
- the schedule to the transmission scheduler 0115 is input based on the broadcast schedule.
- the schedule is referenced by referring to the data entered for EPG (Electric Program Guide) transmission. It is possible to save labor input.
- the sending unit 0116 may be a sending unit for data broadcasting in digital broadcasting.
- the sending means 0116 sends the content stored in the sending information storage means 0114 to the propagation means 0120 in response to a request from the sending scheduler 0115.
- the content is transferred to MPEG (Moving Picture Ex perts Gr oup) by the data canoe segre of DSM-CC (Digita 1 Storage Media Comm and & Control) which is the transmission protocol of digital data transmission. ) 2—The data is mapped to a digital stream called TS (Transport Stream) and transmitted.
- MPEG Motion Picture Ex perts Gr oup
- DSM-CC Digita 1 Storage Media Comm and & Control
- DSM—CC is an international standard IS ⁇ / I EC 13818-6 “P art 6: Ex tensions for Digital Storage Medium Command ⁇ , Noboru, AR IB STD—B24“ Data in digital broadcasting It is also described in detail in the third chapter, “Data Transmission Schemes,” in “Broadcast Coding and Transmission Schemes”.
- MPEG2-TS It is defined in the standard IS OZ I EC 13818-1 "Information technology, Coding of mo vinpicturesandassocia tedaudiofordigitalstorage me diaat up toabout 1.5 Mb it Zs-Parti: Syst ems.”
- RFC C Request
- a homepage on the Internet can be used.
- HTT P H y per e t e x t T ran s f er P r o t o c o l
- the propagation means 01 20 transmits digital data. If the transmission is performed by BS digital broadcasting, the propagation means 0120 is composed of an equipment for transmitting an electric wave to a satellite, a BS broadcasting satellite, a BS antenna of each home, and the like.
- the present invention can be implemented regardless of the specific transmission method of the propagation means.
- the present invention may be carried out by a public telephone line or by wireless transmission.
- the receiving device 0130 includes a receiving unit 0131, a user management unit 0132, a content filter 0133, a storage changing unit 0134, a storage unit 0135, a presentation control unit 0136, an input unit 0137, a browser 0138, Output means 0 139.
- the receiving means 0131 receives the signal propagated from the propagation means 0120, and reconstructs the content from the signal.
- the receiving means 0131 includes a tuner module for handling a high frequency and outputting it as a digital stream in a general digital broadcasting receiver, and data (contents) transmitted from the digital stream through a data stream multiplexed into MPEG2-TS.
- a hardware / software module that decrypts the data may be used.
- the user management means 0132 registers and manages the user of the receiving device 0130.
- the user's preferences are registered as a user profile.
- the user profile is assigned by the filter information assigning unit 01 13 There is a correspondence with the filtered information. For example, if the filter information is a content genre, the user profile is the genre of information that the specific user is interested in, or if the filter information is a free keyword, the user profile is also a free profile. is there.
- filtering can be executed even if the user profile does not directly correspond to the filtering information.
- the user management means 0 1 32 manages a user who is currently using the reception apparatus 0 1 30 as a current user.
- the change of the current user is performed by the user selecting the user name.
- the content filter 0 1 3 3 compares the assigned filtering information with the user profile stored in the user management means 0 1 3 2 for each content output by the receiving means 0 1 3 1, and the two match. Is determined. Then, only the matching content is output to the accumulation changing means 0 1 3 4.
- the storage changing means 0 1 3 4 changes the stored contents of the storage means 0 1 3 5.
- the details of the processing of the storage changing means 0 1 3 4 will be described later, since a detailed description using a specific example of the data structure will be described later.
- the accumulation changing means 0 1 3 4 performs the following three processes:
- Content filter The content from 0 1 3 3 is reflected in the storage. If the content sent from the content filter 0 1 3 3 is not yet stored in the storage means 0 1 3 5, the content is added to the storage means 0 1 3 5. If the content already exists but is new, the content is updated.
- the content is transmitted with an expiration date called an automatic deletion date. From the contents stored in the storage means 01 35, the contents that have expired are searched for and automatically deleted.
- the storage unit 0135 stores the content to be broadcast.
- the storage means 0135 may be a passive device.
- the storage means 0135 may be a hard disk, an optical disk such as a DVD (DigitalVitastileDisk), a semiconductor memory card such as an SD card, or a non-removable semiconductor memory built in the receiver 0130.
- the presentation control means 0136 allows the browser 0138 to refer to only the contents existing for the current user from the contents stored in the storage means 0135. By referring to the storage means 0135 from the browser 0138 via the presentation control means 0136, it is observed as if only the content existing for the current user is stored in the storage means 0135, and the processing is performed. Done.
- the input unit 0137 is a device for inputting a physical operation from a user of the receiving device 0130.
- the input means 0137 is an infrared remote controller and a light receiving unit, a keyboard, and the browser 0138 is for reproducing contents and changing the stored contents in accordance with the input from the user.
- the browser 0138 outputs a GU I (Gr a h ic Us e r In t e r f a c e) screen and displays it on the output means 0139.
- the user operates the input unit 0137 to select and reproduce the content.
- the content selection menu displayed on the GUI is also the content itself, and the content can be browsed by sequentially following the hyperlinks provided in the content.
- Content browsing may be the same as that of a normal BML browser.
- the browser 0 1 3 8 can change the stored content in addition to the normal browsing function. That is, the storage state of the content on the GUI screen is set to “NO”. It is represented by a display similar to the list of files on a single personal computer, and can delete or rename content.
- the GUI here may be displayed in a tree structure in which contents (files) are nodes as nodes, as in a Windows Explorer, a Microsoft operating system (OS), or a file manager. A detailed description using a specific data structure of the process of changing the stored content will be described later.
- the output means 0 1 39 presents the output of the browser 0 1 38 to the user.
- the output part for the video part of the output of the browser 0138 is composed of a CRT (CatodeRayTube) display as the part of the output part 119, and the speaker for the audio part.
- CRT CatodeRayTube
- FIG. 2 is a schematic diagram illustrating the contents of the file system according to the first embodiment.
- the Huinole system consists of the following two layers:
- Entity layer An entity that is a byte sequence of content (file) is stored and managed. Control from broadcasting of contents such as addition, update, and automatic discarding is performed for this layer. Even if the receiving device has multiple users, only one entity of content is stored in the entity layer for one content.
- Presentation layer A layer that reflects user operations. Deletion of content by each user and differences in stored contents due to differences in user profiles of each user are realized. There is one presentation layer for each user. In the presentation layer, there are 0 or a positive integer number of presentation nodes indicating the entity, and each presentation node is associated with one content entity stored in the entity layer.
- the file system includes an entity layer 0213 and a presentation layer 021 1.
- entity layer 0213 an entity layer 0213 and a presentation layer 021 1.
- presentation layer 021 a presentation layer
- the entity layer 0213 stores two content entities, 0213a and 0213b.
- the number in the entity of each content shown by a rectangle represents the content id that uniquely identifies the content in the entity layer.
- the content id is given in advance by the content production means 0111 of the transmission device 0110, and is not changed by the operation of the user.
- the presentation layer 0211 stores presentation nodes 0211a and 0211b.
- the character string in the presentation node shown in a circle represents the path name of the content.
- the default value of the path name is specified in advance by the path name setting unit 0112 of the transmission device 0110.
- the presentation nodes in the presentation layer are associated with the entities in the entity layer.
- the arrow 0212a in the figure indicates that the presentation node 0211a is associated with the content entity 0213a.
- FIG. 3 is an example of a data structure of a file system for realizing the storage state shown in FIG. 2 in the first embodiment.
- the data structure is based on the presentation table 0310 corresponding to the presentation layer, the entity table 0320 representing the structure of the entity layer, and the storage heap 0330 which is a physical storage in the storage means 0135 of the content (file) byte string. Be composed.
- Presentation table 0310 is a tabular data structure with zero or more rows. Each row has one-to-one correspondence with each presentation node in the presentation layer.
- the presentation table 0310 includes a row 0310a representing the presentation node 0211a of FIG. 2 and a row 0310b representing the presentation node 0211b.
- the presentation table 0310 has two columns of “path name” of 0 311 and “entity reference” of 0312. That is, it can be said that each row of the presentation table 0310 has two items of “path name” and “entity reference”.
- Column 0311 “Path name” is set for each content by the path name setting means in Figure 1.
- the character string in the circle of the presentation node 021 1a in the presentation layer of FIG. 2 illustrates the character string stored in the item 0311a which is the column 0311 of the row 0310a.
- Column 0312 “entity reference” stores information for associating each row of the presentation table 0310 with each row of the entity table 0320 representing each entity of the entity layer.
- arrow 0212a in FIG. 2 illustrates item 0312a.
- the entity table 0320 is a tabular data structure having zero or more rows. Each line has a one-to-one correspondence with the content entity in the entity layer.
- the entity table 0320 has a row 0320 a representing the entity 021 1a in FIG. 2 and a row 0320 b representing the entity 021 1b.
- the entity table 0320 has four columns of “sector number” of 0321, “size” of 0322, “automatic deletion time limit” of 0323, and content id of 0324.
- “06707” in the automatic deletion term indicates June 7.
- the entity table 0320 stores rows for two entities 0320 a and 0320 b.
- the row 0320a corresponds to the entity 0213b in FIG. 2, and the numeral described in the rectangle representing the entity in FIG. 2 illustrates the “content id” in the column 0324.
- Column 0321 “sector number” indicates where in the storage heap 0330 the entity row is stored.
- the storage heap is managed in fixed-length block units called sectors for efficiency. Here, one sector is 4096 bytes. In this document, for simplicity, multiple contiguous sectors are used when storing more than 4096 content, and when the number of sectors required for stored content increases, If the required number of sectors cannot be secured, the “sector number” is changed and stored in another location.
- a byte sequence of the substance of the content is stored in two areas of 0332a and 0332b.
- area 0332a a row of bytes is stored from sector number 1001 to immediately before sector number 1003, that is, straddle sector number 1001 and sector number 1002. Have been.
- Sector 1001 corresponds to the numerical value “1001” stored in item 0321a of entity table 0320.
- the length of the area 0332a corresponds to the numerical value “6737” of the item 0322a of the entity table 0320.
- a character string corresponding to “0601 article 1” and a “path name” in the presentation node of the corresponding presentation layer is illustrated in an area 0332a.
- this character string is provided for convenience of explanation, and does not indicate that the area “0332a” includes the character string “0601 article 1”.
- This embodiment can be implemented regardless of the placement strategy for the storage heap.
- the processing of increasing the stored content by the arrival of new content will be described in detail using a specific data structure. Will be described.
- FIG. 4 is an example of a transmission content table transmitted to add content according to the first embodiment.
- 0410 is a transmission content table.
- the transmission content table is a tabular data structure generally including one or a plurality of contents, and is used for transmitting the contents.
- Each column of the transmitted content table has one-to-one correspondence with each transmitted content.
- the transmission content table includes five columns of “content id”, “path name”, “size”, “automatic deletion time limit”, and “substance byte sequence”. Among them, “content id”, “path name”, “size”, and “automatic deletion period” are the same as the columns of the same name which are described in the description of the columns of the presentation table 0310 and the entity table 0320 in FIG. Further, the “substance pile sequence” includes the content pile sequence to be stored in the area stored in the storage heap 0330.
- a method of transmitting the transmission content table there is a method of mapping a string of bytes representing data in a tabular format into a data structure called a module, which is a transmission unit of the DSM-CC data roux cell.
- FIGS. 5 and 6 a part of the data structure used in the data carousel will be described.
- Figure 5 shows the DII (Down load I nfo Indicatio n) It is explanatory drawing of the data structure of a message.
- 0510, 0520, and 0530 indicate the data structure of a DII message, a Name descriptor (Name-descriptor ()), and an Expire descriptor (Ex ire-descriptor ()).
- FIG. 6 is an explanatory diagram of the data structure of a DDB (Down 1 oad Data B iock) message.
- DDB messages store and transmit module strings.
- the content id is set to the mo du 1 e Id of the field 0511
- the size is set to the mo du le Size of the field 0512
- the module is set to the field 0513.
- Field name as Fino Redo 0521 te X t_c har as Name descriptor of 0520
- Field name as Ex pire descriptor of 0530
- MJD—JST time field
- a row of piles of one content entity is mapped as one module. That is, in FIG. 6, a pile of entity of content is stored one by one in finored b1ockDaTaByte represented by 0611 in the DDB.
- FIG. 7 is a schematic diagram illustrating the contents of the file system after the contents are added in the first embodiment.
- the transmission content table shown in FIG. 4 is received, the schematic diagram showing the contents of the file system shown in FIG. In the figure, the changed part is enclosed by a bold rectangle for convenience.
- the contents corresponding to 0410a, 0410b, and 0410c which are the rows representing the three contents transmitted in the transmission content table 0410, are stored in the entity layer 0713 in the entity layers 0713a, 0713b, and 0713c of the content. Added to ing. In addition, the entities of the contents that originally existed in 0213a and 0213b in FIG. 2 remain as 0713d and 0713e.
- FIG. 8 is an example of a data structure after adding content in the first embodiment.
- each data structure shown in FIG. 3 changes to the content shown in FIG. 8 to add content.
- the changed portion is surrounded by a bold rectangle for convenience.
- 0810, 0820, and 0830 are a presentation table, an entity table, and a storage heap in order after the content is added.
- the contents corresponding to the columns 0410a, 0410b, and 0410c of the transmission content table 0410 are added to the rows 0810a, 0810b, and 0810c.
- rows 0310a and 0310b, which were originally in the presentation table 0310 of FIG. 3 remain as rows 0810d and 0810e of the presentation table 0810.
- rows 0820a, 0820b, and 0820c are added to the accumulation table 0820, and rows 0820d and 0820e remain.
- the substance of the content is added.
- the contents of the items 0415a, 0415b, and 0415c in which the bit strings of the three content entities are stored are sequentially stored in the storage heap 0830 in the areas 0830a, 0830b, and 0830c. Is stored as In addition, the contents of the areas 0332 a and 0332 b of the storage heap 0330 in FIG. 3 are the storage heap 0830 and remain in the areas 0830 d and 0830 e in order.
- FIGS. 9 (a) to 9 (c) are a flowchart summarizing the processing performed by the storage changing means when the transmission content table is received in the first embodiment.
- Step 0900 Select one row at a time from the transmission content table.
- Step 0910 If it is determined in step 0900 that all the rows have been selected and there are no more rows to be selected, the processing for receiving the transmission content table ends. If there is a row to be selected, proceed to the next step 0920.
- Step 0920 A row having the same content ID as the row selected in Step 0900 of the transmission content table is searched from the entity table. (Step 0930) If the result of the search in Step 0920 indicates that a row exists, the process proceeds to Step 0970. Otherwise, go to the next step 0940.
- Step 0940 Write the “substance column” included in the row selected in step 0900 of the transmission content table to a new area of the storage heap.
- step 0940 will be described in detail using a flowchart 0940.
- Step 094 1 The item of “size” is obtained from the row selected in Step 0900 of the transmission content table.
- Step 094 2 The location obtained in step 094 1 is searched for a place on the storage heap where continuous writing is possible, and it is set as the writing area.
- Step 0943 Write the “substance string” contained in the row selected in step 0900 of the transmission content table to the write area found in step 0942. This is the end of the processing regarding step 0940.
- Step 0950 Add a new line to the entity table and set each item.
- step 0950 will be described in detail using a flowchart 0950.
- Step 0951 Generate a new row in the entity table. Items will be set for this line in subsequent steps.
- Step 095 2 The top sector number of the area written to the storage heap in Step 0940 (more specifically, Step 0943) is obtained.
- the obtained sector number is set in the item “sector number” of the row generated in step 0 95 1 of the entity table.
- Step 095 3 Obtain “size”, “automatic deletion period”, and “content id” from the row selected in step 0900 of the transmission content table, and execute step 0951 of the entity table. Set to the corresponding item of the generated row. This is the end of the processing regarding step 0950.
- Step 0960 Add a new row to the presentation table and set each item. Then, the process returns to step 0900.
- step 0960 will be described in detail using a flowchart 0960.
- Step 096 Generate a new row in the presentation table. Subsequent scans for this line
- Step 0 9 6 2 Step 0 9 5 0 of the entity table (More specifically, Step 0 9 5 Set a value in the “entity reference” item of the row generated in step 096 1 of the presentation table so as to refer to the new row generated in step 1).
- Step 096 The path name is obtained from the row selected in Step 0900 of the transmission content table.
- the obtained path name is set in the “path name” item of the row generated in step 0966 1 of the presentation table. This is the end of the processing related to step 0960.
- Step 0970 The ⁇ Pite column of entities '' included in the row selected in Step 0900 of the transmission content table is released once the area of the pat of the entity already stored is released. Write to the storage heap area. If the sector number is ignored, it can be said that the entity's row of strings has been overwritten.
- step 0970 will be described in detail using a flowchart 0970.
- Step 0971 The item of “size” is obtained from the row selected in step 0900 of the transmission content table.
- Step 0972 Release the current area. That is, the area on the storage heap starting from the item “sector number” of the row searched in step 0920 of the entity table is released from the storage heap.
- Step 0973 From the same start position as the current area, determine whether the actual byte string can be written. In other words, starting from the item “sector number” of the row searched in step 0 9 20 of the entity table, it is determined whether an area of the size obtained in step 0 9 7 can be secured, and if possible, step 0 9 7 5. If not possible, go to step 0 9 7 4.
- Step 0974 Search for a place on the storage heap to write the size obtained in step 0971. Then, the process proceeds to Step 09776.
- Step 0 9 7 5 Set the current area of the storage heap as the location to write. In other words, starting from the item “sector number” in the row searched in step 0 920 of the entity table, the location corresponding to the size obtained in step 0971 is to be written.
- Step 0 976 In the location on the storage heap (determined in Step 0 9 7 4 or Step 0 9 7 5), the row of entities of the row selected in Step 0 9 0 0 of the transmission content table Write. This is the end of the processing related to step 0970.
- Step 0980 In the entity table, the row corresponding to the stored content Step 9 Reset each item in the row searched in 920.
- step 0980 will be described in detail using a flowchart 0980.
- Step 0981 Attention is paid to the row retrieved in step 0920 of the entity table as a row to be set in the subsequent steps.
- Step 0982 The first sector number written to the storage heap in Step 0976 is set to the item “sector number” of the row of interest in Step 098.1 of the entity table.
- Step 0983 The size, the automatic deletion period, and the content id are obtained from the row selected in step 0900 of the transmission content table, and each of the rows of interest in step 0981 of the entity table is obtained. Set items. This concludes the processing for step 0980.
- Step 0990 In the presentation table, reset each item of the row corresponding to the stored content. Then, the process returns to step 0900.
- step 0990 will be described in detail using a flowchart 0900.
- Step 0991 In the presentation table, a row associated with the row retrieved in step 0920 of the entity table is noted as a row to be set in the subsequent steps.
- Step 0992 The path name is obtained from the row selected in step 0900 of the transmission content table, and is set to the row of interest in step 0991 of the presentation table. This is the end of the processing related to step 0990.
- step 0900 row 0410a of the transmission content table 0410 is selected. Then, the process proceeds from step 0910 to step 0920.
- step 0920 the value of the item 0 4 1 1a of the “content 0 4 9 d” of the row 0 4 10 a of the transmission content table 0 4 10 0 A row having "0 6 0 2 0 0 1" is retrieved. However, none of the lines 0320a and 0320b have the same content 0409d. Therefore, the process proceeds to step 0940. In step 0941, the value “6743” of the item “0413a” of “size” in the row 0410a of the transmission content table 0410 is obtained.
- step 0942 an area with a sector number “1005” subsequent to the area 0330b is searched out as an area in which the area of 6743 bytes can be continuously written on the storage heap 0330.
- step 0943 the contents of the item 0415a of the “substance string” of the transmission content table are written into the area from the sector number “1005” of the storage heap 0330.
- step 0951 a new row is created in the entity table 0320.
- step 0952 the sector number "1005" written in step 0943 is set in the "sector number” field of the row created in step 0951.
- step 0953 the "size" of the row created in step 0951
- the values of the items 0413a, 0414a, and 0411a of the row 0410a of the transmission content table 0410 are sequentially set for the items of "automatic deletion time limit" and "content id".
- step 0961 a new row is created in presentation table 0310.
- step 0962 a value for referencing the row generated in step 0951 of the entity table is set in the “entity reference” item of the row created in step 0961.
- step 0963 the value of the item 0412a in the row 0410a of the transmission content table 0410 is set in the "path name" field of the row created in step 0961.
- step 0910 there are no more rows to be selected in the transmission content table, and the flowchart 0900, ends.
- FIG. 10 shows a file system for updating content according to the first embodiment. It is a schematic diagram of the contents of a program.
- 110 is a schematic diagram of the contents of the file system before the content is updated. Three contents are stored in the file system.
- Numeral 1020 is a schematic diagram of the contents of the file system as a result of updating the content with respect to the schematic diagram 1010.
- the presentation node 101 1 c of the schematic diagram 110 is changed to the presentation node 102 1 c of the schematic diagram 102.
- the power path name which is the path name, has been rewritten from “0.601 exchange 1” to “0.601 exchange 2”.
- FIG. 11 is an example of a transmission content table for updating content according to the first embodiment.
- the contents table 111 is received, the contents of the file system represented by the schematic diagram 110 transition to the state of the schematic diagram 210.
- FIG. 12 is an example of a data structure at the time of content update in the first embodiment.
- the processing content and the change in the data structure at the time of content update will be described in detail using a flowchart.
- step 0920 the content id obtained from the item 1 1 1a of the row 1 11 0a of the transmission content table 1 11 0 from the entity table 1 210 The row with "0 3" is retrieved. As a result, the row 1 220 c of the entity table 1 210 is searched.
- step 0970 since there is a content having the same content id, step 0970 (that is, step 097) is performed. Proceed to 1 to step 0 9 7 6).
- step 0971 the size “6039” is obtained from the item 1113a of the row 1111a of the transmission content table 111.
- step 0972 the row of the transmission content table The area 1230 c of the storage heap 1230 having the data number “1005” is released.
- step 0973 it is determined from the sector number "1005" that an area of size "6039" can be written. Since the size is “6039”, two 4096-byte sectors are required and the sector numbers “1005” and “1006” must be reserved, but both are not occupied by the existing area. Because there is. Then go to step 0975.
- step 0975 the start position of writing to the storage heap is
- step 0976 the byte number of the entity in the transmission content table is stored, and the item 1115a of the row 1110a is written first with the sector number "1005" of the storage heap.
- step 0981 the row 1220c of the entity table 1220 is set as the target of the subsequent steps 0982 and 0983.
- step 0982 the head sector number “1005” written in step 0976 is set in the item 1221 c of the row 1220 c of the entity table 1220. Since the same value is overwritten where the sector number “1005” is originally set, the value does not change.
- step 0983 the size, the automatic deletion time limit, and the content id are obtained in order from the items 1113a, 1114a, and 1111a of the transmission content table 1110, and in order, the item 1222 of the row 1220c of the entity table 1220 is obtained. c, 1223 c, 12
- step 0991 the row 1210c of the presentation table 1210 corresponding to the row 1220c of the entity table 1220 is set as an object to be set in the subsequent step 0992.
- step 0992 the path name “0601 Exchange 2” obtained from item 1 1 12a of line 1110a of the transmission content table 1110 is added to item 1211c of line 1210c of the presentation table 1210 set in step 0991.
- the change of the data structure by the content update is completed. That is, the presentation table is stored from 1210 to 1240, the entity table is stored from 1220 to 1250, The product heap changes from 1 230 to 1 260.
- FIG. 13 is a schematic diagram of the contents of the finale system at the time of automatic content deletion according to the first embodiment.
- 1310 is a schematic diagram of the contents of the file system before the contents are automatically deleted. Three contents are stored in the file system.
- 1320 is a schematic diagram of the contents of the file system as a result of automatic content deletion from the schematic diagram 1310.
- the entities 1313 c and 1313 d in the schematic diagram 1310 are deleted in the entity layer in the schematic diagram 1320.
- the presentation node 1311c, the presentation node 1311d, and the force diagram 1320 of the schematic diagram 1310 are deleted.
- FIG. 14 is an example of a data structure at the time of automatic content deletion according to the first embodiment.
- the processing content and the change in the data structure at the time of automatic content deletion will be described in detail using a flowchart.
- FIG. 15 is an explanatory diagram of a flowchart at the time of automatic content deletion according to the first embodiment.
- Reference numeral 1500 denotes a processing flowchart of the accumulation changing means 0 1 3 4 for automatically deleting contents.
- the process represented by the flow chart 1500 is started at a frequency corresponding to the expected accuracy of the automatic deletion term. For example, if the expected accuracy of the automatic deletion deadline is on a daily basis, this process must be invoked at least once a day.
- each step of the flowchart 1500 will be described.
- Step 1510 Select one row at a time from the entity table.
- Step 1520 If it is determined in Step 1510 that all rows have been selected and there are no more rows to be selected, the automatic content deletion process ends. If there are rows to select, proceed to the next step 1503.
- Step 1 5 3 0 In the row selected in Step 1 5 1 0 of the entity table, the value of the item of the automatic deletion term is compared with the current time. 1540) If it is determined in step 1503 that the value of the item of the automatic deletion period is older than the current time, the process returns to step 15010. Otherwise, go to the next step 1505.
- Step 1550 Search for the row corresponding to the presentation table. If there is no row, go to Step 1570. If there is, go to the next step 1560. Search for rows in the presentation table where the item of entity reference points to the row selected in step 1510
- Step 1560 Delete the row retrieved in Step 1550 of the presentation table.
- Step 1570 In the storage heap, delete the area starting from the value of the item of the sector number in the row selected in Step 1510 of the entity table.
- Step 1580 Delete the row selected in Step 1510 of the entity table. Then, return to step 1510.
- the current time is June 3
- the process of the flowchart 150 is started in the state of the presentation table 144, the entity table 144, and the accumulation heap 144. think of.
- step 1510 first, row 1402a of entity table 1402 is selected.
- step 1503 the current time is June 3, and the value of the item of the automatic deletion time limit “0 6 _ 0” of the row 1520 a selected in step 1510 of the entity table 14 20 7 ”(means June 7) is compared.
- step 1504 the value of the item of the automatic deletion term is not older than the current time, so the process returns to step 1505.
- step 1510 row 1420b is selected in the entity table 1420, but the automatic deletion period is "0 6 Z07", which is the same as the previous time. After performing step 1504, return to step 150.
- step 1510 row 14420c is selected in entity table 14420 Go through 520 to the next step.
- step 1530 the current time is compared with the value “06Z02” of the automatic deletion term in row 1420 c of the entity table 1420.
- step 1540 the value of the item of the automatic deletion time limit is older than the current time, so the process proceeds to step 1550.
- step 1550 the presentation table 1410 includes a row 1410 c corresponding to the row 1420 c of the entity table 1420, so the process proceeds to step 1560.
- step 1560 row 1410c of presentation table 1410 is deleted.
- step 1570 the area 1430c of the storage heap 1430 starting with the value "1005" of the sector number in the row 1420c of the entity table 120 is deleted.
- step 1580 row 1420c of entity table 1420 is deleted. Then, return to step 1510.
- step 1510 the row 1420d is selected in the entity table 1420. Force Since the automatic deletion term is "06 02" similar to the previous row 1420c, it is also automatically deleted.
- presentation table 1410 has rows 1410 c and 1411 d deleted and becomes presentation table 1440
- entity table has rows 1420 c and 1420 d deleted and entity table 1450
- the accumulated heap has 1430 c and 1430 d are deleted to become accumulation heap 1460.
- the name of the content can be freely changed by changing the path name of the presentation layer. Even after changing the path name, processing such as adding, updating, or automatically deleting content can be performed. This is because the entity layer to be processed from the broadcast manages not the path name but the content id as identification.
- a character string representing a hierarchical directory may be stored as a path name.
- the content appears to be in one of the hierarchical directories.
- the directory where the content exists is changed.
- the content has moved from one directory to another.
- adding, updating, or automatically deleting the content does not affect the processing of the entity layer in which the content is identified by the content id. That is, even if the user moves the content from one directory to another, the addition, update, or automatic deletion of the content will work normally without any effect.
- the content layer for controlling the content stored from the broadcast by the content id and the content are identified by the path name and the user can freely access the content It has a presentation layer that allows the user to freely change the content name and move it, such as a file system of an operating system such as UNIX or Windows, even though the file system controls the stored content from broadcasting. It can be copied for backup, backup, etc., or you can create your own files. Furthermore, by changing the path name, for example, the content controlled from the broadcast can be moved to another directory, and even after the movement, the control from the broadcast such as update / automatic deletion can be continuously executed. .
- the broadcasting system according to the second embodiment has the functions of the broadcasting system according to the first embodiment, and can freely delete and copy contents stored in a file system of a receiving device like a file in a personal computer. (Replication), with the ability to move.
- the broadcast system according to the second embodiment has a feature of the broadcast system according to the first embodiment, which has a step 1 in which a path name is specified by a user and a path name specified in the step 1.
- Step 2 for retrieving the presentation node from the presentation layer
- Step 3 for copying the entity referred to from the presentation node retrieved in Step 2
- Step 4 for setting the content identification of the entity copied in Step 3 to an invalid value.
- FIG. 16 is an example of a GUI screen according to the second embodiment. 1600 is the entire G UI screen.
- the GUI screen 1610 is output by the browser 0138 and displayed on the output unit 0139.
- Reference numeral 1610 denotes a window that expresses the hierarchical structure of the content stored in the receiving device in a linear manner. A rounded rectangle without a window indicates a folder or content.
- Reference numeral 1620 denotes a group of operation buttons for the hierarchical structure of the content. For example, if the user presses the “Delete” button after specifying the content, a delete operation has been requested for the specified content. Alternatively, after specifying the content, pressing the “copy” button means that a copy of the specified content has been requested.
- Reference numeral 1630 denotes a window for browsing the content stored in the receiving device.
- a browsing screen is displayed in window 1630 for the content selected in window 1610 representing the hierarchical structure of the content.
- the copying of the content by the operation of the user is started by operating the GUI screen 1610 and explicitly specifying the content to be copied by the user. That is, the user operates the input unit 0137 to give an instruction to the browser 0138, and the instruction reaches the storage change unit 0134 from the browser 0138, and the processing of the storage change unit 0134 is started.
- FIG. 17 is a schematic diagram of the contents of a file system when a user copies contents according to the second embodiment.
- the schematic diagram 1710 shows a state before the content is copied by the user. Then, the schematic diagram 1720) shows the result of the process in which a copy instruction is given to the content corresponding to the presentation node 1711b and the entity 1713b in the schematic diagram 1710. ⁇
- the presentation node 1721 c is generated by copying 1721 b (that is, 1711 b), but the entity 1723 c is also generated by copying the entity 1723 b (that is, 1713 b).
- the copied entity 1723 c contains No entity id is associated with it, and the entity is separate from the entity 1 723 b that was the source of the copy.
- the schematic diagram 1730 then corresponds to the reference node 1721b (i.e., 1773lb) and the entity 1723b (i.e., 1733b) from which the copy was made. Yes Indicates the state after the content has been updated.
- FIG. 20 is an explanatory diagram of a transmission content table changed from the schematic diagram 1720 to the schematic diagram 1730, and 21010 is a transmission content table.
- the processing when the transmission content table 210 is received is performed based on the flowchart 0900 'described above.
- the value of the content id in the row of the transmission content table is “06001002”, which is the same as the content id in the row 1750b of the entity table 1750. Therefore, the stored content corresponding to row 1750b is updated. In addition, the path name will be overwritten from "0.601 Exchange 1" to "0.601 Exchange 2.”
- the schematic diagram 1730 shows the state after the content 1731b that has been copied is automatically deleted.
- the copied content is independent of the content from which it was copied, so it continues to exist without being affected by the automatic deletion of the copy source.
- the content when the content is copied by the user, the content is changed as a result of receiving or automatically deleting the transmission content table by copying the content as a separate entity. Has unaffected features.
- the receiving device when a method of not copying an entity when copying a user is adopted, the receiving device is referred to as “hurrying” when automatically discarding or updating. It is necessary to prepare an entity for The process of copying an entity is However, if the size of the entity string is large, the load may be applied to the receiver and the load may be observed by the user. However, the timing at which the process of performing the entity copy is activated is intuitively predicted by the user. Can not.
- FIG. 18 is an example of a data structure when a user copies content according to the second embodiment.
- the presentation table 1810, the entity table 1820, and the storage heap 1830 indicate a state before the content is copied by the user. And the presentation table 1840 and the entity table
- the row 1840c is generated by copying based on the row 1840b (that is, the row 1810b) by the content copy operation by the user.
- row 1850c is generated by copying based on row 1850b (that is, row 1820b).
- area 1860c is generated by copying based on area 1860b (that is, area 1830b).
- FIGS. 19 (a) and 19 (b) are processing flowcharts of the storage changing means for copying contents by the user according to the second embodiment.
- Step 910 Write the row of piles of the storage heap corresponding to the content to be copied to a new area on the storage heap.
- step 1910 will be described in detail with reference to a flowchart 1910.
- Step 1 911 The item of “size” is obtained from the row of the entity table corresponding to the content to be copied.
- Step 1912 A location where the size obtained in step 1911 can be continuously written on the storage heap is searched, and is set as a write area.
- Step 1913 Copy is performed by writing the byte string of the storage heap corresponding to the content to be copied to the area searched for in step 1912. This is the end of the processing related to step 1910.
- Step 1920 A new row is added to the entity table, and the items other than the automatic deletion time limit and the content id are set by copying.
- step 1920 will be described in detail with reference to a flowchart 1920.
- Step 1921 Generate a new row in the entity table. Items will be set for this line in subsequent steps 1922 and 1923.
- Step 1922 The top sector number of the area written to the storage heap in Step 1910 (more specifically, Step 1913) is obtained.
- the obtained sector number is set in the item “sector number” of the row generated in step 1921 of the entity table.
- Step 1923 The “size” is obtained from the row of the entity table corresponding to the content to be copied, and is set in the corresponding item of the row generated in step 1921 of the entity table.
- Step 1924 In the row generated in step 1921 of the entity table, a special value outside the normal range is set as the value of the item of the automatic deletion term and the content id. Set special values to ensure that these items do not contain meaningful values.
- step 1920 This is the end of the process related to step 1920.
- Step 1930 Add a new line to the presentation table, and copy and set each item. Then, the process returns to step 1900.
- step 1930 will be described in detail using a flowchart 1930.
- Step 1931 Generate a new row in the presentation table. Items will be set for this line in subsequent steps.
- Step 1932 Set a value in the ⁇ entity reference '' item of the row generated in step 1931 of the presentation table so as to refer to the new row generated in step 1920 (more specifically, step 19 21) of the entity table I do.
- Step 1 9 3 Obtain the path name from the row of the presentation table corresponding to the content to be copied. The obtained path name is set in the “path name” item of the row generated in step 1931 of the presentation table.
- Step 1 9 11 obtain the size “4 0 3 9 pite” from the row 1 8 2 2 b size item 1 8 2 2 b corresponding to the copy source content of the entity table 18 2 ⁇ Step 1 At 912, we find a location on the accumulation heap 183 for a new area of 400 pites, and find that sector number 1004 can be stored at the top.
- step 1913 the row of piles in the area 1830b on the storage heap 1840 is copied from the sector number "1004" to generate the area 1860c.
- step 1921 a new row 1805c is generated in the entity table 1805.
- step 1 922 the sector number “1 0 4” used in step 1 9 13 is replaced with the newly created row 1 850 c of the entity table 1 850. 1 Store in c.
- step 1923 the size is obtained from item 1852b and written to item 1852c.
- step 1924 a special value is set for the item 1 8 5 3 c of the automatic deletion term and the item 1 8 5 4 c of the content id.
- step 1931 a new row 1840c is created in the presentation table 1840.
- step 1932 set the item 1842c of the entity reference of the presentation table 1840 so as to refer to the new row 1850c of the entity table 1850.
- step 1933 set the new row 1840c path name entry 1840c in the presentation table 1840 to a different name based on the item 1840b I do. For example, at this time, the user can input an appropriate character string, or after the item 1840b character string, For example, the character string "(copy)" may be automatically linked. In the figure, the user is prompted to enter the character string “Copy of Exchange 1”.
- FIG. 20 is a second example of the data structure when the content is copied by the user according to the second embodiment.
- the presentation table 210, the entity table 202, and the storage heap 200, are the copy source from the presentation table 180, the entity table 180, and the storage heap 180 of Figure 18. This indicates that the content has been updated.
- FIG. 21 is an example of a transmission content table received when a user copies content according to the second embodiment. Since the content having the content id “0 6 0 0 0 2” exists in the row 1850 b of the entity table 1850, the content corresponding to this row is updated.
- the content update process is the same process executed based on the flowchart 0900, shown in FIG.
- the presentation table 204, the entity table 250, and the storage heap 2660 show a state in which the copy source content has been automatically deleted by automatic deletion after that.
- the process of automatically deleting the content here is the same process executed based on the flowchart 1500 shown in FIG. 15 described above, and thus the details are omitted.
- the content deletion by the user is started by operating the GUI screen 1610 and explicitly specifying the content to be deleted by the user.
- the user operates the input means 0 1 37 to instruct the browser 0 1 3 8, and the instruction reaches the accumulation change means 0 1 3 4 from the browser 0 1 3 8 and accumulates.
- the process of the changing means 0 1 3 4 is started.
- FIG. 22 is a diagram showing a flow when a content is deleted by a user according to the second embodiment. > It is a schematic diagram of contents.
- the schematic diagram 220 shows a state before the content is deleted by the user. Then, the schematic diagram 220 shows a state after the content is deleted by the user. In the schematic diagram 2210, the user requests deletion of the content corresponding to the presentation node 2221a and the entity 2213a.
- the presentation node is deleted.
- the entity 2222a exists without being deleted.
- the file system according to the second embodiment has a special feature that deletes only the presentation node in the presentation layer and does not delete the entity in the entity layer when the user deletes the content. I have.
- FIG. 23 shows an example of a data structure when content is deleted by a user in the second embodiment.
- the presentation table 230, the entity table 230, and the storage heap 230 represent the state before the user deletes the content.
- the presentation table 230, the entity table 230, and the storage heap 230 represent the state after the content has been deleted by the user.
- FIG. 24 is an explanatory diagram of a flowchart for performing an operation of deleting content generated by copying by a user.
- Reference numeral 2400 denotes a flow chart of the accumulation changing means 0134 which performs a user's content deletion operation.
- Step 2410 Delete the corresponding row in the presentation table corresponding to the content to be deleted.
- Step 2420 It is determined whether the content to be deleted has been generated by copying by the user. For content generated by copying by the user, a special value is stored in the content id, and this may be used as judgment material.
- Step 2430 If it is determined in Step 2402 that the copy is not the user's copy, the user deletes the content. Otherwise, go to step 2440.
- Step 2440 Release the area corresponding to the content to be deleted in the storage heap.
- Step 2450 In the entity table, delete the row corresponding to the content to be deleted.
- step 2430 since the content to be deleted is not generated by the user's copy, the flowchart 2400 ends in step 2430, so Only step 2 410 in the flowchart is performed. Therefore, speaking of the data structure, only the rows of the presentation table are deleted, and the entity table and the accumulated heap are not changed. Or, regarding the schematic diagram of the file system, only the presentation node is deleted, and the entity is not deleted.
- FIG. 25 is a schematic diagram of the contents of the file system when the copied content is deleted by the user in the second embodiment.
- the schematic diagram 25010 shows a state before the copied content is deleted by the user.
- the schematic diagram 250 shows the state after the copied content has been deleted by the user.
- the user requests deletion of the content corresponding to the presentation node 2511d and the entity 2513d.
- the presentation node 2 5 1 1 d and the entity 2 5 1 3 d are deleted, and the state of the schematic diagram 2 5 2 0 is established.
- the difference from the case of deleting the content not generated by copying by the user described in FIGS. 22 and 23 is that the entity 2513d is also deleted at the same time.
- FIG. 26 shows an example of a data structure when the user deletes the copied content according to the second embodiment.
- step 2401 the row 2610d of the presentation table 2610 is deleted.
- step 2402 since the value of the content id of the entity table 2602 is a special value (in the figure, "1" represents a special value), the copy by the user is performed. Is determined.
- step 2430 the process proceeds to step 2440 because the copy is made by the user.
- step 2440 the area 2630d is released in the accumulation heap 2630.
- step 2450 row 2602d is deleted from entity table 2602.
- the user in addition to the effects of the first embodiment, it is possible for the user to freely delete the stored content or copy the content. . Then, in the same list, it becomes possible to manage the content controlled from broadcasting and the data created by the user by copying in a mixed manner.
- the data (content) copied by the user can continue to exist without being affected by the automatic deletion period of the content that was copied.
- the broadcasting system according to the third embodiment has the functions of the broadcasting system according to the second embodiment, and can register a plurality of users in a receiving device, store different contents for each user, Function that allows different operations such as copy and delete have.
- the broadcast system according to the third embodiment has the features of the broadcast systems according to the first and second embodiments, and can also store different contents for each of a plurality of users registered in one receiving device ( The same or different path names can be assigned to multiple users.) That is, when the content identification, the path name, and the entity are received, the received entity is added to the entity layer, step 1; attention is given to each user one by one from all users; and There is a step 3 in which the presentation node having the received path name in the presentation layer and referring to the entity added in the step 1 is followed up and the procedure returns to the step 2.
- FIG. 27 is a schematic diagram of the content of the file system when adding content in the third embodiment capable of processing a plurality of users.
- 2710 is a schematic diagram before the content is added.
- two presentation layers 2711 and 2712 are associated with one entity layer 2713.
- Each presentation layer corresponds to an individual user.
- Each user observes as if the presentation node exists in his / her presentation layer, and only in that case, as if the content exists in the storage means 0 135.
- the number of presentation layers is the same as the number of users, and can be implemented with the same data structure and processing flowchart. However, for simplicity, the following description assumes that there are two users.
- the first and second embodiments are special in that the number of users is one in the third embodiment. Therefore, the data structure and the processing flowchart in the third embodiment when the number of users is 1 are exactly the same as those in the first and second embodiments.
- 2720 is a schematic diagram after the content has been added to the schematic diagram 2710.
- the entity 2 7 2 3 a is added to the entity layer 2 7 2 3, and the presentation nodes 2 7 2 1 a and 2 7 are sequentially assigned to the two presentation layers 2 7 2 1 and 2 7 2 2.
- 2 2a is added.
- One byte string is stored regardless of the number of users (that is, the number of presentation layers). At this point, since it is not necessary to perform the processing redundantly for the number of users, the capacity of the storage means 0 135 can be made effective, and at the same time, the write processing time is kept almost constant even if the number of users increases.
- FIG. 28 shows an example of a data structure when adding content according to the third embodiment.
- FIG. 28 is an example of a data structure for realizing the schematic diagram of FIG.
- the presentation table 2810, the presentation table 2820, the entity table 2830, and the accumulation heap 2840 correspond to the schematic diagram 2710 of FIG.
- the presentation table 280, the presentation table 280, the entity table 280, and the accumulation heap 280 correspond to the schematic diagram 270 of FIG.
- line 2 850 0 a in presentation table 2850 0 line 2 860 0 a force in presentation table 2 860 0 line 2 870 0 a in entity table 2 870
- the area 288 0a is added to the force accumulation heap 288 0 respectively.
- FIG. 290 is an explanatory diagram of a processing flow chart at the time of receiving the transmission content table in the third embodiment. It is a processing flowchart of. FIG. 29 is similar to the flowchart 0900, when the transmission content table according to the first embodiment is received. Therefore, in the flowchart 2900, steps having the same contents as those in the flowchart 0900 'are given the same reference numerals.
- Step 0960 and step 0900 are changed to be processed for all users. Specifically, Step 2910 and Step 2920 are replaced with Step 0960, and Step 2930 and Step 2940 are replaced with Step 0990. By adding, step 0960 and step 0990 are repeatedly executed by the number of users. However, step The presentation table handled at 0960 and 0990 is the user currently selected at step 2910 or step 2930.
- FIG. 30 is a schematic diagram of the content of the file system at the time of content update according to the third embodiment.
- FIG. 310 is a schematic diagram before the content is updated.
- Reference numeral 320 denotes a schematic diagram after the content has been updated.
- presentation node 3 0 2 1 c force at presentation layer 3 0 2 1
- Presentation node 3 0 2 2 c force at presentation layer 3 0 2 2 Entity 3 0 2 3 at entity layer 3 0 2 3 c has been updated respectively.
- FIG. 31 shows an example of a data structure at the time of content update in the third embodiment.
- the presentation table 3110, the presentation table 3120, the entity table 3130, and the storage heap 3140 correspond to the schematic diagram 310 of FIG. Further, the presentation table 3150, the presentation table 3160, the entity table 3170, and the storage heap 3180 correspond to the schematic diagram 320 of FIG.
- FIG. 32 is an example of a transmission content table for adding content according to the third embodiment.
- the value of the transmitted content id is “0 6 0 0 0 3”, which is the same as that of the row 3130 c of the entity table 3130. Therefore, while the row 3130c of the entity table 3130 is changed, the corresponding area 3140c of the accumulation heap 3140 and the corresponding row 3110 in the two presentation tables are changed. c and 3120c are changed.
- the content update process can be performed by the flowchart 2900 of FIG. 29 described above. Again, the only difference is that the processing of the presentation layer is repeated by the number of users, which is different from the flowchart of the first embodiment. Is made.
- FIG. 33 is a schematic diagram of the contents of the file system at the time of automatic content disposal according to the third embodiment.
- 3310 is a schematic diagram before the automatic content discarding is performed
- 3320 is a schematic diagram after the automatic content discarding is performed.
- the presentation nodes 3 3 1 1 b and 3 3 1 1 c, 3 3 1 2 b and 3 3 1 2 c Is deleted.
- entities 3 3 1 3 b and 3 3 13 c are deleted from only one entity layer 3 3 13.
- FIG. 34 shows an example of a data structure at the time of automatic content disposal in the third embodiment.
- the presentation table 340, the presentation table 324, the entity table 340, and the storage heap 340 correspond to the schematic diagram 331 of FIG.
- the presentation table 340, the presentation table 340, the entity table 340, and the accumulation heap 340 correspond to the schematic diagram 332 of FIG.
- FIG. 35 is an explanatory diagram of a processing flow chart at the time of automatic content discarding in the third embodiment, and 350 is a processing flowchart of a storage change unit at the time of automatic content discarding.
- the flow chart 3500 is similar to the flow chart 1500 of the automatic disposal processing in the first embodiment. Therefore, in the flowchart 350, the same reference numerals are given to steps having the same contents as those in the flowchart 150.
- Step 1506 is changed to be processed for all users. More specifically, Step 351 and Step 352 are added so that Step 156 is repeatedly executed by the number of users. However, in step 1506 The presentation table shown is the user currently selected in step 3510.
- the processing relating to the presentation table is only step 1506, and the processing of these steps does not affect other steps. For this reason, it has been extended to perform processing for all presentation tables that exist for the number of users.
- FIG. 36 is a schematic diagram of the contents of the file system when the user copies the contents according to the third embodiment.
- Reference numeral 3610 is a schematic diagram before the content is copied by the user.
- Reference numeral 3652 is a schematic diagram after the content is copied by the user.
- a presentation node 3611c is generated by copying the presentation node 3611b in the presentation layer 3611 corresponding to the first user.
- the entity 36 13 c is generated by copying the entity 36 13 b.
- the presentation node 3612b is not copied. That is, the copy by the first user does not affect the presentation layer of the second user.
- the presentation node 3622c is generated by copying the presentation node 3622b in the presentation layer 3622 corresponding to the second user.
- the entity 3 6 2 3 d is generated by copying the entity 3 6 2 3 b, where the entity 3 6 2 3 c created by the copy of the first user, Entities 3623d created by copies of the second user are all copies of the common entity 3623b, but are different. That is, there can be multiple copies of entity 3623b in one entity layer 3623.
- FIG. 37 shows an example of a data structure when a content is copied by a user in the third embodiment.
- the presentation table 370, the presentation table 370, the entity table 370, and the accumulated heap 370 correspond to the schematic diagram 370 in FIG.
- the presentation table 375, the presentation table 370, the entity table 370, and the accumulation heap 378 0 correspond to the schematic diagram 3602 in FIG.
- the flowchart 1900 of FIG. 19 (a) in the second embodiment can be used as it is. This is processing for. This is intended to maintain consistency with the entity layer, even though the presentation layer will be changed. On the other hand, the copying of the content by the user is based on the presentation layer (or
- the deletion of content by a user in the third embodiment capable of processing a plurality of users.
- the content to be deleted is not created by the user by copying.
- FIG. 38 is a schematic diagram of the contents of the file system when the content is deleted by the user according to the third embodiment.
- FIG. 3810 is a schematic diagram before the content is deleted by the user.
- 380 is a schematic diagram after the content is deleted by the user.
- the first user corresponding to the presentation layer 3811 deletes the content corresponding to the presentation node 3811a, resulting in a schematic diagram 3820 .
- the presentation node 3812a that is, 3822a
- the presentation layer 3812 corresponding to the second user corresponding to the content to be deleted is not deleted. That is, the deletion by the first user does not affect the presentation layer 3812 (ie, 3822) corresponding to the second user.
- FIG. 39 is an example of a data structure when content is deleted by a user in the third embodiment.
- Presentation table 3910, presentation table 3920, entity table 3930, and accumulated heap 3940 correspond to the schematic diagram 3810 in FIG.
- presentation table 3950, presentation table 3960, entity table 3970, and accumulated heap 3980 correspond to the schematic diagram 3820 in FIG.
- the flowchart 2400 in FIG. 24 in the second embodiment can be used as it is. This is because the deletion of content by the user is an operation for each user's individual presentation layer, similar to the copying by the user.
- FIG. 40 is a schematic diagram of the contents of the file system when the copied content is deleted by the user according to the third embodiment.
- 4010 is a schematic diagram before the copied content is deleted by the user.
- 4020 is a schematic diagram after the deletion is performed.
- the schematic diagram 4010 in the presentation layer 4011 of the first user, the content corresponding to the presentation node 40 lie is deleted by the first user, and the state shown in the schematic diagram 4020 is obtained.
- the entity 4013 c is deleted together with the presentation node 401 1 c.
- Entity 4013 c and entity 4013 d are both generated by copying entity 4013 b, but deleting entity 4013 c does not affect the existence of entity 4013 d.
- FIG. 41 shows an example of the data structure when the user deletes the copied content according to the third embodiment.
- the presentation table 4110, the presentation table 4120, the entity table 4130, and the storage heap 4140 correspond to the schematic diagram 4010 in FIG.
- the presentation table 4150, the presentation table 4160, the entity table 4170, and the storage heap 4180 correspond to the schematic diagram 4020 in FIG.
- a presentation layer for storing information for each user is provided independently for each user, and one entity layer to be controlled from broadcasting is provided.
- one entity layer to be controlled from broadcasting is provided.
- different stored contents can be retained for each user, and further, content can be deleted or copied independently for each user.
- there is only one entity layer only one byte sequence of the entity of the content controlled from the broadcast is stored in the entity layer of the file system. In comparison, in processing such as addition and update of content from a broadcast and automatic deletion, not only effective use of storage capacity but also processing speed and power consumption are advantageous.
- the fourth embodiment has a filtering function for changing the content to be stored according to each user's preference, in comparison with any one of the first, second, and third embodiments.
- the broadcast system according to the fourth embodiment is characterized in that, in addition to the features of the broadcast system according to the first, second, and third embodiments, when the content identification, the path name, the filter information, and the entity of the content are received.
- Step 1 of storing the received entity in the entity layer, determining whether the received filter information matches the user profile, and terminating if the user profile does not match, and Step 1 having the received path name in the presentation layer.
- the content finolators 0 1 3 3 of the receiving apparatus 0 1 3 0 determine which user's user profile matches each content sent from the receiving means 0 1 3 1. The result is output to the accumulation changing means 0 1 3 4 as a filter matching table.
- FIG. 42 is an explanatory diagram of a filter matching table according to the fourth embodiment, and 420 is an example of a filter matching table.
- FIG. 43 is an example of a transmission content table for adding content according to the fourth embodiment, and 430 is the entire transmission content table.
- column 4315 “Filter information” is added in the transmission content table 4310.
- the filter information is the same as that described in the first embodiment.
- the filter adaptation table 4210 is included in the output of the content filtering means 0133 when the received transmission content table 4310 is input to the content filtering means 1133.
- the filter matching table 4210 is obtained by judging whether or not to accumulate in the unit of content by matching the filter information given to each content of the transmission content table 4310 with the user profile for each user. .
- the filter matching table 4210 has a tabular data structure, and each row corresponds to one transmitted content, and at the same time, corresponds to each row of the transmitted content table 4310.
- the filter matching table 4 210 has a column 4 2 1 1 for storing the content id and a column 4 2 1 2 for storing the matching result, and the column 4 2 1 2 further includes a column corresponding to each user. It is composed of 4 2 1 3 and 4 2 1 4.
- column 4 2 1 2 of the matching result of user 1 S “Y es J” means that the content id of “0 6 0 2 0 0 1”
- Information 4 3 1 5a indicates that User 1's user profile has been met.
- the fact that the column 4 2 13 of the matching result of the user 2 is “No” indicates that the filtering information 4 3 15 a of the content having the content id “0 6 0 0 0 1” includes the user. Indicates that the second user profile did not match.
- looking at row 4 210 b indicates that the content was suitable for both user 1 and user 2. Also, looking at row 4201c indicates that the content did not match either User 1 or User 2.
- the storage changing means 0134 when the transmission content table 4310 and the filter adaptation table 4210 are input, the storage changing means 0134 The processing will be described using a specific example.
- FIG. 44 is a schematic diagram of the contents of the file system when adding contents according to the fourth embodiment.
- Schematic diagram 4 4 10 shows the file system before processing transmission content table 4 310.
- Schematic diagram 4420 shows the contents of the file system after processing the transmission content table 4310.
- the entities 4423a, 4423b, and 4423c are added in the entity layer 4423, and the presentation nodes 4421a and 4421b are added in the presentation layer 4421 of the first user.
- a presentation node 4 422a is added in the presentation layer 4421.
- FIG. 45 shows an example of a data structure when adding content according to the fourth embodiment.
- Figure 45 corresponds to Figure 44.
- FIG. 46 is an explanatory diagram of a processing flowchart of the accumulation changing means at the time of receiving the content table in the fourth embodiment, and reference numeral 4600 denotes the entire flowchart.
- Flowcharts 4 600 is similar to the flowchart 2900 in the third embodiment. The difference is that Step 4610 and Step 4620 are added.
- step 4610 when the content is added to the presentation table, the user selected in step 2910 executes step 0960 in which the user is added to the presentation table only when the user matches with the matching result of the matching table. is there.
- Step 4620 is added to Step 0990 for updating the presentation table.
- step 0900 When the row 4310a of the transmission content table 4310 is selected in step 0900, since the content of the content item “0602001” is not stored, the process proceeds to step 0940 in step 0930.
- step 2910 user 1 is selected, and in step 4610, since the item 4213a of the matching result of user 1 in the filter matching table 4210 is Yes, the process proceeds to step 0960, where the row 4550a is added to the presentation table 4550.
- step 2910 user 2 is selected in step 2910, and in step 4610, since the item 4214 a of the matching result of user 2 in the filter matching table 4210 is N 0, the process does not proceed to step 0960 but returns to step 2910.
- User 2 presentation table No line is added at 4560.
- the user profile can be changed not only when setting a user profile when adding a new user, but also when a user profile has already been set for a registered user, and the content is filtered and stored based on the user profile. It may be generated even in the state where the operation is performed.
- FIG. 47 is an explanatory diagram of a processing flow at the time of changing a user profile in the fourth embodiment.
- Reference numeral 470 denotes a processing flow of the accumulation changing means 0134.
- Step 4710 Initialize the presentation table corresponding to the user whose user profile has been changed. That is, all the rows of the presentation table are deleted. In a schematic diagram, this means deleting all presentation nodes in the presentation layer corresponding to the user of interest.
- Step 4720 Select one row at a time from the entity table.
- Step 4730 If there are no more rows to be selected in step 4730, the process ends. Otherwise, go to step 4740.
- Step 4740 The matching between the filtering information stored in the row selected in Step 4720 of the entity table and the user profile of the user of interest is determined.
- Step 4750 If it is determined in step 4740 that it is compatible, the process proceeds to step 4760. Otherwise, return to step 4720.
- Step 4760 The content corresponding to the row selected in step 4720 of the entity table is added to the presentation table of the user of interest. Then, the process returns to step 4720.
- the content is stored in the entity layer.
- the content is stored in the entity layer.
- the content does not conform to any user's user profile before the user profile is changed, there is no presentation node in the presentation layer, but it exists in the entity layer. For this reason, all the contents included in the received transmission content table are stored in the entity layer except for the automatic deletion, and the content of the entity layer can immediately follow the change of the user profile.
- the fourth embodiment in addition to the effects of the first, second, and third embodiments, only the content that matches the user's preference is automatically selected, and for each user, Suitable content can be stored.
- the reflection of the user's preference is realized by generating a presentation node for content that matches the preference in the presentation layer.
- the user's preferences are stored in the receiving device in advance as a user profile. However, when the user profile is changed, the content that does not conform to the previous user profile but conforms to the new user profile is used. Is quickly accumulated for the user without waiting for the content to be received again.
- the change of the user profile is also performed when a new user is registered, after registering the new user, the content is quickly accumulated without waiting for the reception of the content again, and the content can be viewed immediately. . Furthermore, after the accumulation of the pile of entities for which a real-time system is required in the processing time is completed, it can be determined whether or not the content matches the user's preference. For this reason, the processing load at the time of reception is minimized, and it is possible to minimize the loss of contents and the effect on other processing. In addition, it is also possible to handle a process with a large load and a long processing time as a process for determining whether or not the user's preference is met.
- the receiving and storing apparatus of the present invention is basically a receiving and storing apparatus for receiving and storing at least the content and the content ID for identifying the content transmitted from the transmitting apparatus.
- the path name corresponding to the content and the content ID is stored, and the path name is transmitted from the transmitting device or generated by the receiving and storing device, and is provided to the user of the receiving and storing device. It is a receiving and storing device that can be presented and can be changed based on user instructions.
- the transmitting device of the present invention is the transmitting device 0110 (see FIG. 1) in the above-described embodiment.
- the transmission device of the present invention is, in short, a transmission device for transmitting at least content and a content ID for identifying the content, and transmitting the transmitted content and content ID.
- a path name corresponding to the content and the content ID is stored in the receiving and storing apparatus for receiving and storing, and the path name is transmitted from the transmitting apparatus or generated by the receiving and storing apparatus.
- the transmitting device can be presented to the user on the receiving and storing device side and can be changed based on the user's instruction.
- the broadcasting system of the present invention is the broadcasting system 0100 (see FIG. 1) in the above-described embodiment.
- the broadcasting system of the present invention is not limited to this.
- the broadcasting system of the present invention receives at least a transmission device for transmitting a content and a content ID for identifying the content, and receives and accumulates the transmitted content and the content ID. And a path name corresponding to the content and the content ID, and the path name is transmitted from the transmitting device or received by the receiving and storing device.
- This is a broadcasting system that is generated and can be presented to the user on the receiving and storing apparatus side and can be changed based on the user's instruction.
- the present invention is intended to cause a computer to execute the functions of all or a part of the above-described receiving and storing apparatus, transmitting apparatus, and broadcasting system (or apparatus, elements, circuits, units, and the like) of the present invention.
- Program that operates in cooperation with a computer.
- the computer of the present invention is not limited to pure hardware such as a CPU, but also includes firmware, os, and peripherals. May be used.
- the present invention also provides a program for causing a computer to execute all or some of the steps (or steps, operations, functions, and the like) of the above-described receiving and storing method, transmitting method, and broadcasting method of the present invention. It is a program that works in cooperation with a computer.
- some means (or devices, elements, circuits, units, and the like) of the present invention, and steps (or steps, operations, actions, and the like) of the present invention are described by a plurality of these means or steps. Means some means or steps within, or some function or some operation within one means or step. Further, some devices (or elements, circuits, units, and the like) of the present invention mean some of the plurality of devices, or some of the means (one of the three devices). Or, an element, a circuit, a part, etc.), or a part of the functions of one means.
- a computer-readable recording medium on which the program of the present invention is recorded is also included in the present invention.
- One use form of the program of the present invention may be a form in which the program is recorded on a recording medium readable by a computer and operates in cooperation with a computer.
- One use form of the program of the present invention may be a form in which the program is transmitted through a transmission medium, read by a computer, and operates in cooperation with the computer.
- the recording medium includes ROM and the like, and the transmission medium includes transmission media such as the Internet, light and radio waves, and sound waves.
- the present invention is a medium that carries a program for causing a computer to execute all or some of the steps of all or some of the above-described receiving and storing apparatus, transmitting apparatus, and broadcasting system of the present invention.
- the program is a medium readable and read by a computer, and executes the operation in cooperation with the computer.
- the present invention also provides a computer that executes all or a part of the functions of all or some of the above-described receiving and storing method, transmitting method, and broadcasting method of the present invention. And a medium readable by a computer and executing the function in cooperation with the computer.
- the present invention provides, for example, a broadcasting system that controls content stored in a receiving device from a transmitting device side, wherein the receiving device stores and manages the entity of the content identified by the content identification and a path.
- a presentation layer that accumulates and manages a presentation node identified by a name, and adding the received entity to the entity layer when content identification, a path name, and an entity are received; and A step of adding a presentation node having the path name received in the presentation layer and referring to the entity added in the step 1, and a step 2 of adding a presentation node.
- the present invention provides, for example, a broadcasting system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device uses an entity layer and a path name for managing and managing the entity of the content identified by the content identification.
- a presentation layer for storing and managing the identified presentation nodes, and when receiving a content identification, a path name, and an entity, searching for an entity having the content identification received from the entity layer 1 Step 2 of overwriting the entity searched in Step 1 with the received entity; Step 3 of searching the presentation layer for a presentation node referencing the entity searched in Step 1; and A step 4 of overwriting the path name of the presentation node retrieved in 3 with the path name received. It is a logical method.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name. And a presentation layer for storing and managing presentation nodes to be stored, and when receiving a content identification, a path name, and an entity, a step 1 for searching for an entity having the content identification received from the entity layer. If the search is successful in step 1, step 2 proceeds to step 5, step 3 of adding the received entity to the entity layer, and step 3 having the path name received in the presentation layer.
- Step 4 of adding and ending the search step 5 of overwriting the entity retrieved in step 1 with the received entity, and referring to the entity retrieved in step 1 from the presentation layer.
- step 6 a step of overwriting the path name of the presentation node searched in step 6 with the received path name. is there.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name. And a presentation layer that accumulates and manages presentation nodes having an automatic deletion time limit.
- This is a storage management method characterized by the following.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name. And a presentation layer that stores and manages the presentation nodes to be set.
- the presentation layer includes a step 1 in which a path name is designated by a user, and a presentation layer having the path name designated in step 1 in the presentation layer. And a step of deleting the presentation node searched in the step (2).
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name. And a presentation layer that stores and manages the presentation nodes to be set.
- the presentation layer includes a step 1 in which a path name is designated by a user, and a presentation layer having the path name designated in step 1 in the presentation layer.
- Step 2 to retrieve from the presentation node retrieved in Step 2;
- Step 3 to duplicate the entity referred to from the presentation node retrieved in Step 2;
- Step 4 to set the content identification of the entity duplicated in Step 3 to an invalid value.
- the presentation information retrieved in step 2 A storage management method, comprising: a step 5 of duplicating a mode; and a step 6 of setting the presentation node duplicated in the step 5 to refer to the entity duplicated in the step 3.
- the present invention provides, for example, the above-mentioned present invention, wherein the presenting node has an automatic deletion deadline, and a step of setting the automatic deletion deadline of the entity copied in step 3 to an invalid value before step 5 is added. This is the accumulation management method.
- the present invention provides, for example, in a process of deleting copied content, a step 11 in which a user specifies a path name of the copied content, and a presentation node having the path name specified in step 11 Step 1 2 for searching the presentation layer from the presentation layer, Step 13 for deleting the presentation node searched for in Step 12, and deleting the entity referred to by the presentation node searched for in Step 12
- the storage management method as described above, characterized in that the storage management method has the following steps:
- the present invention provides, for example, in the process of deleting copied content, a step 11 in which a user specifies a path name of the copied content, and a presentation node having the path name specified in step 11 Step 12 for searching from the presentation layer, step 13 for deleting the presentation node searched for in step 12, and content identification of the entity referred to by the presentation node searched for in step 12
- the storage management method according to the above, further comprising a step 14 of ending if valid, and a step 15 of deleting the entity referred to by the presentation node searched in step 12. is there.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name. And a presentation layer for storing and managing the presentation nodes to be stored, and storing the entity received when receiving the content identification, the path name, the filter information, and the entity in the entity layer. Step 2 to determine whether the filter information matches the user profile and terminate if not, and refer to the entity having the path name received in the presentation layer and added in step 1
- This storage management method is characterized by having step 3 of adding a presentation node.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name. And a presentation layer that stores and manages presentation nodes to be executed, and upon receiving a content identification, a path name, filter information, and an entity, searches for an entity having the received content identification from the entity layer.
- Step 1 step 2 of overwriting the entity searched in step 1 with the received entity, step 3 of searching for a presentation node corresponding to the entity searched in step 1, and step 3 Step 4 is to judge whether the filter information and the user file match, and if there is a match, proceed to step 6;
- a storage step characterized by comprising: a step of ending by deleting the searched presentation node; and a step of overwriting the path name of the presentation node searched in step 3 with the received path name. It is a management method.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side. And a presentation layer that stores and manages presentation nodes to be executed, and upon receiving a content identification, a path name, filter information, and an entity, searches for an entity having the received content identification from the entity layer.
- Step 1 Step 2 to proceed to Step 6 if the search is successful in Step 1
- Step 3 of adding the received entity to the entity layer, and determining whether the received filter information matches the user profile Step 4 to end if not compatible, and add the path name received in the presentation layer in Step 3
- Step 5 of adding and presenting a presentation node that refers to the entity, and overwriting the entity retrieved in Step 1 with the received entity; Step 6 from the presentation layer.
- Step 7 for searching for a presentation node that refers to the entity searched for in step 7
- step 8 for determining whether the received filter information matches the user profile, and proceeding to step 10 if matching is found
- Step 9 of ending by deleting the presentation node retrieved in Step 7 and ending
- Step 10 of overwriting the path name of the presentation node retrieved in Step 7 with the received path name
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a transmitting device side, wherein the receiving device identifies the entity of the content identified by the content identification with an entity layer for storing and managing the entity of the content by a path name.
- step 2 of deleting all the presentation nodes of the presentation layer
- step 3 of selecting each entity one by one from all the entities of the entity layer
- filter information of the entity selected in step 3 Determining whether the user profile matches the user profile, and returning to step 3 if the user profile does not match.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name.
- a presentation layer for each user that accumulates and manages presentation nodes to be stored, and a step 1 of adding the received entity to the entity layer when content identification, a path name, and an entity are received, Step 2 of sequentially selecting one user from one user at a time, and a presentation node having the path name received in the presentation layer corresponding to the user selected in step 2 and referring to the entity added in step 1 is added. And returning to step 2.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name.
- a presentation layer for each user that accumulates and manages presentation nodes to be provided, and when receiving a content identification, a path name, and an entity, searches for an entity having the received content identification from the entity layer.
- Step 1 step 2 of overwriting the entity searched in step 1 with the received entity, step 3 of sequentially selecting one user at a time from all users, and corresponding to the user selected in step 2.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name. And a presentation layer for each user that accumulates and manages the presentation nodes to be performed. When the content identification, the path name, and the entity are received, an entity having the content identification received from the entity layer is searched.
- Step 1 Step 2 to proceed to Step 6 if the search fails in Step 1
- Step 3 to add the received entity to the entity layer
- Step 4 to select one user at a time from all users,
- Step 5 to add a presentation node that refers to and return to Step 4
- Step 6 to overwrite the entity searched in Step 1 with the received entity, and select one user at a time from all users Step 7, searching the presentation layer corresponding to the user selected in step 7 for a presentation node referencing the entity searched in step 1; and the presentation searched in step 8
- the present invention provides, for example, a broadcasting system in which a receiving device controls content stored in a receiving device from a transmitting device side. And a presentation layer for each user that accumulates and manages presentation nodes having an automatic deletion time limit. Step 1 of searching for an entity whose automatic deletion time limit has expired from the entity layer; Step 2 for deleting the searched entity, Step 3 for selecting one user at a time from all users, and a presentation node referring to the entity searched for in Step 1 corresponding to the user selected in Step 3 Step 4 of searching from the presentation layer to be performed, and Step 5 of deleting the presentation node searched in Step 4 and returning to Step 3. And a storage management method.
- the present invention provides, for example, In the broadcast system controlled from the side, the receiving device includes an entity layer for storing and managing the entity of the content identified by the content identification and a presentation layer for each user for storing and managing the presentation node identified by the path name.
- Step 1 in which a path name is specified by a specific user;
- Step 2 of searching for a presentation node having the path name specified in Step 1 from the presentation layer corresponding to the specific user; And a step of deleting the presentation node searched in step 2.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name.
- a presentation layer for each user that accumulates and manages the presentation nodes to be provided, wherein a step 1 in which a path name is specified by a specific user, and a presentation node having the path name specified in the step 1 are performed.
- Step 2 of searching from the presentation layer of the specific user step 3 of duplicating the entity referred to by the presentation node retrieved in step 2, and invalid value of the content identification of the entity duplicated in step 3
- a step 5 of duplicating the presentation node retrieved in step 2 in the presentation layer of the specific user A storage management method characterized by a step 6 to set to reference replicated by entities presented node was replicated in the step 5 in the step 3.
- the present invention provides, for example, the above-described present invention, wherein the presenting node has an automatic deletion deadline, and a step of setting the automatic deletion deadline of the entity copied in step 3 to an invalid value before step 5 is added. This is the accumulation management method.
- the present invention provides, for example, in a process of deleting copied content, a step 11 in which a specific user specifies a path name of the copied content, and a presentation node having the path name specified in step 11 From the presentation layer of the specific user, step 13 to delete the presentation node retrieved in step 12, and reference to the presentation node retrieved in step 12
- the storage management method described above is characterized in that it has a step 14 of deleting the entity that has existed.
- the present invention provides, for example, in a process of deleting copied content, a step 11 in which a specific user specifies a path name of the copied content, and a presentation node having the path name specified in step 11 From the presentation layer of the specific user, step 13 to delete the presentation node retrieved in step 12, and entity referred to by the presentation node retrieved in step 12
- the storage management described above comprising: a step 14 of ending if the content identification of the presentation node is valid; and a step 15 of deleting the entity referred to by the presentation node searched in the step 12. Is the way.
- the present invention provides, for example, a broadcasting system in which a receiving device controls content stored in a receiving device from a transmitting device side.
- a presentation layer for each user that accumulates and manages the presentation nodes to be executed, and stores the entity received when receiving the content identification, the path name, the filter information, and the entity in the entity layer.
- step 2 of sequentially selecting one user at a time from all users. Determining whether the received filter information matches the user profile file corresponding to the user selected in step 2 and returning to step 2 if the user information does not match.
- Step 3; and having the path name received by the presentation layer corresponding to the user selected in Step 2 A storage management method characterized by Tsu add the presentation nodes that reference the entity added in STEP 1 and a step 4 back to the scan Tetsupu 2.
- the present invention provides, for example, a broadcast system in which a content stored in a receiving device is stored from a sending device side, wherein the receiving device identifies the entity of the content identified by the content identification by an entity layer for storing and managing the entity of the content by a path name. And a presentation layer for each user that stores and manages the presentation nodes to be executed. The entity having the content identification received from the entity layer when the content identification, the path name, the filter information, and the entity are received.
- the present invention provides, for example, a broadcasting system in which a transmitting device controls content stored in a receiving device from a transmitting device side, wherein the receiving device identifies the entity identified by the content identification by an entity layer that stores and manages the entity of the content by a path name.
- Entity that has a presentation layer for each user that stores and manages the presentation nodes to be executed, and has the content identification received from the entity layer when receiving the content identification, the path name, the filter information, and the entity.
- Step 6 of adding a presentation node to be referred to and returning to Step 3 Step 7 of overwriting the entity retrieved in Step 1 with the received entity, and Step of selecting one user at a time from all users.
- Step 8 searching the presentation layer corresponding to the user selected in step 8 for a presentation node that refers to the entity searched in step 1; receiving the filter information and the step 8 Step 10 is performed to determine the conformity with the user profile corresponding to the user selected in step 10 and proceed to step 12 when the conformity is found, and the check is performed in step 9 above.
- Step 11 to delete the presented presentation node and return to Step 8, and Step 12 to overwrite the path name of the presentation node retrieved in Step 9 with the received path name and return to Step 8. It is a storage management method characterized by having:
- the present invention provides, for example, a broadcasting system in which a content stored in a receiving device is stored from a transmitting device side, wherein the receiving device is identified by content identification. And a presentation layer for each user that stores and manages a presentation node identified by a path name.
- Step 2 of deleting all the presentation nodes of the presentation layer corresponding to a specific user, Step 3 of selecting each entity one by one from all the entities of the substance layer, and Step 4 of selecting one user at a time from all users And if there is no more user to select in step 4, return to step 3; step 5: matching the filter information of the entity selected in step 3 with the user profile of the user selected in step 4 And returning to step 4 if it does not match, and the path received by the presentation layer of the user selected in step 4
- the Hold add ⁇ presentation nodes that reference the entity selected in step 3 is the accumulation management method characterized by a step 7 which returns to Step 4.
- the present invention is, for example, a receiving device in a broadcasting system that controls content stored in the receiving device from the sending device side, and is a receiving device for performing the above-described storage management method.
- the present invention is, for example, a broadcasting system for controlling content stored in a receiving device from a transmitting device side, wherein the transmitting device assigns a path name to the content and transmits the content, and implements the above-described storage management method.
- the present invention is, for example, a broadcast system that controls content stored in a receiving device from a transmitting device side, wherein the transmitting device adds a path name and filter information to the content and transmits the content, and the receiving device transmits the content.
- This is a broadcasting system for implementing the storage management method described above.
- the present invention is, for example, a transmitting device in a broadcasting system for implementing the above-mentioned storage management method.
- the present invention has an advantage that broadcast contents can be more appropriately stored and managed.
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01934518A EP1288781A4 (en) | 2000-06-05 | 2001-06-04 | RECEIVING / STORING DEVICE, TRANSMITTING DEVICE, BROADCASTING SYSTEM, RECEIVING / STORING METHOD, TRANSMITTING METHOD, BROADCASTING METHOD, PROGRAM AND MEDIUM |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2000-167260 | 2000-06-05 | ||
JP2000167260A JP2001344204A (ja) | 2000-06-05 | 2000-06-05 | 蓄積管理方法およびそれを実現した受信装置および放送システム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2001095112A1 true WO2001095112A1 (fr) | 2001-12-13 |
Family
ID=18670438
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2001/004692 WO2001095112A1 (fr) | 2000-06-05 | 2001-06-04 | Dispositif de reception/stockage, dispositif d'emission, systeme de diffusion, procede de reception/stockage, procede d'emission, procede de diffusion, programme et support |
Country Status (6)
Country | Link |
---|---|
US (1) | US20030031186A1 (ja) |
EP (1) | EP1288781A4 (ja) |
JP (1) | JP2001344204A (ja) |
KR (1) | KR100611876B1 (ja) |
CN (1) | CN1296829C (ja) |
WO (1) | WO2001095112A1 (ja) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
SG94350A1 (en) * | 1999-10-21 | 2003-02-18 | Matsushita Electric Ind Co Ltd | Control content transmission method and storage-based broadcasting system |
US20040133923A1 (en) * | 2002-08-21 | 2004-07-08 | Watson Scott F. | Digital home movie library |
EP3024224A1 (en) * | 2002-08-29 | 2016-05-25 | OpenTV, Inc. | Video on demand and targeted advertising |
KR100749202B1 (ko) * | 2005-08-17 | 2007-08-13 | 에스케이 텔레콤주식회사 | 축적 방송 컨텐츠 생성 장치 |
KR100707946B1 (ko) | 2005-09-08 | 2007-04-13 | 최상기 | 동일 방송콘텐츠를 공유하는 웹하드디스크 서버 및다운로드 방법 |
KR101380048B1 (ko) * | 2006-12-12 | 2014-04-02 | 삼성전자주식회사 | 방송 컨텐츠 정보 제공 시스템 및 그 시스템에서의 방송서비스 방법 |
JP2011254264A (ja) * | 2010-06-01 | 2011-12-15 | Jvc Kenwood Corp | 放送受信記録装置、放送受信記録方法及びプログラム |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH03118646A (ja) * | 1989-09-29 | 1991-05-21 | Mitsubishi Electric Corp | ユーザファイル管理方法 |
Family Cites Families (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA1341310C (en) * | 1988-07-15 | 2001-10-23 | Robert Filepp | Interactive computer network and method of operation |
US5426747A (en) * | 1991-03-22 | 1995-06-20 | Object Design, Inc. | Method and apparatus for virtual memory mapping and transaction management in an object-oriented database system |
JPH06290096A (ja) * | 1993-03-31 | 1994-10-18 | Matsushita Electric Ind Co Ltd | パス名解決装置 |
US5884028A (en) * | 1994-07-29 | 1999-03-16 | International Business Machines Corporation | System for the management of multiple time-critical data streams |
US5715516A (en) * | 1995-10-18 | 1998-02-03 | Cellular Telecom, Ltd. | Method and apparatus for wireless communication employing collector arrays |
DE29604608U1 (de) * | 1996-03-12 | 1996-05-02 | Mayr Christian Gmbh & Co Kg | Drehsteife, biegeelastische Wellenkupplung, insbesondere aus Ganzstahl |
US5903816A (en) * | 1996-07-01 | 1999-05-11 | Thomson Consumer Electronics, Inc. | Interactive television system and method for displaying web-like stills with hyperlinks |
US6049333A (en) * | 1996-09-03 | 2000-04-11 | Time Warner Entertainment Company, L.P. | System and method for providing an event database in a telecasting system |
US5892915A (en) * | 1997-04-25 | 1999-04-06 | Emc Corporation | System having client sending edit commands to server during transmission of continuous media from one clip in play list for editing the play list |
US6021419A (en) * | 1997-09-16 | 2000-02-01 | International Business Machines Corporation | System for filtering broadcast digital information in accordance with channel identifiers stored in preference list which can be dynamically updated via command through network |
JP3810530B2 (ja) * | 1997-09-18 | 2006-08-16 | 富士通株式会社 | ビデオサーバシステム、コンテンツ動的配置装置及びコンテンツ動的配置方法 |
JPH11175489A (ja) * | 1997-12-16 | 1999-07-02 | Toshiba Corp | 迂回通知による障害通知方式 |
US6128717A (en) * | 1998-01-20 | 2000-10-03 | Quantum Corporation | Method and apparatus for storage application programming interface for digital mass storage and retrieval based upon data object type or size and characteristics of the data storage device |
JP3361997B2 (ja) * | 1998-05-07 | 2003-01-07 | 松下電器産業株式会社 | 放送送信装置及び放送送信方法 |
KR100640117B1 (ko) * | 1998-06-30 | 2006-10-31 | 도꾜 브로드캐스팅 시스템, 인크. | 디지탈 방송 서비스에 이용되는 단말 장치 및 이것을 제어하는 방법 및 방송 장치 |
US6327608B1 (en) * | 1998-09-25 | 2001-12-04 | Microsoft Corporation | Server administration tool using remote file browser |
US6209024B1 (en) * | 1999-04-05 | 2001-03-27 | Diva Systems Corporation | Method and apparatus for accessing an array of data storage devices by selectively assigning users to groups of users |
US6901438B1 (en) * | 1999-11-12 | 2005-05-31 | Bmc Software | System selects a best-fit form or URL in an originating web page as a target URL for replaying a predefined path through the internet |
US8312490B2 (en) * | 2000-03-23 | 2012-11-13 | The Directv Group, Inc. | DVR with enhanced functionality |
US6671733B1 (en) * | 2000-03-24 | 2003-12-30 | International Business Machines Corporation | Internal parallel system channel |
US6976090B2 (en) * | 2000-04-20 | 2005-12-13 | Actona Technologies Ltd. | Differentiated content and application delivery via internet |
US6327628B1 (en) * | 2000-05-19 | 2001-12-04 | Epicentric, Inc. | Portal server that provides a customizable user Interface for access to computer networks |
US20020103907A1 (en) * | 2000-06-20 | 2002-08-01 | Erik Petersen | System and method of storing data to a recording medium |
US6493733B1 (en) * | 2000-06-23 | 2002-12-10 | Microsoft Corporation | Method for inserting interactive HTML objects into an electronic file |
US6618795B2 (en) * | 2001-01-24 | 2003-09-09 | Sony Corporation | Method and apparatus for concurrent access to a sequential device |
WO2002065329A1 (en) * | 2001-02-14 | 2002-08-22 | The Escher Group, Ltd. | Peer-to peer enterprise storage |
US20020176418A1 (en) * | 2001-04-19 | 2002-11-28 | Russell Hunt | Systems and methods for producing files for streaming from a content file |
US7096338B2 (en) * | 2004-08-30 | 2006-08-22 | Hitachi, Ltd. | Storage system and data relocation control device |
-
2000
- 2000-06-05 JP JP2000167260A patent/JP2001344204A/ja not_active Withdrawn
-
2001
- 2001-06-04 WO PCT/JP2001/004692 patent/WO2001095112A1/ja active Application Filing
- 2001-06-04 CN CNB018022685A patent/CN1296829C/zh not_active Expired - Fee Related
- 2001-06-04 KR KR1020027001561A patent/KR100611876B1/ko not_active IP Right Cessation
- 2001-06-04 EP EP01934518A patent/EP1288781A4/en not_active Withdrawn
- 2001-06-04 US US10/048,918 patent/US20030031186A1/en not_active Abandoned
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH03118646A (ja) * | 1989-09-29 | 1991-05-21 | Mitsubishi Electric Corp | ユーザファイル管理方法 |
Non-Patent Citations (2)
Title |
---|
OGAWA ET AL.: "IE 4.0 tettei katsuyou no know how", SUPER ASCII, vol. 8, no. 11, 1 November 1997 (1997-11-01), pages 101 - 129, XP002946924 * |
TSUYANO SHODA: "Mac the doujo alias de chou-benri na sousa kankyou wo tsukurou", MAC POWER, vol. 5, no. 5, 1 May 1994 (1994-05-01), pages 198 - 203, XP002946925 * |
Also Published As
Publication number | Publication date |
---|---|
CN1296829C (zh) | 2007-01-24 |
CN1386225A (zh) | 2002-12-18 |
EP1288781A1 (en) | 2003-03-05 |
JP2001344204A (ja) | 2001-12-14 |
EP1288781A4 (en) | 2003-07-02 |
KR20020022093A (ko) | 2002-03-23 |
US20030031186A1 (en) | 2003-02-13 |
KR100611876B1 (ko) | 2006-08-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP3361997B2 (ja) | 放送送信装置及び放送送信方法 | |
US8233775B2 (en) | Information processing system, portable information terminal apparatus, information processing method, program information providing apparatus, program information providing method, recording/reproducing apparatus, recording/reproducing method, computer-program storage medium, and computer program | |
US8549559B2 (en) | Information processing apparatus and information processing method, and program | |
US7627881B1 (en) | Transmitting apparatus and receiving apparatus | |
US20120201507A1 (en) | Portable information terminal apparatus, information processing method, computer-program storage medium | |
KR100862354B1 (ko) | 비동기 검색 환경을 지원하는 멀티미디어 검색 방법 | |
JP2005243012A (ja) | メタデータのインデックスの提供方法 | |
JPH1098508A (ja) | サイクリックパケットデータ伝送システムの受信機 | |
JP2005174332A (ja) | マークアップランゲージ基盤のデータ管理方法とその装置及び記録媒体 | |
WO2000052600A1 (fr) | Emetteur, recepteur, systeme d'emetteur/recepteur, procede de transmission et procede de reception | |
KR100477844B1 (ko) | 화일 관리 방법, 콘텐츠 재생 방법, 콘텐츠 기록/재생 장치, 및 콘텐츠 재생 프로그램을 기록한 기록 매체 | |
US8051449B2 (en) | Portable information terminal apparatus, information processing method, computer-program storage medium, and computer-program | |
WO2000072574A2 (en) | An architecture for controlling the flow and transformation of multimedia data | |
CN100391266C (zh) | 数字视频记录器和数字记录方法 | |
WO2001095112A1 (fr) | Dispositif de reception/stockage, dispositif d'emission, systeme de diffusion, procede de reception/stockage, procede d'emission, procede de diffusion, programme et support | |
US20060218248A1 (en) | Contents distribution system, contents distribution method, and computer-readable storage medium therefor | |
EP1244309A1 (en) | A method and microprocessor system for forming an output data stream comprising metadata | |
JP4156032B2 (ja) | ディジタルテレビジョン伝送システムにおけるデータの索引付け方法 | |
JP2004129199A (ja) | 情報マテリアル作成システム及び方法 | |
JP5075723B2 (ja) | メタデータ編集システムおよびメタデータ編集プログラムならびにメタデータ編集方法 | |
WO2002003690A1 (fr) | Appareil pour informations video numeriques | |
JP4201074B2 (ja) | デジタルデータ送受信システムおよびその方法 | |
JP2001211431A (ja) | 送信装置、受信装置、送受信システム、送信方法、および受信方法 | |
US20060247809A1 (en) | Data display control device | |
JP2002051296A (ja) | 放送記録再生装置および方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CN KR SG US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001934518 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020027001561 Country of ref document: KR |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 1020027001561 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 018022685 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10048918 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2001934518 Country of ref document: EP |