JPH11282867A - Data distribution system and duplicate data detection system - Google Patents

Abstract

(57) [Summary] [Problem] Problems when distributing digitized data to users 1) Waiting time increases when data capacity increases 2) Prevents unauthorized copying of digitized data 3) Data If there are multiple sources, select the best one,
4) so-called browsing becomes difficult, 5) data other than digitized data cannot be used, and 6) searched parts cannot be extracted in appropriate units. A data distribution system according to the present invention includes a data selection device, a data source selection device, a data reception device, and a plurality of data sources connected to the data reception device. According to the selection, the data source selecting device selects specific data from the plurality of data sources according to a specific standard, and the receiving device receives data from the data source.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data distribution system and a duplicated data detection system, and more particularly, to a data distribution system in which distributed data is used in a form such as reproduction by using a device possessed by a user, and to the data distribution system. It relates to a duplicate data detection system used.

[0002]

2. Description of the Related Art Examples of techniques for distributing data using a communication line include those disclosed in Japanese Patent Application Laid-Open Nos. 2-77771 and 5-83948. In this method, digitized book data is downloaded to storage means using a communication line without going through a general bookstore or the like, and is played back using a playback device. More specifically, Japanese Patent Application Laid-Open No. 2-77771 discloses that a search is performed in a database of a data supply unit in response to a request from a data reproduction unit, and the searched data group is transmitted to the data reproduction unit by a communication unit, and the data reproduction is performed. The means stores the transmitted data group and displays the data group for each page based on the user's instruction. As a result, the user can obtain data such as a book through a communication line, and can reproduce the data at a necessary place and time by using the data reproducing means.

[0003] Japanese Patent Publication No. 5-83948 discloses information in which an unspecified number of information purchasers hold information desired to be purchased from a public information sales device installed in a place easily accessible to the public. The user connects to any of the source devices via a communication network and purchases desired information. The settlement of the fee or the confirmation of the identification for guaranteeing the payment of the fee are performed at the time of the contract or establishment of the transaction in the sales device, and the purchaser can immediately obtain the desired information from the sales device. This is expected to promote information distribution.

[0004]

The above-mentioned prior art provides great convenience in distributing digitized data to a user, but has the following problems in actual use. Occurs.

[0005] 1. When the data capacity becomes large, transmission takes time, and the user's waiting time becomes excessive. This poses great difficulties when the target of electronic distribution is expanded to a much larger volume than simple text data, such as pictures such as picture books and photo books, publications containing many illustrations, and even CD albums. . Given that the time it takes for a user to obtain a desired book or the like in a normal sales channel such as a bookstore is usually irrelevant to the content of the publication, electronic distribution can be carried out in a practical manner. It is very important to solve this problem for realization.

[0006] 2. The issue of copyright protection is not considered, and even if a malicious user illegally copies and distributes downloaded data, it cannot be detected. This is a great difference between a paper book that takes a long time to copy and electronic data.

[0007] 3. No consideration is given to the mixture of data sources (information sources) with different communication speeds and methods. As data sources, there are host computers with different processing speeds, memories with different storage capacities, and various communication speeds such as wired, wireless, satellite links, etc., so if there are multiple data sources desired by the user, Therefore, it is necessary to be able to select the optimal one.

[0008] 4. Electronic distribution makes it difficult to examine contents before purchasing, for example, the so-called "browsing" in bookstores. Therefore, if the user is charged uniformly when purchasing the electronic data, the user has to assume that the user has purchased the electronic data but was not interested in actually learning the contents. And users are worried. For example, Japanese Patent Publication No. 6-8519
No. 6 discloses a technology of a software vending machine that shows a user a demonstration at the time of purchasing the software. However, a content such as a book, which generally takes time to know its true value, is disclosed by such a method. It is impossible for the user to know.

[0009] 5. Only data that has already been digitized can be selected. This is obvious, especially when books, such as books, are known to be available in a non-electronic form but in a very large variety of content through regular channels. A small number of users want to use electronic distribution in which only information on the contents can be obtained.

[0010] 6. When retrieving parts where keywords appear in digitized books and other data, the user wants to retrieve not a half-finished unit but a whole unit such as a section or a chapter including a desired part for later. As a matter of course, no search device capable of performing such a task has been known.

The present invention provides a new system which solves the problems of the data distribution system and the duplicated data detection system described above.

[0012]

According to the first aspect of the present invention, there is provided a data distribution system comprising a data selection device, a data source selection device, a data reception device, and a plurality of data connected to the data reception device. A data source, the data source selecting device selecting a data source holding the data according to a specific criterion according to the selection from the data selecting device, and selecting the data source from the data source by the data selecting device. Data received by the data receiving device.

A data distribution system according to a second aspect of the present invention includes a data buffering device, and the data buffering device is a data buffering device that has been selected based on a predetermined criterion from data previously selected by the data selecting device. And the data buffering device is used as one of the plurality of data sources.

In particular, a criterion for selecting data to be buffered in the data buffering device is a capacity or one.
Preferably, it is based on the time taken for one transmission, the selected number, or both. Further, when the free space of the data buffering device is reduced, the capacity or the time required for one transmission, the number of selected times, or the elapsed time since the last selection by the data selecting device is reduced. It is preferable to select data to be erased based on this.

According to a third aspect of the present invention, in the data distribution system, the plurality of data sources repeatedly transmit data in a time-division manner with a time lag. It is characterized in that a data source which has the shortest time until the data selected by the data selection device is transmitted from the data source or the time until it is received by the data reception device is selected.

According to a fourth aspect of the present invention, there is provided a data distribution system comprising: a data selection device; a data reception device;
A data source, wherein the data source repeatedly transmits different data in a time-division manner, and the data source allocates a large transmission time to data frequently selected by the data selection device. And

Here, in the present invention, the data search device comprises a search condition input means, a search means, a storage device, and an output means, and the search means is inputted from the search condition input means. Means paragraphs, sections, chapters, entire books, entire data, etc., including parts that match the search conditions, or meaningful units, or entire albums containing songs with names that match the input search conditions Data is retrieved from the storage device in units
You can search by outputting. Then, the data having the hierarchical structure can be stored by uniformly managing the data indicating the depth level and the existence range.

A data distribution system according to a fifth aspect of the present invention is a data distribution system including a data selection device and a data source, wherein the data source does not include electronic data desired by the user. The electronic data, or non-electronic data having the same or similar contents as the electronic data, is ordered from the data selection device to an organization, individual, or device other than a data source. Here, it is desirable that at least a part of a group, an individual, or a device such as a trader other than the data source should be displayed virtually as a kind of data source by the user.

Further, a duplicated data detection system according to a sixth aspect of the present invention performs a data inspection device, a plurality of data storage devices, and data transmission or transmission between the data inspection device and the data storage device. A duplicate data detection system comprising a data communication device, wherein each of the data storage devices is connected to or integrated with the data communication device at all times or as needed, and each data storage device is in a normal use state. The data communication device transmits the information including the authentication code, which is uniquely provided to the data inspection device, and the information including the authentication code stored in the data storage device. Whether two or more different data storage devices store a common authentication code based on information transmitted from the data communication device, and Inspects whether or not the data has been stored in the past, and if so, any or all of the data storage device storing the authentication code or the data stored in the past is copied. Is determined.

In the duplicated data detection system, when the data communication device transmits information indicating “start of use” together with the authentication code, the authentication code is classified as “in use” by the data inspection device, When the "end of use" information is sent with an authorization code,
Since then, the authorization code has been classified as "not in use",
An authentication code that is classified as "not in use" and classified as "in use" is sent with the "start using" information, or "not in use"
Is determined that two or more different data storage devices store the authentication code when one or both of the authentication codes classified as “1” are transmitted with the information “end of use”. May be used.

Further, in the duplicate data detection system according to the present invention, the data communication device transmits information including the authentication code to the data inspection device in a predetermined timing pattern, and transmits the same authentication code. If the timing at which the information including is sent is deviated from the predetermined pattern, it is determined that the plurality of data storage devices store the same authentication code, and if such determination is made, Is characterized in that it is determined that any or all of the data storage devices storing the authentication code are duplicates.

Further, in the duplicate data detection system according to the present invention, the data inspection device may store another authentication code or another authentication code for the data storage means for which the stored authentication code is known. The data to be generated is transmitted through the data communication device, and the authentication code of the data storage device is directly or indirectly rewritten.Furthermore, the data inspection device thereafter, permanently or within a predetermined period, If a data storage device that transmits information including the same authentication code as the authentication code of the data storage device before rewriting is detected, the plurality of data storage devices store the same authentication code or store the same authentication code in the past. It is determined that the authentication code has been stored, and if it is determined, the data storage device storing the authentication code or storing the authentication code in the past. Re or all and judging that the replication.

Further, in the duplicate data detecting system according to the ninth aspect of the present invention, the data communication device is a part of the data reproducing device, and the data storage device is a data reproducing device in addition to the authentication code. The data reproducing device stores the reproduced data to be reproduced, and the data reproducing device outputs, to the data storage device determined to be a duplicate by the data inspection device, data that is not determined to be the duplicate by the data inspection device. An operation different from the operation for the storage device is performed. A duplicated data detection system according to the present invention includes at least the duplicated data detection system described above and a plurality of data reproducing devices, and the data storage unit stores data reproduced by the data reproducing device in addition to the authentication data. The data communication device is a part of the data reproducing device, and the data reproducing device stops reproducing the data in the data storage unit determined to be a duplicate by the duplicate data detection system. Perform a different operation from the operation performed on the data storage means that is not determined to be a duplicate by the duplicate data detection system in a manner such as setting a limit on a method of reproducing data, displaying a warning message to the user, or the like. Characterized configurations are also possible.

Further, in the duplicated data detection system according to claim 10 of the present invention, the data communication device is a part of a data reproducing device, and the data storage device is a data reproducing device in addition to the authentication code. The reproduced data that is reproduced and updated by the data updating device is stored, and the data updating device determines that the data inspection device has duplicated the data storage device determined to be duplicated by the data inspection device. An operation different from the operation for the data storage device that has not been determined is performed.

Further, a data distribution system according to claim 11 of the present invention comprises a data storage means, a data update device, and a charging device, wherein the data storage means stores data and the date and time of writing by the data update device. Or, the date and time and time are stored, the data updating device writes or rewrites data and fee information in data storage means, and the billing device sets the current date and time or date and time and time,
The charge amount is determined from the date and time of writing the data stored in the data storage unit by the data updating device or the difference between the date and time and the time.

Further, a data distribution system according to a twelfth aspect of the present invention comprises a data storage means, a data update device, and a billing device, wherein the data storage means stores data and the date and time written by the data update device. Or memorize the date and time and time and the charge per unit date and time or hour,
The data update device writes or rewrites data and fee information in data storage means, and the billing device writes the current date and time or date and time and time, and the date and time when the data stored in the data storage device is written by the data update device or The billing amount is determined from the difference between the date and time and the time, and the charge per unit date and time or time.

Further, a data distribution system according to claim 13 of the present invention provides a data storage means, a data use recording device, a data reproduction device, a billing device, and a data use record reading device provided in the billing device. Wherein the data storage means stores data, and the data use recording device includes a time, date, time length, number of times, etc., when the data stored in the data storage means is used by the data reproducing apparatus. And the charging device reads the content recorded in the data usage recording device by the data usage recording reading device to determine the amount to be charged.

The data distribution system according to the present invention comprises at least a billing device, a data updating device, a data reproducing device, a data storage means, and a data update recording device. The storage means mainly stores data to be reproduced by the data reproduction apparatus. The data update apparatus writes or rewrites data in the data storage means, and the data update recording apparatus stores data in the data storage means. The recorded data, the date and time of writing by the data update device, or the time and date and time is recorded, when the data update recording device is connected or set to the data update recording and reading device,
The data update recording / reading device may read information recorded on the data update recording / reading device, and the charging device may determine the amount to be charged based on the content read by the data update recording / reading device.

Further, the data update recording device writes the data update record in a partial area of the data storage device, and therefore, it is the data update device that is actually connected or set to the data update record reading device for charging. Alternatively, a configuration characterized by being a data reproducing device including a data storage device is also possible.

Further, the charging device includes at least a data updating device for updating data for use in the data reproducing device, which is stored in the data storage device. When a data reproducing device including a storage device is connected or set and a predetermined condition is satisfied, a configuration is also possible in which the data updating device updates data in the data storage device. is there.

Further, the data distribution system according to the present invention
The data usage recorder is a partial area of the data storage device, and therefore it is the data storage device or data storage device that is actually connected or set to the data usage record reader for billing. A configuration characterized by being a data reproducing device is also possible. In addition, the data distribution system of the present invention includes at least the billing device includes a data update device that updates data for use in the data reproduction device, which is stored in the data storage device. When a predetermined condition is satisfied when the data storage device or the data reproduction device including the data storage device is connected or set,
A configuration in which the data updating device updates data in the data storage device is also possible.

[0032]

DESCRIPTION OF THE PREFERRED EMBODIMENTS (First Embodiment) FIG. 1 is a block diagram of a data distribution system according to a first embodiment of the present invention. The data vending machine 101 is placed in an appropriate installation place such as a store where the user can use it relatively freely, and a digitalized book is stored in memory means such as a mini disk (MD) or a memory card brought by the user. It is assumed that data is written and sold, but such assumptions, specific specifications of each of the following components, detailed configurations and data structures are merely examples for explanation, and the scope of the present invention is not described. It is not limited.

The data vending machine 101 is a data selection device 1
02, data source selecting device 103, data receiving device 1
04, a data updating device 105, a billing device 106, a display device 108, a data information table 109, and a data rate table 110. Here, the data updating device 1
05 writes or rewrites the mini disk 107. The data receiving device 104 is connected to four data sources, here, a first data satellite 111, a second data satellite 112, a first data server 113, and a second data server 114, and receives data. Originally, there may be a plurality of data vending machines 101, but there is no particular difference in operation even with one data vending machine 101, so a data distribution system having one data vending machine 101 will be described below.

The flow of processing of the entire data distribution system when a user purchases data using the data vending machine 101 will be described below with reference to the flowchart of FIG.

First, the user inputs the data
When the user inserts the mini disk 107 brought by the user (step S201), the data selection device 102 extracts a part of the contents of the data information table 109 shown in the example of FIG. It is displayed on the display device 108 (step S202). In this example, the data information table 109 includes a data number field 301 indicating the number of selectable data, a name field 302 indicating the name of each data, the number of which is equal to the number represented by the data number field 301, and a sales price of each data. , A data source field 304 indicating a data source where each data exists, and a capacity field 305 indicating the capacity of each data in bytes.

The number-of-data field 301 represents the number of selectable data as a 2-byte unsigned integer, and the name field 302 is assumed to be stored with a shift JIS code of 16 characters per data. However,
If the data name originally exceeds 16 characters, the first 1
Six characters are stored, and if less than 16 characters, it is assumed that they are filled with 0. The price field 303 represents the price of each data as a 2-byte unsigned integer. In the data source field 304, a bit corresponding to each data source is assigned to each data of the number represented by the data number field 301, and the bit of "1" indicates that the corresponding data exists in the data source. ,
A bit of “0” indicates that it does not exist. The data source field 304 is updated when a new data source prepares the corresponding data. Capacity field 305
Represents the capacity of each data in byte units as a 4-byte unsigned integer. However, in FIG. 3, all the integers are in decimal and the shift JIS code is shown in the corresponding kanji.

FIG. 4 is an external view of a display example of the display device 108 and the previous item switch 401, the next item switch 402, the decision switch 403, and the cancel switch 404 provided in the data selection device 102. The name and sales price of the data currently being selected are displayed for each data item, either enclosed in a rectangle or highlighted. When the previous item switch 401 is pressed, the data to be selected is switched to the data displayed immediately above the data to be currently selected (step S203).
When the next item switch 402 is pressed, the data to be selected is switched to the data displayed below the data to be currently selected (step S204). When the decision switch 403 is pressed, the data selection device 102
Informs the data source selection device 103 of the data that was selected at that time, that is, the data that the user is trying to purchase (step S20).
5). The cancel switch 404 will be described later.

Since the data information table 109 is shared by the data selection device 102 and the data source selection device 103, the data information table 109 needs to be transmitted from the data selection device 102 to the data source selection device 103. Is only information on which data is selected. The data source selection device 103
With reference to the data source field 304 of the data information table 109, it is checked which data source the selected data exists (step S206), and for the data source where the selected data exists, the data is extracted therefrom. Information on the required time when the data is taken out is taken out from the data rate table 110, and a data source having the highest data rate, that is, a data source requiring the shortest time required for transfer is selected (step S207). .

FIG. 5 shows an example of the data rate table 110. The data rate for each data source is represented here in bits transferred per second. However, the numerical values given here are for explanation, and do not necessarily represent standard numerical values according to the current technology. The data rate is updated by the data source innovation and technology used. That is, the advantage of managing the data that can be supplied by each data source and the data rate of each data source by using the data information table 109 and the data rate table 110 will be described. If the data rate is fixed, it is possible to select the fastest data source for each data with fixedly connected hardware, but in practice, the content of data that can be supplied from each data source, Since the price and the like can change, it is possible to cope with such a change only by changing the contents of the data information table 109 and the data rate table 110. Although not described in detail here, the data information table 10
9. As a method of easily rewriting the data rate table 110, a method of reading a new table content from a floppy disk or transmitting a table portion corresponding to the data source from each data source at an appropriate timing is used. It is also conceivable to update the table.

In this example, the first data source is
It is assumed that there are four data satellites 111, a second data satellite 112, a first data server 113, and a second data server 114, and the data rates are written in the data rate table 110 in this order. Each data source is located at a point physically far away from the data receiving device 102, as well as the first data satellite 111 and the second data satellite 112, as well as the first data server 113 and the second data server 114. May be. First data satellite 11
The first and second data satellites 112 transmit data to the data receiving apparatus 102 by radio waves, and the first data server 1
13. The second data server 114 is the data receiving device 1
04 is connected by a high-speed telephone line, but it goes without saying that there may be various other communication means depending on the data source and the technology used.

Each data source has another data vending machine 101 ′, 10
It is not necessary that the owner of each data source be the same, and the owner of each data vending machine 101, 101 ′, 101 ″. May be different.

Each data vending machine 101, 101 ', 10
Since the operations of 1 "... Are exactly the same, only the operation of one data vending machine 101 and each data source will be described below.

Here, if the data source is a device such as a normal DRAM memory or a hard disk which does not perform communication in a daily sense, the data reception is performed through the interface of the memory or the hard disk. Obviously, even if the data source is such a device, it does not depart from the scope of the present invention, since it can be regarded as the device 104.

For example, if the second data in the data information table 109 is selected by the user, the data source selecting device 103
From the data source field 304 of the second data satellite 112 and the first data server 113, and then refer to the data rate table 110. To determine which data source is the fastest to get. In the example of FIG. 5, the data rate of the second data source is much higher than the data rate of the third data source, that is, the data rate of the second data satellite 112 is higher than the data rate of the first data server 113. Because it is much larger, the data source selection device 103
Is selected as the data source.

Next, the data source selecting device 103
Data is received from the selected data source via the data receiving device 104 (step S208). At this time, whether the data receiving apparatus 104 needs to transmit a request for data to the selected data source depends on the data source.

For example, as shown in FIG.
If it is a data source such as "Flanders dog", "I am a cat", "Opel and an elephant" ..., it is necessary to send a data request if the data is transmitted repeatedly in fixed time units. Instead, the received data may be read and discarded until desired data is transmitted, and only necessary data is received. Such a method is practical for a data source such as a data satellite, which transmits data at a very high speed, but it is difficult to transmit contents corresponding to individual destinations. However, the numerical value stored in the data rate table 110 needs to take into consideration such an average waiting time until the desired data is transmitted. Here, the first data satellite 1
11. The second data satellite 112 transmits data to the data receiving device 104 in this manner.
In the case of a data source in which data is transmitted only upon a request instead of such a request, a data request needs to be issued from the data vending machine 101 to the data source. Here, the first data server 11
Third, the second data server 114 is such a data source.

For such a data source, some means for transmitting data from the data vending machine 101 to the data source is required. Here, the first data server 1
13 or the second data server 114, when the data receiving device 104 receives data,
4 sends a data request to the first data server 113 or the second data server 114.

Data designation by the data receiving device 104 is performed by the first data server 113 and the second data server 1.
14, the first data server 113 and the second data server 114 are also provided with copies 109 ′ and 109 ″ of the data information table 109 so that the data receiving device 104 Is requested from the first data server 113 or the second data server 114 by the data receiving apparatus 104 transmitting the number of the data in the data information table 109 to these data sources.

As described above, in any case, the data receiving apparatus 104 can obtain the data desired by the user from the data source that the data source selecting apparatus 103 determines to be optimum.

The data selection device 102 includes a display device 108
Next, the price of the data obtained from the data information table 109 is displayed. (Step S209). The user is the display device 1
08 to the billing device 106 or
Press the cancel switch 404.

When the cancel switch 404 is pressed, the mini disk 107 is ejected from the data updating device 112, and the data vending machine 101 waits for the user to insert the mini disk again (step S21).
0).

When the specified amount has been inserted into the billing device 106, the data receiving device 104 transfers the transmitted data to the data updating device 105 (step S21).
1). The data updating device 105 writes the transmitted data to the mini disc 107 (step S212). Next, the data updating device 105 ejects the mini disk 107, and the data vending machine 101 enters a state of waiting for the user to insert the mini disk again (step S210).

In this example, digitized book data is handled, but the form of digitization has not been described. However, digitization of document data has already been widely performed, and as an example of such a method, text data can be encoded by shift JIS, and input as image data by a scanner. However, the present invention can be applied irrespective of such an electronic method and data format. Data vending machine 10 described so far
It is clear that description 1 can be realized by replacing the book data with music data, image data, moving image data, commercial data, computer software, game software, and the like, and thus the application of the book data is not limited. Further, a storage medium other than a mini disk, such as a floppy disk, a memory card, or a magneto-optical disk, may be used as the data storage device.

Further, it goes without saying that a reproducing apparatus for reproducing data may be integrated with the above-mentioned data storage device.

(Second Embodiment) The second embodiment is almost the same as the first embodiment, and includes a data buffering device 715 in a data vending machine 701.
Among data received by the data receiving device 704 from other data sources, data selected based on a predetermined criterion is stored in the data buffering device 715, and the data buffering device 715 is regarded as a kind of data source. Features. The features will be described below. Note that the specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and do not limit the scope of the present invention.

FIG. 7 is a block diagram showing a data distribution system according to the second embodiment. 1 is the same as the data distribution system described in the first embodiment except that a data buffering device 715 is provided.
It is illustrated by changing to a table. When the data buffering device 715 is regarded as a data source, the data receiving device 7
Although communication in a daily sense is not always performed with the communication device 04, the interface between the two can be regarded as constituting the data receiving device 704.

More specifically, the data buffering device 715 includes a controller 80 as shown in FIG.
1, a buffer memory 802 and a clock 803.
The clock 803 has date, hour, minute, and second. The controller 801 selects data to be stored in the buffer memory 802, manages the data stored in the buffer memory 802, and rewrites the data information table 709 and the data rate table 710 as necessary, as described later. .

FIGS. 9 and 10 show examples of the data information table 709 and the data rate table 710, respectively. 3 and FIG. 5 is different from the data information table 709 in that a selection count field 906 indicating the number of selections by the data selection device 702 and a selection time field indicating the last selection time are provided. 907 is added, and a data buffering device 715 is added as a data source in both the data information table 709 and the data rate table 710. Others correspond to 300 and 900 units. It is assumed that the bit corresponding to the data buffering device 715 in the data information table is “0” for any data when the data vending machine 701 is started. The data rate corresponding to the data buffering device 715 in the data rate table 710 stores a very high value, that is, a value “90000000” indicating that the transfer is very fast. Of course, the average value of the measured data rate when data is transferred from the data buffering device 715 to the data receiving device 704 may be stored.

The operation of the entire data distribution system until data is selected by the data source selection device 703 is the first operation.
This is the same as the data vending machine 101 described in the embodiment.

The operation of the data buffering device 715 will be described below with reference to the flowchart of FIG.

Here, it is assumed that the controller 801 preferentially stores in the buffer memory 802 the one whose number of selections by the data selection device 702 is large.

When new data is selected by the data source selection device 703, the data buffering device 715 adds 1 to the number-of-selections field 906 corresponding to the data in the data information table 709 (step S1).
101), the current time obtained from the clock 803 is written into the corresponding selected time field 907 (step S).
1102).

Next, the corresponding data is stored in the buffer memory 802.
Performs one of the following operations, depending on whether However, whether or not the corresponding data exists in the buffer memory 802 can be determined by referring to the data source field 904 of the data information table 709. That is, if the bit corresponding to the data buffering device 715 is “1”, the corresponding data exists in the data buffering device 715, that is, the buffer memory 802, and if “0”, the data does not exist. The example of FIG. 9 indicates that “oppel and elephant” exists in the buffer memory 802. It can be seen that “Flanders dog” and “I am a cat” are not stored in the buffer memory 802.

If the data exists in the data buffering device 715, the data buffering device 71
The process of No. 5 ends (step S1103).

When the corresponding data is not in the buffer memory 802, the controller 801 performs one of the following operations depending on whether or not all the data whose number of selections is larger than the corresponding data is stored in the buffer memory 802. However, this determination is made in the selection count field 906.
And referring to the data source field 904, if there is no data in which the number of selections is larger than the corresponding data and “0” is set in the bit corresponding to the data buffering device 715 in the data source field 904, , Can be performed by determining that all data whose selection count is larger than the corresponding data is stored in the buffer memory 802. In other words, if all data whose number of selections is larger than the corresponding data is stored in the buffer memory 802, it can be said that the data is eligible to be newly stored in the buffer memory 802. At this time, the controller 8
01 calculates the current usage U of the buffer memory 802 in order to check whether there is room in the buffer memory 802 for storing the relevant data (step S110).
4). Here, as shown in FIG. 12, each data is stored in the buffer memory 802 in the order of a data capacity 1201 representing the number of bytes of data as a 4-byte unsigned integer and a data body 1202 in units of bytes. Are the same as the data structure 1201 ′, the data body 12
02 ′, data capacity 1201 ″, data body 1202 ″
It is assumed that there is no space between different data. The usage amount U of the buffer memory 802 at this time
Is obtained by the sum of U = 8 * the number of data + the capacity of each data,
The number of data and the capacity of each data are stored in the data information table 7.
Such calculations are possible because they are easily obtained from the 09 data number field and the capacity field.

Next, the controller 801 compares the sum of the used amount U and the capacity D of the corresponding data with the capacity B of the buffer memory 802, and performs the following operation according to the result.

When U + D <= B, there is no problem in newly registering the corresponding data in the buffer memory 802. Buffer memory 802
The data capacity 1201 of the corresponding data is written from the first unused address (step S110).
5) Subsequently, the data body 1202 of the corresponding data is written (step S1106), and the data information table 709 is written.
The bit corresponding to the data buffering device 715 in the data source field 904 of the corresponding data is “1”.
(Step S1107), and the process of the data buffering device 715 ends (step S1103).

When U + D> B, the remaining capacity B of the buffer memory 802 is insufficient to newly register the corresponding data in the buffer memory 802. The controller 801 refers to the number-of-selections field 906 and the data source field 904 of the data information table 709, and sets the number of selections smaller than the corresponding data and sets the bit corresponding to the data buffering device 715 of the data source field 904 to " The following operation is performed depending on whether "1" is set, that is, whether there is data (hereinafter, referred to as "replacement target data") existing in the buffer memory 802.

If there is no data to be replaced,
The process of the data buffering device 715 ends (step S1103).

If there is data to be replaced, the controller 801 calculates the capacity T of the data to be replaced (note that there may be a plurality of data) by T = 8 * the number of data to be replaced + the capacity of each data to be replaced. It is determined (step S1108). Replacement data is as described above.
Number-of-selections field 906 of data information table 709
And the data source field 904, the number of data to be replaced necessary for calculating the capacity T of the target data and the information on the capacity of each data to be replaced are
Data source field 9 of data information table 709
04, capacity field 905, selection count field 90
It is clear from the information of No. 6. The capacity T of the target data indicates the capacity of the data that can be replaced by the data in the buffer memory 802. Therefore, the following operation is performed depending on whether T <D holds.

When T <D holds, it is impossible to replace the data to be replaced with the corresponding data.
The process of the data buffering device 715 ends (step S1103).

When T <D does not hold, the controller 801 refers to the data information table 709 and
Until BU> = D, the buffer memory 80
2 is deleted from the buffer memory 802 with the smallest capacity among the data to be replaced (step S110).
9) Filling the free space of the buffer memory 802 created by this (step S1110), the data information table 7
In step S111, a bit corresponding to the replacement target data deleted from the buffer memory 802 in the data source field 904 is set to “0”.
1). Thereafter, the controller 801 sets the buffer memory 8
02, the data capacity 1201 of the corresponding data is written in 8 bytes from the first unused address (step S1105).
2 (step S1106), and the data source field 90 of the corresponding data in the data information table 709 is written.
Then, the bit corresponding to the data buffering device 715 of No. 4 is set to “1” (step S1107), and the processing of the data buffering device 715 ends (step S1).
103).

The operation of the data distribution system after the processing of the data buffering device 715 is completed, including the operation of the data source selecting device 703 selecting the optimum data source according to the contents of the data rate table 710, Thereafter, the operation until data is selected again by the data source selection device 703 is the same as that of the first embodiment. However, if the desired data exists in the data buffering device 715, the data rate table 710 is used as the data rate of the data buffering device.
Is sufficiently high, the difference is that the data buffering device 715 is selected as the data source.

As the criterion for the controller 801 to select the data to be stored in the buffer memory 802, there may be various criteria other than those described above. In the above description, the number of times selected by the data selection device 702 is preferentially stored in the buffer memory 802 when the number of times selected by the data selection device 702 is large. In this control, data is deleted from the buffer memory 802 in the order of smaller number, in other words, control that gives priority to data with a larger number of selections by the data selection device 702 is performed. The control for giving priority to a product having a large product of time, the number of times of selection and the data capacity, or the control for giving priority to a product having the last selected time later is described in the example of the data information table 709 shown in FIG. It is clearly feasible only with information.

When the free space in the buffer memory 802 is reduced, the criteria for selecting data to be erased include the data capacity, the time required for one transmission, the number of times selected,
The selection is made from any or all of the elapsed times since the last selection. The control for giving priority to data having a long transfer time required to transfer data from the data source to the data receiving apparatus when not stored in the buffer memory is performed by using the capacity field 905 and the data source field 9
The data rate of each data source in the data rate table 710 where the data exists and the data rate of the data source where the data exists are calculated from the data rate of the data source and the data rate of the data source where the data exists. It is possible. In addition to this, it is needless to say that various standards can be realized by holding and using appropriate information.

(Third Embodiment) FIG. 13 is a block diagram showing a data distribution system according to a third embodiment.
The third embodiment is also basically similar to the first embodiment, and the corresponding parts are illustrated by changing 100 units to 1300 units. In the third embodiment, a data selection device 1302
Is provided with a data schedule table 1313 and a clock 1314, and the data source is the first data satellite 131.
0, second data satellite 1311, third data satellite 13
12, and lacks a data rate table. In the third embodiment, a plurality of data sources of a first data satellite 1310, a second data satellite 1311, and a third data satellite 1312 shift the same data in a time division manner in units of one book. The data source selecting device 1303 has a feature of selecting a data source that can obtain the data selected by the data selecting device 1302 at the earliest. Note that the specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and do not limit the scope of the present invention.

FIG. 14 is a data schedule table 1313.
This is an example. However, a part is illustrated here. As shown in the figure, it is assumed that data having the same name in the figure has the same content, and that "I am a cat", "Oppel and an elephant"
Data is transmitted for one book in the order of "Flanders dogs". The reason why the time required for one transmission differs depending on each data reflects that the length of the data differs. In this example, each data source transmits data in a time-division manner in the same order, but of course this is not essential, and when data selected by the data selection device 1302 is transmitted from each data source. It only needs to be able to obtain such information from the data schedule table 1313, and if such information can be obtained by another method such as calculation from the time, the data schedule table 1313 No need to have a table. In any case, here, the first data satellite 131 is used.
0, the second data satellite 1311 and the third data satellite 1312 correspond to the data schedule table 13 shown in FIG.
It is assumed that data is transmitted in a time-division manner along the line 13.

The data source need not be a data satellite as long as it is transmitted in a time-division manner, and the number of data sources is three in this example, but is not limited to this. It is. Data selection device 130
In 2, the operation of the data distribution system until data is selected is the same as in the first embodiment. The data source selection device 1303 refers to the data schedule table 1313 and the clock 1314 to select a data source to which the selected data is transmitted earliest from the current time.
For example, if the time obtained from the clock 1314 is 15:11 and data having the name of “Flanders dog” is selected, the data source selection device 1303
Refers to the data schedule table 1313, the time 15:19 at which the first data satellite 1310 next starts transmission of the selected data, and the second data satellite 1311 starts transmission of the next selected data. Time 15:17, third
The second data satellite 1312 compares the selected data at the next transmission start time 15:21, and since the second data satellite next transmission start time is the closest to the current time, The second data satellite is selected as the data source. At 15:11, the third
"Flanders dog" is being transmitted from the data satellite 1312 of the third data satellite 1312, but in order to receive this data from the third data satellite 1312, it is until 15:21 which is the time when transmission is started. I need to wait.

This is not the case when control is performed such that after receiving data from the middle and then searching for the data source that is transmitted earliest by re-searching the part from the beginning to the point already received, and receiving the data source. Such cases are, of course, within the scope of the present invention.

Thereafter, the operation of the data distribution system until the next data is selected is the same as that of the first embodiment except for the difference in data source.

In the description so far, the time required for data to be received by the data receiving apparatus 1304 (hereinafter, communication time) from the transmission start time from each data source is significantly different between the data sources. Under the assumption that there is no data source, the data source selection device 1303 selects the data source with the earliest transmission start time of the desired data, but if the difference in communication time between the data sources cannot be ignored, the data reception device After obtaining the next transmission start time of the desired data for each data source from the data schedule table 1313, the communication time 1304 adds the communication time for each data source to the transmission start time for each data source, and then starts transmission. It is also conceivable to compare times. In this case, the time at which transmission at each data source ends or the time at which reception at the data receiving device 1304 ends is substantially compared.

(Fourth Embodiment) FIG. 15 is a block diagram showing a data distribution system according to a fourth embodiment. The fourth embodiment is similar to the data distribution system of the first embodiment, and is characterized in that a data source transmits each data in blocks in a time-division manner in units of time, and selects data. The data transmission device 1501 assigns a longer transmission time to the data that is selected by the device 1502, so that the data can be obtained by the data vending machine 1501 with a short waiting time when the data is selected.
In addition, the parts corresponding to FIG. 1 are illustrated by changing 100 units to 1500 units. Hereinafter, the parts that are not particularly described are the same as those described in the first embodiment except for the difference in the data source. In addition, specific specifications of each of the following components,
The detailed structure and data structure are merely examples for explanation, and do not limit the scope of the present invention.

In the following, the term “selection data” indicates a selection unit selected by the data selection device 1502. This is to distinguish it from the data part for the header part in the block created by dividing the data. In this example, “I am a cat” and “Flanders dog”, which will be described later, are one selection data.

In the fourth embodiment, the data source is only the data server 1511. This is because the following description is not unnecessarily complicated, and a plurality of data sources may be used. Also, when there is only one data source as in this example, the data source selection device 1503 and the data rate table 1510 can be omitted. Put to do.

FIG. 16 shows an example of the data information table 1509.
Shown in In the part corresponding to FIG. 3, 300 units are replaced with 1600 units. Selection data is name field 160
As shown in FIG. 2, there are two types, and as shown in the data source field 1604, except for one type of data source, the data information table 109 of the first embodiment shown in FIG. It is the same as the content. The reason why two types of selection data are used is to simplify the following description, and three or more types may be used at all. The data server 1511 stores a copy 15 of the data information table.
09 ”and the data schedule management table 15
It has 12.

Data divided into blocks as shown in FIG. 17 is transmitted from the data server 1511 to the data receiving device 1504 in a time-division manner. FIG.
Then, one block has a data number field 170.
1, a block number field 1702, a block number field 1703, a data length field 1704, and a data body 1705. Data number field 17
01 designates the data in the data information table 1509 in the order in which the information about each data is arranged, and numbers 1, 2, 3,... When the respective data are numbered. And Block number field 1
Reference numeral 702 denotes a 2-byte integer indicating the number of the block in the data, and block number field 1703 denotes a 2-byte integer indicating the number of blocks of the data.

Therefore, the block number field 170
3 is the same as the data number field 1701,
Have the same value. The data body 1705 is in bytes.
The data itself is the divided data, and the data length field 1704 is a 4-byte integer indicating the length of the data body 1705 in byte units. Here, the data length field 1704 includes a data length field for any selected data from the first block of data (block number field = 1) to the block immediately before the last block (block number field = block number field). Have a common value. Hereinafter, this numerical value is referred to as a standard block size, and is assumed to be 4 KB here. For the last block, the number of bytes remaining after dividing the entire data length by the standard block size is used. Therefore, here, the data length field 1704 has a common value of 4 KB (4096) except for the last block.

In FIG. 17, all the numerical values are shown in decimal, and each numerical value contains a value that matches the third block of “Flanders dog” in the example of the data information table of FIG. That is, since “Flanders dog” is the first data in the data information table 1509 in the data number field 1701,
Since 1 is the third block in the block number field 1702, 3 is stored. In the number-of-blocks field 1703, “Flanders dog” is 14 according to the capacity field 1605 of the data information table 1509.
Since it has a capacity of 636 bytes, 4 is obtained from 14636 ÷ one block length 4096 (bytes) ≒ 3.57, and 4096 is stored in the data length field 1704 because it is not the last block.

Data schedule management table 1512
FIG. 18 shows an example of the configuration. Selection frequency field 1801
Is stored with the frequency at which each selected data item is selected by the data selection device 1502, and is all initialized to 0 when the data distribution system starts operating. The number of allocated blocks field 1802 indicates the number of blocks allocated to each piece of selected data, here, how many of the 100 blocks are allocated. The method for determining this value will be described later. Data length field 1803
Gives a standard block size for each selection data. In this example, as described above, 4096 is stored for each of the selection data. Conversely, in this example, the data length field 1803 is not always necessary, but is provided for the purpose of use in the description of the embodiment described later. The data length field 1803 matches the data length field 1704 of the block obtained by dividing each selected data except for the last block of each selected data. Also, data information table 1
Assume that elements 509 and elements of the data schedule management table 1512 are arranged such that portions corresponding to the same data come in the same order. "The Dog of Flanders" is 14636
(Byte) $ 4096 (byte) $ 3.57 divided into four blocks as described above, "I am a cat"
Is divided into eight blocks from 31744 (bytes) / 4 (bytes) = 7.75. When the last data block of each selection data is transmitted, the data is transmitted again from the first block. As shown in FIG. 19, if the number of blocks transmitted per time is made equal among the selected data,
To receive the whole "I am a cat", it is necessary to wait for about 15 blocks to be transmitted, and to receive the whole "Flanders dog", it is necessary to wait for about 7 blocks to be transmitted. However, the calculation of the waiting time does not take into account that the length of the last block is generally different from other blocks (the same applies hereinafter).

Since it is considered that the time required for transmission / reception of one block does not largely depend on the selected data, it can be considered that this directly represents the ratio of the waiting time. Here, suppose that the frequency at which “I am a cat” is selected by the data selection device 1502 is nine times the frequency at which “Flanders dogs” is selected, the use of the data vending machine 1501
The average waiting time per zero is 15 blocks * 9 + 7 blocks * 1 = 142 blocks (1).

The point of the fourth embodiment is that the data selection device 1502 reflects the frequency at which each selected data item is selected on the data transmission schedule of the data source to reduce this average waiting time. It is.

The operation of the data distribution system until data is selected by the data selection device 1502 is the same as that of the data distribution system described in the first embodiment.
When data is selected by the data selection device 1502, the data source selection device 1503
9 and the data rate table 1510, the optimum data source is determined. In this example, since the data source is only the data server 1511, the data server 1511 is selected and the data receiving device 15 is selected.
04 issues a data transmission request. This can be performed in the same manner as the data request of the data receiving apparatus 104 to the first data server 113 and the second data server 114 in the first embodiment. When receiving the number designating the data from the data receiving device 1504, the data server 1511 increments the corresponding element of the selection frequency field 1801 of the data schedule management table 1512. Further, the data server 151
1 updates the corresponding element of the allocated block number field 1802 by the logic described below. Hereinafter, assuming that the selected selection data is Di, the element of the selection frequency field 1801 corresponding to Di is Fi, and the element of the allocated block number field 1802 is Qi, Qi is obtained as Qi = (100 * Fi) / ΣFi. . Where Σ is the sum of all selected data.

In the calculation of Qi, ｉQi is generally less than 100 because fractions below the decimal point are rounded down. At this time, it is assumed that the block of (100−ΔQi) is allocated to the data with the smallest number of allocated blocks.

In the above equation, the sum of the frequency of selection of Di and the frequency of selection of all data can be obtained using the information in the frequency of selection field 1801 of the data schedule management table 1512.

The data server 1511 divides each selected data into blocks having the size specified by the data length field 1803 of the data schedule management table 1512, and allocates the selected data to each data specified by the allocated block number field 1802. The block is transmitted for each block according to the ratio of the number of blocks. The data receiving device 1504 joins the blocks of data sent in this way into one piece of data. From now on,
The operation of the data distribution system until data is newly selected by the data selection device 1502 is the same as that described in the first embodiment. The data server 1511 can determine the number of blocks of each selected data from the information of the capacity field 1605 ′ in the copy 1509 ″ of the data information table and the information of the data length field 1803 of the data schedule management table 1512. It is clear.

Here, effects of the fourth embodiment will be described. Suppose that the frequency at which D1: “I am a cat” (8 blocks) is selected by the data selection device 1502 is D2.
Assuming that the frequency of selection of “Flanders dog” (4 blocks) is nine times, in such a method of allocating the number of blocks according to the selection frequency, Q1 = (100 * 9) / (1 + 9) = 90 Q2 = (100 * 1) / (1 + 9) = 10, and the approximate average number of blocks that must wait for transmission to obtain D1 is: D1: 8 * 100/90 = 8.89 blocks D2: 4 * 100/10 = 40 blocks. Therefore, use 10 of data vending machine 1501
The approximate average number of blocks that need to wait for transmission per round is 8.89 blocks * 9 + 40 blocks * 1 = 120 blocks ... (2) As compared with 142 blocks obtained by the equation (1), It has decreased by more than 15%. That is, a data distribution system with a short average waiting time can be realized.

The point of the fourth embodiment is that the number of data selections is automatically reflected in the transmission amount of each data per time, and this method is not limited to the above. The above-mentioned method decomposes the transmission amount of each data per time into the number of allocated blocks per time * the data length per block, and keeps the data length per block constant, while allocating blocks per time. Although the number is changed, the same effect can be obtained within the scope of the present invention by controlling the data length per block instead. For example, the data server 1511 sets the allocated block number field 1802 of the data schedule management table 1512 to be the same for each selected data, but also sets the data length field 1803 to the constant α for each selected data Di.
* Fi / ΣFi (where Fi is an element of the selection frequency field 1801 corresponding to Di, where Σ is the sum of all the selected data), the transmission amount of each data per time is also determined by the number of data selections. It is clear that the same effect can be obtained because it is reflected.

Also, without dividing the selected data into blocks, the data transmission amount of each selected data Di per time is expressed as
It can also be controlled by the length of the entire selection data * the number of transmissions per time of the entire selection data. In this case, since the length of the selection data does not change, the data server 1511 needs to control the number of transmissions of the selection data per time in order to reflect the selection frequency in the transmission amount per time of each selection data Di. There is.

In the example of the data schedule management table 1512 used here, if the data length field 1803 is made extremely large, the selected data is transmitted in the last block and one block. It indicates the number of transmissions per time of the entire selection data. Therefore, the number of allocated blocks field 1802 may be controlled. If this is Qi, the length of Di is Si, and Fi is given by Qi = constant β * Fi / Si as an element of the selection frequency field 1801 corresponding to Di, and the data transmission amount of each selected data Di per time = Si * Qi = constant β * Fi, and the data transmission amount of each selection data Di per time becomes proportional to the selection frequency Fi of the selection data Di.

(Fifth Embodiment) FIG. 20 is a block diagram of a data searcher according to a fifth embodiment of the present invention. The data searcher 2001 is intended for searching for book data stored in a text format such as Shift JIS. The data structures are only examples for explanation, and do not limit the scope of the present invention. The data searcher 2001 includes a search condition setting device 2002, a search device 2003, and a storage device 20.
04 and a mini-disc writer 2005. The storage device 2004 stores the number of book data 2007
Further, book data 2008, 2008 ′, 2008 ″, etc., which are the number indicated by the book data number 2007, are stored.
The explanation of the other book data 2008 ', 200
8 "...

When using the data searcher 2001, the user inserts the brought mini-disc 2006 into the mini-disc writing means 2005. Next, a search condition is input from the search condition setting device 2002. FIG. 21 is a configuration example of the search condition setting device 2002. The search condition setting device 2002 includes a controller 2101, a keyboard 210
2, display device 2103, corresponding data number register 2104
And an offset register 2105. In this example, what can be set by the search condition setting device 2002 is a data retrieval range that specifies the level of retrieval of data, such as a keyword, a paragraph, a section, a chapter, or an entire book. FIG. 22 is a display example of the display device 2103. A keyword input from the keyboard 2102 is shown in the keyword window 2201, and a currently selected data extraction range is enclosed in a rectangle in the data extraction range window 2202.
The selection of the data extraction range is performed by the keyboard 2102
It is assumed that the operation is performed by raising and lowering a rectangle surrounding the character string by using the cursor keys. Applicable data number register 210
4. The offset register 2105 and the search result window 2203 will be described later.

It is conceivable that the search device 2003 allows an ambiguous search. However, since the ambiguous search itself is widely implemented, in order to prevent the explanation from being unnecessarily complicated, such an ambiguous search must be performed. It is only pointed out that the data searcher 2001 does not deviate from the scope of the present invention even if the specified specification is added or changed. Here, the search apparatus 2003 is described as performing a perfect match search. The input keyword and data selection range are sent to the search device 2003. The search device 2003 searches the book data 2008, 2008 ', 2008 "... Stored in the storage device 2004, and searches for the keyword. A portion of the book data extracted in the unit set by the search condition setting device 2002 (hereinafter referred to as “applicable data”) is transferred to the mini-disc writing device 2005, and the number of applicable data is transferred to the search condition setting device 2002. Forward. The operation of the search device 2003 will be described later in detail.

The search condition setting device displays the number of the corresponding data transferred in the search result window 2203.
FIG. 22 shows a display example of the search result window 2203 when there are two corresponding data. The mini-disc writing device 2005 writes the corresponding data to the inserted mini-disc 2006, ejects the mini-disc 2006, and ends the processing. If the corresponding data does not exist, the mini disc writer 2005
The mini-disc 2006 is ejected without writing, and the process is terminated.

Here, in order for the retrieval device to be able to retrieve data in accordance with the selection range of designated data such as paragraphs, sections, chapters, etc., the structure of such a book must be reflected in the storage device 2004 in advance. It is convenient for the book data 2008 to be stored in such a form. FIG. 23 shows an example of a data structure suitable for such a purpose. However,
Since the search device 2003 can automatically analyze the structure of the book data 2008, for example, by extracting words such as “Chapter 1” and “Section 2” from the book, at least with standard book data, However, such a data structure is not essential, and the example of FIG. 23 is not the only one that can be considered. The book data 2008 shown in FIG.
2. The table of contents 2303 is divided. Text data 23
Reference numeral 02 denotes text data of the entire book stored in a shift JIS code, the number of bytes of which is a 4-byte numerical value, which is stored in the text data length 2302. The table of contents 2303 is for the contents of the book data 2008, and accordingly,
Note that the table of contents 2303 includes item data 2304, 2304 ′,
2304 "... Unless otherwise specified, the description of the item data 2304 also applies to other item data 2304 ', 2304".

Item data 2304 includes the entire book, chapters, sections,
It represents information on a part of a book at a different level, such as a paragraph, and is made up of a set of five integer values shown in Table 1.

[0106]

[Table 1]

For example, the entire book has a hierarchical structure of chapters: sections, and includes a foreword, a first chapter including three sections, a second chapter including two sections, a third chapter including four sections, and a postscript. Table of contents 2303 corresponding to an example of simple book data
Is as shown in FIG. Note that the “daily meaning” in the rightmost column of the table is included to help understanding, and
Not part of 303. The same applies to the names of all numerical values in the first row, which are not part of the table of contents 2303.

Each row except the first row in the table of FIG. 24 corresponds to each item data, and each item data is stored in the table of contents 2303 in order from the second row of the table. However, except for some item data, the first byte 2305 and the last byte 2
The numerical value of 306 is omitted.

[0109] "Preface" and "postscript" of a book are treated as independent chapters each having no lower hierarchy. In addition, the first byte of each chapter and the first byte of the first section of each chapter generally do not match because there is a chapter heading or a chapter introduction before the first section of each chapter. Similarly, the start byte of the whole book and the start byte of the preamble generally do not match because of the title of the book and the like. In general, the last byte of the postscript and the last byte of the entire book do not match because of an imprint between them.

When the data structure described above is used,
The data retrieval range selected by the search condition setting device 2002 is represented by a numerical value designating the depth level 2108 of each item data in the internal processing of the data search device 2001. In this case, the data extraction range window 2202
Some books use different words instead of “chapter”, such as “Level 0 (whole book)”, “Level 1 (chapter etc.)”, “Level 2 (section etc.)”. It is more accurate and preferable to take into account the possibility.

The operation of the search device 2003 using the above-described data structure is shown in the flowchart of FIG.
From the search condition setting device 2002, the controller 2101
Receives a keyword and a unit for extracting data (step S2501), and
4 is initialized to 0 (step S2502). Of the book data 2008... Having the book data number 2007 stored in the storage device 2004, the processing is shifted to the first unprocessed one (step S2503), and the processed one of the text data 2302 is processed. A keyword is searched for from the missing part (step S2504). Each time it is found, the byte offset of the keyword in the text data 2302 is recorded in the offset register 2105 (step S2506), and the numerical value of the first byte 2305 is read from the contents of the offset register 2105 by referring to each item data of the table of contents 2303. For item data that is not larger and the value of the last byte 2306 is not smaller than the contents of the offset register 2105, the depth level 21
08 matches the data retrieval range set by the search condition setting device 2002, the corresponding data number register 21
04 is incremented (step S2507). Then, referring again to the first byte 2305 and the last byte 2306 of the corresponding item data, all data within the range is extracted from the text data 2302 and transferred to the mini-disc writer 2005 (step S2).
508). If this is not the last item data of the book data currently being processed, the process proceeds to the next item data (step S2509). If it is the last item data, if it is not the last book data, the process is shifted to the next book data (step S2510), and if it is the last book data, the contents of the corresponding data number register 2104 are stored in the search condition setting device. (Step S251)
1).

The method of storing each book data in the storage device 2004 is as follows.
Are continuously stored without creating a space, and are stored in the book data 2008 in the order of the text data length 2301, the text data 2302, and the table of contents 2303 as shown in FIG. In this way, the search device 2003 can know the beginning and end of each of the book data 2008 and 2008 'because the search device 2003 uses the table of contents 23.
By referring to the number of sub-level items 2309 of the entire book of 03, item data with a depth level of 1 can be obtained.
The book tells you which one is the last one. Generally, the last item data whose depth level 2108 is (n + 1) is determined from the numerical value of the number of sub-level items 2309 of the item data whose immediately preceding depth level 2108 is n. Because it is possible to know, when tracing the table of contents 2303 from the top, the table of contents 2303
You can tell the end of 3. Text data length 21
This is because the end of the text data 2302 can be known by referring to the text data length 2102 of the text data 2302 because the length is fixed length. Also, in addition to the above,
By referring to the book data number 2007, the search device 20
03 is the book data 20 in the storage device 2004.
08... Are of course stored.

(Sixth Embodiment) FIG. 26 is a block diagram of a sixth embodiment. In the sixth embodiment,
It is similar to the data distribution system of the first embodiment, and is characterized in that an electronic publisher 2615 is added as a data source, and a keyboard 2616 is added to a data selection device 2602. In the portion corresponding to FIG. 1, 100 units are replaced with 2600 units. Note that the specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and do not limit the scope of the present invention.

As described below, the electronic publisher 26
15 is very different in characteristics from other data sources, and includes a data information table 2609 and a data rate table 26.
There is no need to be registered at 10. Data receiving device 2604
And the electronic publisher 2615 may be a one-way communication from the data receiving device 2604 to the electronic publisher 2615.

The difference from the first embodiment is that when the user selects desired data from the options displayed on the display device 2608 using the data selection device 2602, the user selects “others” in the options on the display device 2608. Is provided, and when “Others” is selected, the display device 2608 is displayed.
Means that information about the data and other information are switched to a display for input from the keyboard 2616, and an order or an inquiry is made to the electronic publisher 2615 in accordance with the input information. . Therefore, the operation when “other” is not selected by the data selection device 2602 is the same as that of the first embodiment.

FIG. 27 shows the data selection device 2602
FIG. 177 is an external view of a display example of the display device 2608 and a previous item switch 2701, a next item switch 2702, a decision switch 2703, and a cancel switch 2704 provided in the data selection device 2602 when “others” is selected. The user inputs information such as the name of the data to the data information input window 2705, the inquiry / order to the action input window 2706, and the name, address, and telephone number to the user information input window 2707. Each time the user presses the decision switch 2703, the window to be input is displayed in the data information input window 2
705, an action input window 2706, and a user information input window 2707. When the enter switch 2703 is pressed while the user information input window 2707 is being input, the completion of the input is transmitted to the data selection device. I have. In the action input window 2707, "inquiry"
The rectangle surrounding each character string of “order” is moved to the next upper item by the previous item switch 2702, and is moved to the lower next item by the next item switch 2703, thereby designating the rectangle. The data selection device 2602
If "others" is not selected, the previous item switch 2701, the next item switch 2702, the decision switch 2
It goes without saying that the 703 and the cancel switch 2704 perform the same operation as the corresponding components described in the first embodiment.

The electronic publisher 2615 sends a reply or a product according to the sent information. Unlike other data sources, it is expected that data will be transferred from electronic publisher 2615 to data receiver 2604 on the fly, as it may be difficult for electronic publisher 2615 to prepare the data immediately. No (if this is possible, the electronic publisher 26
There is no longer any reason to distinguish 15 from other data sources, and it is simply a new data source added to the first embodiment. ).

Of course, if the communication between the data receiving device 2604 and the electronic publisher 2615 is bidirectional, allowing the latter to the former, the electronic data can be electronically transmitted from the electronic publisher 2615 to the electronic publisher 2615. Since a transmission path to the update device 2605 is secured, the electronic publisher 2615
May inform the user when the data is ready, at which point the user may return to the data vending machine 2601 and receive the data supply as with any other data source.

Further, the electronic publisher 2615 may be a mere bookstore, and what is delivered to the user is not electronic data but a paper book having the same or similar contents.

As described above, since the data vending machine 2601 has a function of communicating with the electronic publisher 2615 other than the original data source, a wider variety of data can be distributed.

Also, data that can be supplied by the electronic publisher 2615 is previously included in the options of the data selection device 2602, and when such data is selected, necessary information such as the destination of the data is input. It is also possible to make it. In this case, the electronic publisher 2615 is virtually recognized by the user as a normal data source at least halfway through the operation.

(Seventh Embodiment) FIG. 28 is a block diagram of a duplicate data detection system for detecting an unauthorized copy of data distributed to a data distribution system according to a seventh embodiment. This system uses a mini disk (M) used in a plurality of data reproducing apparatuses.
It has a function of checking whether the data stored and distributed in D) is a copy medium, and suppressing unauthorized copying. In addition,
Such assumptions, specific specifications of each component described below, detailed configurations and data structures are merely examples for explanation, and do not limit the scope of the present invention.

The duplicated data detection system according to the seventh embodiment includes a data inspection device 2801 and data reproduction devices 2802, 2802 ′, 2802 ″.. Unless otherwise specified, the data reproduction device 2802 will be described below. , Other data reproducing devices 2802 ′, 2802 ″.
It also applies to The data reproducing device 2802
PU 2803, data communication device 2804, mini disk drive 2805, display device 2806, playback switch 2
807 and an end switch 2808.

Each mini disk 2809, 2809 ′, 2809 ″ read by the mini disk drive 2805
... store authentication data 2810, 2810 ', 2810 ",... Having unique contents in a normal use state.
. 809 ′, 2809 ″... Are reproduced data 2811, 2811 ′,
2811 "... Are stored.

The data inspection device 2801 includes a controller 2812, a data communication device 2813, a data number register 2814, and a data management table 2815. The authentication data 2810 (or 2810 ′, 2
810 ") is simply copied to the authentication data 2810.
(Or 2810 ', 2810 "), but it is believed that there is no risk of confusion.

Data communication apparatus 2804 and data communication apparatus 2813 perform bidirectional communication by a suitable means such as a telephone line or radio waves.

The operation of data reproducing apparatus 2802 will be described below. In the following description, the signals of “start of use”, “end of use”, and “prohibition of reproduction” are appropriately determined according to the communication means employed.

The user inserts the mini disc 2809 into the mini disc drive 2805 and
When the user presses 7, the mini disk drive 2805 reads the authentication data 2810 from the mini disk 2809 and
PU 2803 transfers it to data communication device 2804. The data communication device 2804 transmits the signal indicating “start of use” and the authentication data 2810 to the data inspection device 280.
1, more specifically, to the data communication device 2813. The data inspection device 2801 detects duplicate data, which will be described later. Depending on the result, the data inspection device 2801
01 sends a “reproduction prohibited” signal to the data communication device 2804. On the other hand, the mini disk drive 2805 reads the reproduction data 2811 from the mini disk drive 2805, and the CPU 2803 starts reproducing the reproduction data 2811 by sending it to the display device 2807. However, the data communication device 2804 sets the “reproduction prohibited”. When you receive the signal,
A message “this data may be illegally copied” is displayed on the display device 2806, and the operation of the mini disc drive 2805 is stopped.

When the user presses the end switch 2808 during reproduction of the reproduction data 2811, the data communication device 2804 sends a signal indicating “use end” and authentication data 2810 to the data communication device 2813. Later, C
The PU 2803 stops the operation of the mini disk drive 2805.

In the data management table 2815, the numbers of the authentication data sent together with the signal indicating “start of use” are stored successively. Data number register 281
4 stores the number of such authentication data.
FIG. 29 is an example of the data number register 2814 and the data management table 2815. In this example, both the number of authentication data and the authentication data are assumed to be 4-byte unsigned integers. However, in FIG. 29, the number “8” of the authentication data and the number of the eight authentication data are both written in decimal notation. It is.

The operation of the data inspection device 2801 when data is sent from the data reproduction device 2802 will be described with reference to FIG.
Will be described along the flowchart of FIG.

The controller 2812 is the data communication device 2
If the data received by the data 813 includes a signal of “start of use”, the authentication data 2810 included in the data is received.
Already exists in the data management table 2815, a "reproduction prohibited" signal is sent to the data communication device 2804 that has transmitted the data, and the process returns to the standby state (step S30).
02). The authentication data 28 is stored in the data management table 2815.
If not, the controller 2812 adds the sent authentication data 2810 after the last authentication data in the data management table 2815 (step S300).
3), the data number register 2814 is incremented (step S3004), and the process returns to the standby state (step S300).
3002).

The controller 2812 is the data communication device 2
If the data received by the data 813 does not include the signal of “start of use” but does include the signal of “end of use”, the authentication data 2810 is stored in the data management table 2815.
If there is, the authentication data 2810 is deleted from the data management table 2815 (step S2407), and the data number register 2814 is decremented (step S240).
8) Return to the standby state (step S3002). If there is no authentication data 2810 in the data management table 2815, the sent data is ignored as abnormal data (step S3007), and the process returns to the standby state (step S300).
3002).

Also, when the data received by the data communication device 2813 does not include any of the signal of “start of use” and the signal of “end of use”, the transmitted data is ignored as abnormal data. Step S300
7), and return to the standby state (step S3002). In addition,
In step S3005, the portion corresponding to the authentication data 2810 deleted from the data management table 2815 is assumed to be sequentially packed instead of being an empty area.

In this system, illegal copying is suppressed only by mini disks 2809, 2809 ', and 28.
09 ″... Authentication data 2810, 2810 ′, 281
If 0 ”... Have the same value, step S30
05, different data reproducing devices 2802, 280
2 ′, 2802 ″...
809 ', 2809 "... Cannot be used at the same time. That is, even if a malicious person produces a large amount of illegal copies of mini discs, as long as the copies are made by ordinary means, they will remain as originals. Since they have the same authentication data, only one of them can be used at the same time.
It doesn't make sense because there are only sheets. Also, when a well-intentioned individual makes a copy for backup purposes, it is not used at the same time as the original, so there is no restriction at all.

In this example, the data communication device 2804,
Although communication between the data communication devices 2813 was bidirectional,
This is called “prohibition of reproduction” as one direction from the former to the latter.
Transmission of signal from the latter to the former, data reproducing apparatus 2802
Even if the prohibition of reproduction is omitted, the detection of the copy of the data itself can be performed, so that the use is somewhat limited, but still useful.

In order to prevent a malicious person from trying to maintain the uniqueness by rewriting only the authentication data of the copied mini-disc, the authentication data 2810 is encoded so as to make it difficult to separate it from the reproduction data 2811. It is more preferable to be able to make it.

(Eighth Embodiment) FIG. 31 is a block diagram showing a duplicated data detection system according to an eighth embodiment. Since it is similar to the seventh embodiment, only the differences will be described below. Hereinafter, the data reproducing apparatus 3102
Is applied to other data reproducing apparatuses 3102 ′, 3102 ″, etc. unless otherwise specified. Note that specific specifications, detailed configurations and data structures of the following components are to the last. This is an example for explanation, and does not limit the scope of the present invention.Hereafter, a copy of the contents of the authentication data 3110 (or 3110 ', 3110 ") is simply copied to the authentication data 3110 (or 3110', 3110 ',
110 "), but it seems that there is no risk of confusion.

With the mini disk 3109 inserted in the mini disk drive 3105, the playback switch 3
When the key 107 is pressed, the authentication data 31 is sent from the data communication device 3104 at a predetermined time interval α seconds.
10 is the data communication device 3104 to the data communication device 31
13 and persists until the end switch 3108 is pressed.

However, when the mini disc 3109 is inserted into the mini disc drive 3105, the playback switch 31
07 is pressed, a predetermined β seconds (β>
It is assumed that transmission of the authentication data is started only after elapse of α). The reason will be described later. Data management table 311
5 is an authentication data field 32 as shown in FIG.
01 and a time field 3202, and are recorded as a pair with the authentication data and the time at which it was sent. Further, the data inspection device includes a clock 3116.
The clock 3116 has date, hour, minute, and second.

The operation of the data inspection device 3101 when data is sent from the data reproduction device 3102 will be described with reference to FIG.
This will be described with reference to the flowchart of FIG.

If the transmitted authentication data 3110 already exists in the authentication data field 3201 of the data management table 3115, the controller 3112 determines the current time obtained from the clock 3116 and the contents of the time field 3202 corresponding to the authentication data 3110. Is calculated (step S3301), and if smaller than a predetermined time interval γ seconds (α> γ), the data communication device 3113 is used.
Sends a "reproduction prohibited" signal to the data communication device 3104 (step S3302), and returns to the standby state (step S3303). If it gets smaller, authentication data 3
The time field 3202 corresponding to 110 is updated to the current time (step S3301), and the process returns to the standby state (step S3303). Authentication data field 320
If the authentication data 3110 does not have the authentication data 3110, the data is added after the last data of the authentication data field 3201 (step S3305), and the current time obtained from the clock 3116 is written in the corresponding time field 3202 (step S3305). S3306), data number register 3114
Is incremented (step S3307), and the process returns to the standby state (step S3303).

Apart from this, the controller 3112
At a predetermined timing, referring to the time field 3202, comparing with the current time obtained from the clock 3116, if there is an element whose difference is larger than a predetermined time interval Δsec (Δ >> α) , The element and the corresponding authentication data are deleted from the time field 3202 and the authentication data field 3201, and the data number register 31
Decrement 14 This is to prevent the data management table 3115 from becoming too large due to unused data. Of course, as in the seventh embodiment, when the end switch 2808 is pressed, the data communication device 3104 transmits a signal indicating “use end” and the authentication data 3110 to the data communication device 31.
13 and triggering this to delete unnecessary elements of the time field 3202 and authentication data field 3201 from the data management table 3115. In any case, it is assumed that portions corresponding to the time field 3202 and the authentication data field 3201 of the deleted authentication data are not vacant and are packed in order.

The time required from the insertion of the minidisk 3109 into the minidisk drive 3105 to the start of the first transmission of the authentication data is longer than the above-mentioned threshold value γ seconds for judging the data as a duplicate. Is desirable.
This is because, for example, the mini-disc 3109 being reproduced by the data reproducing device 3102 ′ can be
02 and the data inspection device 31
01 is to prevent the minidisk 3109 from being determined to be a duplicate.

For example, if threshold value γ is set to 15 seconds, data communication device 310 of data reproduction device 3102 ′
From the last transmission of the authentication data 3110 of the mini disk 3109 by the 4 ′, the mini disk 3109 is taken out from the data reproducing device 3102 ′, the reproduction is started by another data reproducing device 3102, and the mini disk 3109 is transmitted by the data communication device 3104. 1109 of authentication data 3110 of 3109
Assuming that the time required for the second transmission is 10 seconds, the authentication data 3110 is transmitted twice at an interval of 10 seconds, so that the mini disk 3109 is determined to be a duplicate. In order to prevent this, the transmission of the authentication data is started only after a predetermined β seconds (β> α) has elapsed after the mini disk is inserted into the mini disk drive 3105 and the reproduction switch 3107 is pressed. I did it.

Note that, as in the seventh embodiment, when the end switch 3108 is pressed, the data communication device 31
04 is a signal indicating “end of use” and authentication data 311
0 is sent to the data communication device 3113, when the data reproduction device 3102 'has finished using the data, the mini disc 31
Since the authentication data 3110 of 09 can be deleted, it is not necessary to consider such a thing.

In the eighth embodiment, the reason why illegal copying is suppressed and the method of realizing a slightly simplified form are the same as those described in the seventh embodiment.

(Ninth Embodiment) FIG. 34 is a block diagram of a data distribution system according to a ninth embodiment. The main difference from the first embodiment is that a data inspection device 3415 is added to the first embodiment. The portion corresponding to FIG. 1 is illustrated by changing 100 units to 3400 units. Further, the data updating device 3405 needs to perform not only writing to the mini disc but also reading. In addition, mini disks 3407, 3407 ', 3
407 ″ have authentication data 3416, 3416 ′, 3416 ″ having unique contents and reproduction data 3417, which have unique contents in the normal use state, similarly to the seventh and eighth embodiments. 3417 ', 3417 "... Are stored. Specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and the scope of the present invention is not limited thereto. It does not do.

When the user inserts the brought mini disk 3407 into the data updating device 3405, the data updating device 3405 reads the authentication data 3416 from the mini disk 3407 and sends it to the data inspection device 3415. The data inspection device 3415 checks the transmitted authentication data 3
From 416, it is determined whether or not a copy exists on the mini disk 3407. If it is determined that a copy exists, a message indicating that a copy exists on the inserted disc is displayed on the display device 3408, and the data update device 3
From 405, the mini disk 3407 is ejected without writing, and the data vending machine 3401 returns to the initial state. If it is not determined that a copy exists, the data inspection device 3415 sends new authentication data 3416A
And sends it to the data update device 3405, which writes it to the minidisk 3407. Subsequent operations are the same as in the first embodiment.

Next, the operation of the data inspection device 3415 will be described in detail. FIG. 35 shows a configuration example of the data inspection device 3415. It comprises a controller 3501, a data number register 3502, a data management table 3503, an authentication data generator 3504, and a clock 3505. Clock 350
5 has date, hour, minute and second. The data management table 3503 includes an authentication data field 3601 and a time field 3602 as shown in FIG. Although the form is similar to the data management table 3115 described in the eighth embodiment, the data management table 3115 shows information of data in use, while the data management table 3503 prohibits use. The function is greatly different in that the information of the obtained data is shown.
The number of authentication data stored in the authentication data field is stored in the data number register 3502.

The operation of the data inspection device 3415 when the user inserts the mini disk 3407 into the data updating device 3405 will be described below with reference to the flowchart in FIG.

The controller 3501 refers to the authentication data field 3601 of the data management table 3503, and if there is a match with the authentication data 3416, the mini disc is copied to the data updating device 3405.
Is sent (step S3701), and the process returns to the standby state (step S3702). If there is no match, the controller 3501 adds the contents of the authentication data 3416 to the end of the authentication data field 3601 (step S3703), and writes the current time obtained from the clock 3505 in the corresponding time field 3602 (step S3703). In step S3704, the data number register 3502 is incremented (step S3705), and the authentication data generation device 3504 generates new authentication data 3416A having a different content from the authentication data 3416, and transfers it to the data updating device 3405 (step S3705). In step S3706, the process returns to the standby state (step S3702).

Also, separately from this, the controller 350
1 refers to the time field 3602 at a predetermined timing, compares it with the current time obtained from the clock 3505,
When the difference is greater than a predetermined time interval, for example, 30 days, such time and the corresponding authentication data are deleted from the time field 3602 and the authentication data field 3601, and the data number register 3502 is decremented. . This is to prevent the data management table 3503 from becoming full with unnecessary data, but this is not essential if a sufficiently large data management table 3503 can be prepared. Only when the data management table 3503 is full, the authentication data having the oldest time in the time field 3602 and the corresponding time may be deleted from the authentication data field 3601 and the time field 3602.

Note that portions of the time field 3602 and the authentication data field 3601 corresponding to the deleted authentication data are assumed to be filled in order, not as an empty area. By such a method, even if a malicious person makes a large amount of illegal copies of the mini-disc, if one of the original and the copy disc rewrites the data, the other copy disc remains at least for a certain period of time. Since rewriting cannot be performed, there is a large difference between a medium that has been illegally copied and a medium that has not been illegally copied, which has the effect of suppressing illegal copying.

When the mini disc 3407 is determined to be duplicated by the data inspection device 3415, the reproduction data is not simply discharged from the data update device 3405, but the reproduced data is erased or the like so that the mini disc 3407 cannot be reproduced.
It is also conceivable to perform operations such as collecting the mini disk 3407 itself, calling a staff member, or the like.

Next, the operation of authentication data generating apparatus 3504 will be described. The authentication data generation device 3504 generates new authentication data 3 in a form in which the uniqueness of the authentication data is guaranteed.
Preferably, 416A is provided to the minidisk 3407. This is a problem particularly when there are a plurality of data vending machines 3401 and, therefore, a plurality of authentication data generating devices 3504.

For example, as shown in FIG. 38, the authentication data 3416A is composed of 128 bits, and an ID number unique to each authentication data generating device 3504 is stored in advance. This is defined as the upper half 64 bits, and the lower 64 bits are assigned serial numbers 0, 1, 2 for each authentication data generator.
... In this way, if the authentication data 3416A is generated by different authentication data generators, at least some of the upper 64 bits are necessarily different, and if generated by the same authentication data generator, some of the lower 64 bits are changed. Since they are always different, uniqueness is guaranteed.

In order to maintain the uniqueness of the authentication data through the mini-disc that has never been updated and the updated mini-disc, the authentication data is provided in a common framework in each case. To That is,
The device that generates the authentication data 3416 when attaching the authentication data 3416 in the mini disk manufacturing stage is also regarded as one of the above-described authentication data generating devices, and given a unique ID number throughout, and the data is updated. As in the case of the authentication, 128-bit authentication data may be given.

(Tenth Embodiment) FIG. 39 shows a tenth embodiment.
1 is a block diagram of a data distribution system according to an embodiment of the present invention. The differences from the first embodiment will be described.
Parts that are not particularly described are the same as in the first embodiment, and corresponding parts are illustrated by changing 100 units to 3900 units. Note that the specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and do not limit the scope of the present invention.

[0160] The mini disc 3907 contains the billing information 39.
15 is stored together with the reproduction data 3916. As shown in FIG. 40, the billing information 3915 includes a data update time 4001, a data usage fee 4002, and a data update count 4003.

The price field 303 stored in the data information table 3909 shown in FIG.
It is assumed that the data usage fee 4002 of No. 5 stores a data usage fee per 24 hours. Billing device 3906
Has a clock 3917 and a timer 3918. The clock 3917 has year, month, day, hour, minute, and second.
The timer 3918 has only to be capable of measuring a fixed time. Here, it is set to 20 seconds. However, as will be understood later, the timer 3918 is provided to make the user interface of the data distribution system of the tenth embodiment more practical, and is not an essential component.

The key point of the tenth embodiment is that when the data is updated, the usage fee of the data stored in the mini disk 3907 is reduced by the mini disk 390.
7 is charged according to the time held.

Hereinafter, in order to start using the data vending machine 3901, the data vending machine 390 when the mini disk 3907 is inserted into the data updating device 3905 is used.
The operation 1 will be described with reference to the flowchart in FIG.

The data updating device 3905 reads out the billing information 3915 from the mini disk 3907 and transmits it to the billing device 3906 (step S4101). The billing device 3906 determines a billing amount with reference to the current time obtained from the clock 3917, the data update time 4001, and the data usage fee 4002 (step S4102).

[0165] Various methods can be considered for determining the billing amount of the billing device 3906.
It is assumed that the price is obtained at a price per 4 hours * ((current time−time at which data update was last updated) / 24 hours).

The price per 24 hours is obtained from the data usage fee 4002, the current time is obtained from the clock 3917, and the time when the data was last updated is obtained from the data update time 4301.

The charging device 3906 displays the determined charging amount on the display device 3908 (step S4103). In addition, charging apparatus 3906 activates timer 3918 (step S4104). When the timer 3918 measures 20 seconds, the data updating device 3905 sends the data to the mini disc 39.
07 (step S4105), the data vending machine 3
901 returns to the standby state (step S4106). If the user inputs the billing amount to the billing device 3906 before the timer 3918 has counted 20 seconds, the process proceeds to data selection (step S4107). Thereafter, the operation of the data distribution system until immediately before the data selection device 3902 displays the price of the data obtained from the price field 303 (FIG. 3) of the data information table 3909 on the display device 3908 is described in the first embodiment. Therefore, the subsequent operation will be described with reference to the flowchart of FIG. The data selection device 3902 displays the price of the data obtained from the price field of the data information table 3909 on the display device 3908 (step S4201). Since the user's payment is made at the next update, unlike the first embodiment, the user does not make a payment here. Also,
Since the price also depends on the elapsed time until the next update, for example, "200 yen per day" or "1
It is desirable that the user can understand the relationship between the elapsed time and the next billing amount, such as "1000 yen within a week and 50 yen per day thereafter".

The user operates the decision switch 403 shown in FIG.
Alternatively, the cancel switch 404 is pressed. When the cancel switch 404 is pressed, the data updating device 3905
Is ejected from the mini disk 3907 (step S4).
202), the data vending machine 3901 returns to the standby state (step S4203). When the decision switch 403 is pressed, the data receiving device 3904
The data is transferred to the data updating device 3905,
05 writes the transmitted data as reproduction data 3916 of the mini disk 3907 (step S420).
4). The billing device 3906 sends the current time obtained from the clock 3917 to the data update device 3905, and the data update device 3905 also writes this in the data update time 4001 of the mini disk 3907 (step S4205). The data updating device 3905 writes the contents of the price field 303 of the data information table 3909 into the data usage fee 4002 of the mini disk 3907 (step S420).
6) The content of the data update count 4003 is incremented (step S4207), and finally the mini disc 39
07 is discharged (step S4208). The data vending machine 3901 returns to the standby state (step S4203).

In this example, the charge is simply made in proportion to the time during which the data is held on the mini-disk 3907. Of course, the relationship between the time when the data is held on the mini-disk 3907 and the amount charged is It is not limited to this. Also, by using the content of the data update count 3918 for charging, the charging amount is determined or changed depending on the number of updates. For example, if the number of update times is large, the charging amount is set lower, and various other charging methods are set. It is clear that a system is possible.

(Eleventh Embodiment) FIG. 39 is also valid as a block diagram of a data distribution system according to the eleventh embodiment. Hereinafter, a difference of the operation from the tenth embodiment will be described. Note that the specific specifications, detailed configurations and data structures of the following components are merely examples for explanation, and do not limit the scope of the present invention.

Billing information 3915 of mini disk 3907
In the eleventh embodiment, the contents of the data update time 4301 and the data use record 430 are shown in FIG.
It consists of two. The data use record 4302 is the reproduction data 3 of the mini disc 3907 by the data reproducing apparatus.
Numeral 916 stores the history reproduced by the data reproducing apparatus. Here, it is assumed that the data usage record 4302 stores the total time during which the reproduced data 3916 has been reproduced by the data reproducing apparatus.

The charging device 3906 determines a charging amount by the following equation.

Billing amount = constant * (total playback time of playback data 3916 * 0.9 + time elapsed since last data update * 0.1) The total playback time of playback data 3916 is obtained by reading data usage record 4302. Can be obtained as is. The elapsed time since the last update is obtained by subtracting the content of the data update time 4301 from the current time obtained from the clock 3917.

As a result, it is possible to prevent an excessive charge for data that has been held for a long time but is not used. The weighting coefficients of 0.1 and 0.9 in the above equation are, of course, examples for explanation.

Other operations of the data distribution system are as follows. The data selection device 3902 changes the display content when displaying the price of the data obtained from the data information table 3912 on the display device 408 according to the billing calculation method. It is the same as the tenth embodiment except that it needs to be changed, and that the data reproducing device needs to be modified to leave the data usage record 4302.

Further, the method of calculating the billing amount is not limited to the example described above. For example, without using the data update time 4301, charging may be performed in proportion to the time when the reproduction data 3915 obtained from the data usage record 4302 is reproduced. In this case, the clock 3917 becomes unnecessary.

In addition, when the reproduction time of the reproduction data 3916 is equal to or less than a certain value, it is considered that it is practical to set the billing amount to zero.

FIG. 44 shows an example of a data reproducing apparatus for keeping the data use record 4302.

The data reproducing device 4401 has a CPU 440.
2, mini disk drive 4403, display device 440
4, a reproduction switch 4405, an end switch 4406, a clock 4407, and a use start time register 4408. When the user inserts the mini disc 3907 into the mini disc drive 4403 and presses the playback switch 4405, the CPU 4402 refers to the clock 4407 and stores the current time in the use start time register 4408. When the end switch 4406 is pressed, the CPU 4402
With reference to the clock 4407, the difference between the current time and the content of the use start time register 4408 is calculated, written to the data use record 4302 of the mini disc 3907, and the mini disc 3907 is ejected from the mini disc drive 4403. However, once the reproduction switch 4405 is pressed, the reproduction switch 4405 is ignored until the next end switch 4406 is pressed.

[0180]

Advantages of the Invention Of the invention, in particular the first, second, third, ninth,
In the tenth or eleventh embodiment, among the data sources holding the same data, the data source that minimizes the time for which the user waits is automatically selected, so that the waiting time of the user can be reduced. Can be. In the second embodiment of the present invention, in particular, since some data sources act as a data buffering device, the waiting time of the user can be reduced. Has less effect on average waiting time. In the fourth embodiment of the present invention, in particular,
Since a large amount of transmission time is automatically assigned to frequently selected data among different data transmitted in a time-sharing manner, the average waiting time of the user can be reduced.

2. In the seventh and eighth embodiments of the present invention, in particular, the copy media cannot be used at the same time as the original, so that a malicious user can make a large amount of illegal copies while leaving a room for a good intentional user to back up data. Can be psychologically deterred from being distributed in a form such as sale. In the ninth embodiment of the present invention, in particular, since the contents of the copy medium cannot be updated for at least a certain period after the contents of the original are updated, similarly, there is room for a well-meaning user to back up data. However, it is possible to psychologically prevent a malicious person from making a large number of illegal copies and distributing them in a form such as sale.

[0182] 3. Especially the first, second, third, ninth and tenth aspects of the present invention
Alternatively, in the eleventh embodiment, even when different types of data sources are mixed, an optimum data source can be automatically selected from the mixed data sources.

4. In the tenth or eleventh embodiment of the present invention, the amount charged to the user is not charged when the data is purchased, but based on the time the user actually holds the data, the actual use of the data, and the like. Since it is dynamically determined based on the actual playback, if it does not interest you when you actually play it, there is no charge or very little billing, so the user can easily try the data .

[0184] 5. In the sixth embodiment of the present invention, in particular, even when the user desires data that has not been digitized yet, ordering and inquiry can be performed from the same vending machine. Orders, inquiries, and the like can be made using a vending machine without worrying about whether or not it is digitized.

6. According to the fifth embodiment of the present invention, in particular, it is possible for a user to automatically extract a portion of electronic data that satisfies a search condition input by a user in a unit. In addition, it is also possible to select what unit to take out.

As described above, all of the problems described in “Problems to be Solved by the Invention” can be solved.

[Brief description of the drawings]

FIG. 1 shows a block diagram of a data distribution system according to a first embodiment.

FIG. 2 is a flowchart showing an operation of the data distribution system according to the first embodiment.

FIG. 3 shows an example of a data information table according to the first embodiment.

FIG. 4 shows a display example of a display device and an external view of a data selection device according to the first embodiment.

FIG. 5 shows an example of a data rate table in the first embodiment.

FIG. 6 is a diagram showing a state where data is transmitted by the data source in a time-sharing manner in the first embodiment.

FIG. 7 shows a block diagram of a data distribution system according to a second embodiment.

FIG. 8 shows a block diagram of a data buffering device according to a second embodiment.

FIG. 9 shows an example of a data information table according to the second embodiment.

FIG. 10 shows an example of a data rate table according to the second embodiment.

FIG. 11 is a flowchart showing an operation of the data buffering device according to the second embodiment.

FIG. 12 is a diagram showing a format in which data is stored in a buffer memory according to the second embodiment.

FIG. 13 shows a block diagram of a data distribution system according to a third embodiment.

FIG. 14 shows an example of a data schedule table according to the third embodiment.

FIG. 15 shows a block diagram of a data distribution system according to a fourth embodiment.

FIG. 16 shows an example of a data information table according to the fourth embodiment.

FIG. 17 illustrates an example of a block obtained by dividing data according to the fourth embodiment.

FIG. 18 shows an example of a data schedule management table according to the fourth embodiment.

FIG. 19 is a diagram for explaining a problem in the case where the number of blocks per time is made equal among selected data in relation to the fourth embodiment;

FIG. 20 shows a block diagram of a data search device according to a fifth embodiment.

FIG. 21 is a block diagram illustrating a configuration example of a search condition setting device according to a fifth embodiment.

FIG. 22 shows a display example of a display device in the fifth embodiment.

FIG. 23 shows an example of a data structure suitable for the fifth embodiment.

FIG. 24 shows an example of a table of contents in the fifth embodiment.

FIG. 25 is a flowchart showing an operation of the search device according to the fifth embodiment.

FIG. 26 shows a block diagram of a data distribution system according to a sixth embodiment.

FIG. 27 illustrates a display example of a display device and an external view of a data selection device according to the sixth embodiment.

FIG. 28 shows a block diagram of a data distribution system according to a seventh embodiment.

FIG. 29 illustrates an example of a data number register and a data management table according to the seventh embodiment.

FIG. 30 is a flowchart showing an operation of the data inspection device in the seventh embodiment.

FIG. 31 shows a block diagram of a data distribution system according to an eighth embodiment.

FIG. 32 shows an example of a data management table in the eighth embodiment.

FIG. 33 is a flowchart showing the operation of the data inspection device according to the eighth embodiment.

FIG. 34 shows a block diagram of a data distribution system according to a ninth embodiment.

FIG. 35 is a block diagram showing a configuration example of a data inspection device according to a ninth embodiment.

FIG. 36 shows an example of a data management table in the ninth embodiment.

FIG. 37 is a flowchart showing an operation of the data inspection device in the ninth embodiment.

FIG. 38 shows a configuration example of authentication data according to the ninth embodiment.

FIG. 39 is a block diagram of a data distribution system according to a ninth embodiment;

FIG. 40 shows an example of billing information in the tenth embodiment.

FIG. 41 is a flowchart showing a part of the operation of the data distribution system according to the tenth embodiment.

FIG. 42 is a flowchart showing a part of the operation of the data distribution system according to the tenth embodiment.

FIG. 43 shows an example of billing information in the eleventh embodiment.

FIG. 44 shows a block diagram of an example of a data reproducing device in the eleventh embodiment.

[Explanation of symbols]

 101 data vending machine 102 data selection device 103 data source selection device 104 data reception device 105 data update device 106 billing device 107 mini disk 108 display device 109 data information table 110 data rate table 111 first data satellite 112 second data satellite 113 first data server 114 second data server 109 'copy of data information table 109 "copy of data information table

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Keisuke Iwasaki 22-22 Nagaikecho, Abeno-ku, Osaka-shi, Osaka

Claims (13)

[Claims] 1. A data selection device comprising: a data selection device; a data source selection device; a data reception device; and a plurality of data sources connected to the data reception device. A data distribution system, wherein a selection device selects a data source holding the data in accordance with a specific criterion, and the data reception device receives the data selected by the data selection device from the data source. . 2. The data distribution system according to claim 1, further comprising a data buffering device, wherein the data buffering device receives data selected based on a predetermined criterion from data previously selected by the data selection device. A data distribution system for performing buffering, wherein the data buffering device is one of the plurality of data sources. 3. The data distribution system according to claim 1, wherein said plurality of data sources repeatedly transmit data in a time-division manner with a time lag, and wherein said data source selection device includes a data selection device. A data distribution system characterized by selecting a data source that has the shortest time until the data selected by the device is transmitted from the data source or the time until the data is received by the data receiving device. 4. A data selection device, a data reception device,
A data source, wherein the data source repeatedly transmits different data in a time-division manner, and the data source allocates a large transmission time to data frequently selected by the data selection device. And a data distribution system. 5. A data distribution system comprising a data selection device and a data source, wherein when there is no electronic data desired by a user in the data source, said electronic data, or the same or similar electronic data. A data distribution system, wherein non-electronic data of contents is ordered from a data selection device to an organization, an individual, or a device such as a trader other than a data source. 6. A duplicate data detection system comprising: a data inspection device; a plurality of data storage devices; and a data communication device for transmitting or transmitting data between the data inspection device and the data storage device. Each data storage device is connected to or integrated with the data communication device at all times or as needed, and stores data including an authentication code uniquely given to each data storage device in normal use. The data communication device transmits information including an authentication code, which is stored in the data storage device, to the data inspection device, and the data inspection device transmits two information based on the information transmitted from the data communication device. Check whether these different data storage devices store a common authentication code or have stored it in the past, and If it is determined, any or all of the data storage device that stores the authentication code or the data storage device that stores the authentication code in the past is determined to be a duplicate. 7. The duplicate data detection system according to claim 6, wherein the data communication device transmits information including the authentication code to the data inspection device in a predetermined timing pattern and includes the same authentication code. When the timing at which the information is sent is different from the predetermined pattern, it is determined that a plurality of data storage devices store the same authentication code. Any of the data storage devices that store
Alternatively, a duplicate data detection system characterized in that it is determined that all are duplicates. 8. The duplicate data detection system according to claim 6, wherein the data inspection device generates another authentication code or generates another authentication code for the data storage unit whose stored authentication code is known. Data through the data communication device to directly or indirectly rewrite the authentication code of the data storage device, and the data inspection device thereafter rewrites the data permanently or within a predetermined period. If a data storage device that transmits information containing the same authentication code as the previous authentication code of the data storage device is detected, a plurality of data storage devices store the same authentication code or have stored the same authentication code in the past. If the authentication code is determined as such, either the data storage device storing the authentication code or the data storage device storing the authentication code in the past, or Or a duplicate data detection system characterized in that all or all are determined to be duplicates. 9. The duplicate data detection system according to claim 6, wherein the data communication device is a part of a data reproduction device, and the data storage device includes a data storage device in addition to the authentication code. The playback device stores playback data to be played back by the playback device, and the data playback device determines that the copy is a copy by the data inspection device with respect to the data storage device that is determined to be the copy by the data inspection device. A duplicated data detection system that performs an operation different from an operation for a data storage device that has not been provided. 10. The duplicate data detection system according to claim 6, wherein the data communication device is a part of a data reproduction device, and the data storage device has a data code in addition to the authentication code. The data updating device stores reproduced data reproduced by the reproducing device and updated by the data updating device. The data updating device copies the data storage device determined to be a duplicate by the data inspecting device by the data inspecting device. A duplicated data detection system that performs an operation different from an operation performed on a data storage device that is not determined to be a storage device. 11. A data storage device, a data update device, and a charging device, wherein the data storage device stores data and a write date / time or a date / time and time by the data update device, and the data update device includes: Writing or rewriting data and fee information in the data storage means, the charging device, the current date and time or date and time and time,
A data distribution system characterized in that a charge amount is determined from a date and time of writing of data stored in a data storage means by a data updating device or a difference between the date and time and the time. 12. The data distribution system according to claim 11, wherein the data storage means stores a charge per unit date / time or time in addition to the date / time or date / time and time written by the data and data update device. And
The billing device determines a billing amount from a difference between a current date and time or a date and time and time, a date and time or a date and time and a time when data stored in the data storage unit is written by the data updating device, and a charge per unit date and time or time. A data distribution system, characterized in that: 13. A data storage means, a data use recording device, a data reproduction device, a billing device, and a data use record reading device provided in the billing device, wherein the data storage means stores data. The data use recording device records the time, date, length of time, number of times, etc., when the data stored in the data storage means is used by the data reproduction device, and the charging device records the data use recording device. A data distribution system wherein a recorded content is read by a data use record reading device to determine an amount to be charged.