JP2987942B2 - Data search method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search method suitable for use in, for example, a disk reproducing apparatus for reproducing data recorded on a data disk.

[0002]

2. Description of the Related Art In recent years, data such as dictionaries and encyclopedias are recorded on an optical disc, and the data can be stored semi-permanently.
2. Description of the Related Art A D-ROM disk and a disk reproducing apparatus for reproducing recorded data recorded on the disk are known.

[0003] This so-called CD-ROM disc is
The so-called C, one of the standards for digital audio discs
This is a disk in which the standard of D (compact disk) is extended and data of a recording format as shown in FIG. 23 is recorded instead of audio data of the CD.

In this data recording format, when data is recorded on a disk, data of a predetermined unit is collected into one "block", and reading is performed for each block. The length of the block is 1 / the same as the length of the sub-code block of the audio CD.
It is defined as 75 seconds (that is, there are 75 blocks in one second), and the absolute address of the subcode Q is used for searching for the block as in the case of the audio CD. The total amount of data that can be recorded in the above block is
For example, it is 2352 bytes.

The configuration of this block will be described with reference to FIG.

FIG. 23A shows a format of "mode 0" used for a lead-in or lead-out portion and a front and rear delimiter of a recording area. A 12-byte synchronization signal 201 and a 4-byte header 202 are shown. And the rest 2
It is composed of a data area 203 in which "0" is written in all 336 bytes.

The header 202 has a block address 2
02a, minute time data 202b of the block, second time data 202c of the block, block number 202d of the block, and mode data 202e.

Next, FIG. 23B shows a "mode 1" block for recording data requiring reliability such as character data and computer data.
1, a header 202, a user data area (2048 bytes) 205 which is a recording area of target information, and an EDC (error detection code) 20 which is a code for detecting an error.
6, a space area 207 which is all "0" and an ECC (error correction code) 20 which is a code for correcting an error.
8 (276 bytes). ECC20 above
8 is composed of a 172-byte P parity 208a and a 104-byte Q parity 208b.

Next, the block shown in FIG. 23 (c) is used for recording data which can be corrected by interpolation even if an error occurs, such as sound or image, in "mode 2".
, And includes a synchronization signal 201, a header 202, and user data 210 of 2336 bytes.
This block does not have the additional error correction code, but can write the user data to everything after the header 202.

By the way, in order to search data recorded in accordance with the CD-ROM format as described above, it is necessary that the logical format of the recorded data be specified. As one of the logical formats, an ISO (International Standard)
ards Organization) 9660 standard is known.

The ISO 9660 standard defines a logical format as shown in FIG.

First, a volume descriptor 211 is recorded at a predetermined absolute address on the CD-ROM disk, that is, at a position of 2 sectors and 16 sectors.

The volume descriptor 211 includes:
How the disks are logically organized, root directory location information for standard file system structure, copyright records, file names, publisher (company)
Etc. are recorded.

In the root directory 212 stored at the address indicated by the root directory position information, for example, the position and length of each file 213 recorded on the data disk are recorded.

The file 213 is, for example, a Japanese dictionary, a Chinese-Japanese dictionary, an English-Japanese dictionary, a Japanese-English dictionary, etc., recorded on a data disk.

The recording format of the file 213 is up to the ISO 9660 standard. For this reason, the person who issued the data disk records, for example, the text data in the file 213 in an arbitrary format, and has independently developed a method for searching the text data recorded in the arbitrary format.

This text data search method is written on, for example, a floppy disk or an IC card and prepared as data search software.

The user, together with the data disk,
The person who purchased the data search software and issued the data disk operated a playback device or the like in accordance with a search method uniquely developed to search for arbitrary data.

[0019]

That is, as described above, according to the ISO9660 standard, the file 213 is used.
Only the recording format up to and including the file 213 is recorded. For example, text data and the like are recorded in an arbitrary format for each person who issues a data disc, and the text data recorded in this arbitrary format is searched. Since the method was developed independently, the data retrieval method differs for each data disk or for each data disk issuer, and the development time, development costs, personnel costs, etc. of the retrieval method are increased, resulting in high costs. Was.

Further, since the search method is different for each data disk, the user needs to learn the search method for each data disk, and must purchase search software for each data disk, which is expensive. The burden was heavy.

This has had a bad influence on the versatility of the data disk and the reproduction equipment of the data disk.

Since the search software must be prepared by writing it on another medium such as a floppy disk or an IC card, a drive system for the data disk and a drive system for the search software are required. However, the size of the playback device itself becomes large, and it is difficult to cope with recent downsizing of the device.

At present, there is also known a type in which a plurality of data discs can be searched by one type of search software only when the application is limited to the dictionary type. However, this is not limited to the dictionary type. Is not practical.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-mentioned problems, and is directed to a data disc capable of unifying a data recording format on a data disc and a method for searching software for searching the data disc. The purpose is to provide a data retrieval method.

[0025]

SUMMARY OF THE INVENTION The present invention provides a volume descriptor including at least data disc identification information and root directory position information, and a root directory including the position of each data file and, if necessary, the position of a lower directory. In a data search method for a data disc in which a file designated by the root directory is recorded in a data recording area, the file includes text data including at least character data and various types of data for searching the text data. A file name in the root directory is displayed by using a data disc on which search index information and various kinds of search index information and document management information for searching for text data are recorded, and one of the displayed files is displayed. Choose one and select above A data search for reading document management information of a file, displaying various search methods based on the document management information, and performing a search based on index information corresponding to a search method selected from the displayed various search methods. The present invention is also directed to a method of using the data disc, wherein a recordable item name is recorded as the various index information, and a recording start address of the index information corresponding to the searchable item name is recorded. When the compound search is selected from among the various search methods performed, the search item name is displayed, search item data corresponding to the displayed search item name is input, and the input search item data A data search method for searching based on index information and reading and displaying text data corresponding to the above search item data And by solving the problems described above.

[0026]

According to the present invention, a volume descriptor including at least data disc identification information and root directory position information, a root directory including a position of each data file and, if necessary, a lower directory, and a position determined by the root directory. In the data search method for a data disc in which a specified file is recorded in a data recording area, the file includes text data including at least character data, various search index information for searching the text data, Using a data disc on which various search index information and document management information for searching text data are recorded,
In order to perform a compound search, the searchable item names as the various index information and the recording start address of the index information corresponding to the searchable item names are recorded, and the data recording format is unified. Using a disk, display the file names in the root directory, select one of the displayed files,
The document management information of the selected file is read, various search methods are displayed based on the document management information, and a search based on the index information corresponding to the search method selected from the displayed various search methods is performed. According to the present invention, when a compound search is selected from the displayed various search methods, the search item name is displayed, and a search corresponding to the displayed search item name is performed. Standardize the data search method by inputting item data, searching the input search item data based on the index information, and reading and displaying the text data corresponding to the search item data Become

[0027]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a data search method according to the present invention will be described below with reference to the drawings.

FIG. 1 shows a logical format of a data disk used in the data search method according to the present invention.

The volume descriptor 21 shown in FIG.
1, root directory 212 and each file 213
Is defined in the same manner as the logical format defined in ISO9960.

Each of the files 213 is a file corresponding to the main body of a dictionary or the like, and is mainly composed of character data. Then, in order to efficiently perform various reproduction and search methods as in the case of books such as dictionaries, the data is constituted by data as shown in FIG. 2, for example.

Here, the data search method according to the present embodiment includes a word search (front match and backward match), a condition search,
There are menu search and compound search.

The word search is a search method for searching for an applicable item by inputting a word to be searched. A head-on search and a head-match search in which the head of the word to be searched is input as a search word (keyword). There is a backward match search in which the end of a word is input as a search word (keyword).

The above condition search is a search method in which a keyword is freely input and an item including the keyword in common is searched.

The menu search is a search method for selecting an item to be viewed from a menu displayed on a screen so as to search for a corresponding item from a table of contents of a book.

The compound search is a search method in which a keyword is input according to a preset condition and a corresponding item is searched.

In FIG. 2, the file 213 includes, for example, a document management block 75 and various search indexes 7.
6, title data 68, body data 66, and external character font pattern data 79.

The document management block 75 is located at the head of each of the files 213, and
3 shows an address where the text data 66, various search indexes 76, and the like stored in the memory are recorded, and has a configuration as shown in FIG. 3, for example.

In FIG. 3, the document management block 75
Is composed of the number of entries 80, the document type 81, the protection information 82, and the identifier 83.

The number of entries 80 is the total number of entries indicating the total number of identifiers 83 recorded in the document management block 75.

The document type 81 corresponds to the file 213
Indicates the document type recorded in. This is, for example, “00H” for a Japanese dictionary, and “1H” for a Kanji dictionary.
0H "," 30H "for English-Japanese dictionaries," 40H "for modern lexicons," 50H "for encyclopedias," 60H "for general books," 70H "for thesaurus.
H "and" 80H to FFH "are written as document type codes as reserves for displaying books to be published in the future.

The protection information 82 is information recorded in 8 bits (1 byte) to protect a copyrighted work or the like that requires data confidentiality.
"X" is forbidden to quote, "000000XX" is forbidden to quote,
“00000X1X” is prohibited printing, “00000X0”
“X” indicates printing permission, “00000XX1” indicates display prohibition,
“00000XX0” is recorded as display permission. Note that “X” is “0” or “1”, and
The above printing prohibition means prohibiting hard copy of the screen,
The above quotation prohibition is to prohibit copying into a document.

The identifiers 83 are data recorded for identifying document data, hierarchical indexes, external character data, and other data. Each identifier 83 has a head block number 84, a block number 85, and a version number 86, respectively.
Etc.

The head block number 84 is a relative block number in which a document management block recorded at the head of a file 213 described later is recorded as "1" and thereafter recorded from "2".

The block number 85 is data indicating how many blocks of the data indicated by the identifier 83 are recorded from the document management block.

The version number 86 is data indicating the standard version number of the data structure of the recorded data. In FIG. 3,
The flag 87 is not referred to in the data disk according to the present embodiment. The reserve 88 is blank without writing anything for data to be added in the future.

The identifier 83 is categorized into the following codes and recorded.

First, as the document data, for example, the text data is “00H”, menu items corresponding to books, tables of contents, indexes, etc., menu items obtained by further dividing the menu items, and text corresponding to the menu items. The menu data indicating the data address is recorded as "01H", and the copyright display data is recorded as "02H". The text data 9 indicated by the identifier “00H” is stored in the file 2
13 and the above “01H”
In the menu data indicated by, an identifier indicating only the first menu of each menu item is recorded. Subsequently, as the document data, the heading data (character data for display) of “kana input” and “notation input” of the condition search is set to “0”.
3H "," 04H "is the heading data of" Kana input "of the head search of the word search, and" 05 "is the heading data of" Notation input "of the head search of the word search.
H ”,“ Kana input ”for backward match search among the above word searches
The heading data of “06H” is “06H”, the heading data of “notation input” of the word matching search is “07H”,
The heading data of “kana input” and “notation input” in the menu search was recorded as “0DH”. Note that the above “0D
The heading data of “Kana input” and “Notation input” of the menu search recorded with “H” is only in the viewpoint management block described later, and the identifiers “08H” to “0CH” are reserved. "Kana input" described below is a method of inputting the way of reading the name as it is, and "notation input" is a method of inputting the name as written.

Next, as the identifier of each index, the search index for which the reference is prohibited is set to “30”.
H ", the notation index for notation search forbidden to refer to is" 60H ", the index for backward match search of" kana input "in the word search is" 70H ", and the match for" word input "in the word search is backward match Set the search index to "71
H, “Kana input” and “Notation input”, the index for conditional search is “80H”, “Kana input” for word search is “90H” for front match search index, and “Notation input” for word search Is recorded as "91H", and the index for menu search of "input of kana" and "input of notation" is recorded as "A1H".
The menu search index "A1H" was recorded only in the viewpoint management block.

Next, the external character font pattern data 7
Reference numeral 9 denotes data in which characters other than the characters specified by JIS (Japanese Industrial Standard) are stored in a dot pattern, and are actually written in the document management block 75. The identifiers of the external character font pattern data 79 are "F1H" for the 16-dot full-width external character font data, "F2H" for the 16-dot half-width external character font data, and "F3H" for the 24-dot full-width external character font data. "F4H" for half-width character font pattern data of a dot, "F5H" for 30-byte full-width font character pattern data, "F6H" for a 30-dot half-width character font pattern data, and "F7H" for a 48-dot full-width font character pattern data ,
48-dot half-width external character font pattern data is set to "F8
H ".

In addition to the above codes, the identifier "FF
H "is a code indicating a viewpoint management block.

The disc reproducing apparatus described later selects the specified data by looking at the identifier 83, and reproduces the data indicated by the head block number 84 and the number of blocks 85.

Next, returning to FIG.
Reference numeral 8 denotes character data for displaying a headline of a word or the like finally searched, and the above-described various search indexes 7
6 respectively.

The text data 66 is data in which the meanings and results of the searched words and the like are written.
This is the data that is ultimately displayed as search results.

As described above, each data 75, 76, 68, 6
The file 213 composed of 6, 79 has a structure as shown in FIG.

That is, the structure shown in FIG. 4 is a structure called a so-called tree structure. The disc reproducing apparatus reads the document management block 75 and jumps to the index of the designated search method, which will be described below. A search is performed using the hierarchical index 76a, and the heading of the search word is read out from the title 68 and displayed, and the meaning of the search word is read out from the body data 66 and displayed.

The hierarchical index 76a is specifically configured as shown in FIG.

In FIG. 5, the hierarchical index 76a is composed of a plurality of index blocks from the primary index, which is the highest index, to the n-th index, which is the lowest index. One primary index block 61 is used as an index, a plurality of secondary index blocks 62, 63,... Are used as secondary indexes, and n-th index blocks 64, 65 are used as an n-th index.
.., And the entry key of the upper-level block has the maximum key in which the next-level block has the largest physical address described later in the block. That is, for example, the entry key “BOWL” of the primary index block 61 is held as the maximum key in the secondary index block 62 which is the next index block corresponding to the entry key of “BOWL”. The entry key “DIRE” of the primary index block 61 is held as the maximum key in the secondary index block 63 which is the next index block corresponding to the entry key of “DIRE”.

By adopting such a configuration, even if a huge amount of data exists, the first index to the n-th index
The search is advanced in order to the next index, and the title and the meaning of the specified search word or the like can be quickly searched and displayed.

Each of the index blocks 61, 62,
63 are sequentially recorded after the document management block 75 from the primary index block having the lower physical address to the n-th index block group having the higher physical address, as shown in FIG. In other words, index blocks at the same level are always recorded together without being mixed with index blocks at different levels.

As shown in FIG. 7, the index block group having the plurality of index blocks includes index blocks B1 to Bn.
It is recorded from a lower physical address to a higher physical address.

The entry key recorded in each block of the upper index such as the primary index or the secondary index is, for example, as shown in FIG. It has a key length, an entry key recorded as character data, and address information of a block of the next index corresponding to the entry key. On the other hand, the entry key recorded in each block of the n-th index is recorded with the key length and character data of the recorded entry key, for example, as shown in FIG. 8B. It has an entry key, address information of the title data 68 corresponding to the entry key, and address information of the text data 66 corresponding to the entry key.

Next, the format of the entry key recorded in the block of the lowest level (n-th index) of the search index corresponding to each search method will be described.

First, in the case of the above word search, "beginning with"
The basic entry in the case of “notation” is, for example, an ID code (00H), a key length of an entry key, and an entry of character data as shown in FIG. A key, address information of the text data 66 corresponding to the entry key, and address information of the title data 68 corresponding to the entry key.

The key items in the case of “Kana” are shown in FIG.
As shown in (b), the ID code (80H), the key length of the entry key, the number of members, and the entry key of character data.

As shown in FIG. 9C, the member items include an ID code (C0H), a key length of an entry key,
It is composed of the number of members, the address information of the text data 66 and the address information of the title data 68.

Next, in the case of the above condition search, the basic entry is, for example, as shown in FIG.
0H), the key length of the entry key, the entry key of the character data, the address information of the text data 66 corresponding to the entry key, and the address information of the title data 68 corresponding to the entry key.

Further, as shown in FIG. 10B, the group entry key items are, for example, an ID code (80H), a key length of the entry key, the number of members, an entry key of character data, and the title corresponding to the entry key. It is composed of address information of data 68.

The member item is, for example, as shown in FIG.
As shown in the figure, the ID code (C0H) and the address information of the body data 66 corresponding to the member item.

Next, in the case of the menu search, the menu data is, for example, an ID code (1F) as shown in FIG.
43), character data of menu data, ID code (1
F63) and the address information of the text data 66 corresponding to the menu data.

Next, in the case of the above complex search, a viewpoint management block as shown in FIG. 12 is provided.

This viewpoint management block requires the document management block 75 indicating the index position for each search item for documents having a plurality of search methods. This is a block in which the correspondence is arranged, and is composed of data for displaying a search item and data indicating an index address corresponding to the search item.

By having the viewpoint management block, it is possible to set conditions for each search item and perform a search with a single search item or a compound search with an AND of each search method.

In FIG. 12, the view management block indicates the number of view entries 51 indicating the number of views recorded in the view management block, and the number of indexes corresponding to the search method represented by the subsequent search item name. The number of identifier entries 53 and the priority 54 indicating the priority of the search item
And a search item name 55 which is character data, and a document management block 56 in which a head address and the like corresponding to the search item name 55 are recorded. The document management block 56 has substantially the same configuration as the document management block 75 described above, and a description thereof will be omitted.

Here, in the compound search, a plurality of keywords are input to perform a search. However, in most cases, the keywords for the search are limited, and an erroneous search occurs if the user does not recognize this keyword. There is a risk. For this reason, an input candidate table in which keywords that can be referred to by the user at the time of keyword input are arranged is displayed.

The input candidate table has a tree structure similar to the item list for performing the menu search.

This input candidate table is, for example, as shown in FIG.
As shown in (a), character data 72 of each keyword is recorded between a menu identifier 71 and a menu end element 73, and address information 74 including a block number and an offset value is recorded after the menu end element 73. doing.

More specifically, for example, an input candidate table to be referred to when selecting a type of meal using a document as a “restaurant guide” is, as shown in FIG. 13B, a menu identifier 71 and a menu end element 73. Character data 7 between
2, keywords such as “Japanese food”, “Western food”, “Chinese food”, “café / snacks”, etc. are recorded, and when they are displayed, they are displayed in FIG. As shown, “Japanese food”, “Western food”, “Chinese food”, and “café / snacks” are displayed in the recording order of the keyword of the meal type.

The user selects an arbitrary keyword from the keywords displayed using the icon 93 and inputs the keyword.

The lowest-level format of such a composite search index is composed of a basic entry and a group entry as shown in FIG. 14A, and the basic entry is as shown in FIG. ID code (00
H), the key length of the entry key, the entry key of the character data, the address information of the text data 66 corresponding to the entry key, and the address information of the title data 68 corresponding to the entry key.

The above-mentioned group entry is shown in FIG.
As shown in (d), the ID is composed of an ID code (80H), a key length of an entry key, the number of members, and an entry key of character data. The member item is an ID code (C0H) as shown in FIG. , The address information of the body data 66 corresponding to the member item, and the address information of the title data 68 corresponding to the entry key.

Under the file structure described above,
The address information of each piece of data of the application software is managed by a relative block number starting from the document management block, and the application software reads out the document management block 75, thereby responding to the information in the document management block 75. You can get the addresses of various indexes and body data.

Here, the data disk as described above is reproduced by, for example, a disk reproducing apparatus as shown in FIG.

In FIG. 15, the disk reproducing apparatus
A reproduction system 2 for reproducing the data recorded on the data disk 1, an audio signal processing system 3 mainly for processing the audio data of the read data, and an image display for performing the search processing of the read data. And a data processing system 4.

In the reproduction system 2, the CPU 5 operates the laser light source driving circuit 1 according to the input from the keyboard 31.
0, controls the thread feed motor 11, the 2-axis actuator drive circuit 12 and the motor drive circuit 13. That is, the CPU 5 controls the motor drive circuit 13 to change the spindle motor 6 to, for example, CLV (constant linear velocity) or CAV.
(Constant angular velocity). At the same time, the sled feed motor 11 is controlled to move (coarsely move) the pickup 7 including the objective lens 14, the photodetector, the optical element for detecting a focus error, and the like attached to the biaxial actuator to a predetermined track on the data disk 1. That is, the so-called radial control of the disk is performed. And
By controlling the two-axis actuator drive circuit 12, the so-called tracking control, in which the objective lens 14 of the pickup 7 is moved up and down to adjust focusing, and the objective lens 14 is moved right and left to irradiate a beam spot on an arbitrary track, is performed. As a result, the data recorded on the data disk 1 is reproduced.

On the data disk 1,
For example, a subcode area and a data area are provided for each frame, and a synchronization signal,
Position information, time information, and the like are written. The above data is written in the data area. A data signal read from such a data disk 1 is supplied to an error detection and data detection circuit 8 so that
For example, a so-called sum or difference is obtained, and a focus error or a tracking error is detected. The focus error and the tracking error are determined by the two-axis actuator drive circuit 1.
2 is supplied. The two-axis actuator drive circuit 12 drives the objective lens 14 in accordance with the focus error signal and the tracking error signal, and controls so that focusing and tracking are normally maintained and data is read accurately. The laser beam applied to the data disk 1 is controlled by, for example, detecting an output from a laser diode (not shown) and supplying this detection signal to the laser light source drive circuit 10. That is, the laser light source drive circuit 10 controls the power of the laser beam applied to the data disk 1 in accordance with the detection signal so that the power is always constant during reproduction.

On the other hand, a reproduction signal including a synchronization signal and time information reproduced from the data disk 1 is supplied to a CD signal processing circuit 15 of the signal processing system 3 via an error detection and data detection circuit 8. The CD signal processing circuit 15 includes a so-called audio CD in which the mounted data disk records audio data, or character data in which character information is recorded as character information such as a dictionary or an encyclopedia. Is detected as a so-called CD-ROM disc in which the CP is recorded.
Supplied from U5. The CD signal processing circuit 15 separates the supplied reproduction signal into a sub data signal such as a synchronization signal and time information and a main data signal. When the main data signal is audio data, the audio data signal is converted to a D-signal. A
It is supplied to a (digital-analog) converter 16. DA
The audio data signal supplied to the (digital-analog) converter 16 is converted into an analog signal, supplied to an audio reproducing circuit 17, and output as an audio signal via an output terminal 18. When the data signal supplied to the CD signal processing circuit 15 is the character data signal or the like, the CD signal processing circuit 15 converts the character data signal into a C signal.
It is supplied to the D-ROM signal processing circuit 19. CD-ROM
The character data signal supplied to the signal processing circuit 19 is read out via a RAM (random access memory) 20, which is a memory for temporary storage, according to a signal supplied from the CPU 5. The data bus 21 is connected to a ROM 22 and a RAM 23 in which programs and the like are recorded. The read character data signal and the like are transmitted via the data bus 21. And
A display image is recorded and formed in the video RAM 26 by a kanji pattern or the like read from the kanji ROM 24 in response to the character data signal, and a display image in the video RAM 26 is read by the display controller 25 in response to a signal from the CPU 5. For example, LCD (Liquid Crystal Display)
Are displayed on the display unit 27.

When an external interface is connected to the connector 28, for example, the switch 29 is turned on simultaneously with the connection, the CPU 5 is reset, and signal processing is performed by an instruction from the interface. I have. The command from the interface is processed by the external interface processing circuit 30, and the processed data is transmitted via the data bus 21 to the display unit 27 as described above.
Will be displayed.

In such a disk reproducing apparatus, since the man-machine interface for data processing and display does not require strict time processing, these are processed as a main routine, and other processing is performed by an interrupt routine. The entire signal processing is entirely processed by the single CPU 5, and the software system between the host CPU and the drive CPU uses the command packet ← → status code system from the bus line system. When it is desired to control the machine from an external host, the main routine is replaced with a HALT (HALT) instruction and a bus line control routine is started.

The disk reproducing apparatus provided with the signal processing system configured as described above has the appearance as shown in FIGS. 16 and 17, for example.

In FIGS. 15 and 16, the apparatus main body 44 incorporates the reproduction system 2, the CPU 5, the audio signal processing system 3, and the data processing system 4 excluding the display unit 27 composed of, for example, an LCD.

A disk cartridge containing a CD-ROM on which data such as a dictionary or an encyclopedia is recorded is mounted on the apparatus main body 44. In addition, as shown in FIGS. 16 and 17, the alphabet key 41, the cursor movement key 42, and the cursor are moved to the surface facing the front surface when the device main body 44 is closed. A key operation unit 45 in which keys such as a selection key 43 for selecting a selection item are arranged is rotatably mounted via a support shaft.

A cartridge holder 46 for inserting and removing a disk cartridge containing a CD-ROM is provided on the back surface of the key operation unit 45 opposite to the surface on which the keys are arranged.
Are arranged.

The cartridge holder 46 is supported by the apparatus main body 44 so as to be rotated following the rotation of the key operation section 45. Further, the device main body 44
A cover 47 that covers the key operation unit 45 and closes the upper surface of the apparatus main body 44 is rotatably mounted via a support shaft 48.

The inner surface of the lid 47, that is, the surface facing the key operation unit 45 when the lid is opened from the apparatus main body 44 as shown in FIG.
Display unit 2 for displaying information such as character information read from the
7 are provided.

The lid 47 provided with the display unit 27
When the disc player 40 is used, the surface of the key operation unit 45 is opened as shown in FIG. 16, and the disc player is rotated to a desired rotation position at which the display screen of the display unit 27 is easy to see. So that
It is supported by the apparatus main body 44.

When the disk reproducing device 40 is not used, the lid 47 is closed on the key operation portion 45 when not in use, so that the disk reproducing device 40 is reduced in size to a rectangular shape and is easily portable.

Next, a description will be given of a specific reproduction display operation of the disc reproducing apparatus relating to the above-described composite search with reference to a flowchart shown in FIG. 18 and a specific display example shown in FIG.

This flowchart is started when a data disk is mounted on the disk reproducing apparatus.

Next, in step 101, the above-mentioned index information corresponding to, for example, TOC data of an audio CD is read from the data disk previously mounted in the search, and the index information is loaded into, for example, a RAM (random access memory) or the like. Proceed to.

In step 102, each of the above-described search methods corresponding to the index information fetched into the RAM is displayed on the display means as characters, and the flow advances to step 103.

More specifically, if the file recorded on the attached data disc is, for example, a “restaurant guide” for searching for a desired restaurant, FIG.
As shown in FIG. 9 (a), "this disc is a restaurant guide" and the name of the data disc are displayed. Next, as shown in FIG. Word search (prefix match), compound search "is displayed.

The user operates the icon 93 to select an arbitrary search method from the displayed search methods. In step 103, it is determined whether or not the selected search method is a compound search. If No, step 104
The processing proceeds to another search method (in this case, word search (front match)), and in the case of Yes, the processing proceeds to step 105.

At step 105, the selected compound search data is loaded from the data disk into the RAM, and the routine proceeds to step 106.

At the step 106, the data for the compound retrieval fetched into the RAM is displayed, and the routine proceeds to a step 107.

More specifically, for example, as shown in FIG. 19C, "What is the name of the shop?", "What is the type of meal?", "Where is the place better?" Displays a table for inputting keywords required for complex search such as "?". The user may input a keyword that suits his / her wish into the table for inputting the keyword. If the user does not know the keyword, he turns on a help key (not shown).

In step 107, it is determined whether or not the help key has been turned on. If No, the process proceeds to step 110 to start the search. If Yes, step 10
Proceed to 8.

In step 108, an input candidate table in which keywords to be currently input are collected is displayed, and the flow advances to step 109.

In step 109, the keyword selected by the user, which is the search result of the input candidate table, is displayed, and the flow advances to step 110.

That is, if the user does not know the keyword to be input in the item of "type of meal", the user turns on the help key. Thereby, the display screen displays, for example, FIG.
As shown in (d), “Japanese food”, “French food”,
A keyword of a rough meal type such as "Chinese cuisine" or "Italian cuisine" is displayed. If the user operates the icon 93 and selects, for example, “Japanese food”, the user can select the type of meal from the selected “Japanese food” more finely. For example, FIG. As shown in FIG. 5, keywords such as "sushi", "tempura", and "noodles" which are types of meals corresponding to the "Japanese food" are displayed. The user operates the icon 93 from among them, and selects an arbitrary meal type, for example, “sushi”. As a result, the selected keyword “sushi” is input in the “meal type” field.

[0110] Similarly, "Where is the place good?"
If you do not know the keyword to enter in the item, turn on the help key. Thus, for example, as shown in FIG. 19 (f), keywords of places where one wants to eat roughly, such as "New York", "Los Angeles", "San Francisco", "Chicago", are displayed on the display screen.
If the user operates the icon 93 and selects, for example, “New York”, the user selects a new place to eat from “New York”, for example, as shown in FIG. ), Keywords such as "Manhattan" and "Los Angeles", which are areas corresponding to "New York", are displayed. The user operates the icon 93 to select an arbitrary area, for example, “Manhattan”.
As a result, the selected keyword “Manhattan” is input in the “meal type” field.

In step 110, a search is performed based on the keyword input as described above, and step 11 is performed.
Proceed to 1.

In the step 111, the retrieval result is read out from the disc and displayed, and the processing is terminated.

That is, the above search is performed, and if there are a plurality of restaurants that meet the user's desire indicated by the input keyword, for example, as shown in FIG. Titles of a plurality of documents such as “Manhattan sushi”, “Ichiban sushi”, and “Long Island sushi” are displayed.If the user operates the icon 93 and selects, for example, the above “Japanese sushi”,
On the display screen, a telephone number, a price, the number of seats, a simple map to the shop, and the like are displayed as shown in FIG.

Next, the search operation of the word search will be briefly described.

It is assumed that an English-Japanese dictionary and a Japanese-English dictionary are recorded as documents on the loaded data disk.

First, when such a data disc is set in a disc reproducing apparatus described later, for example, FIG.
As shown at 0, the name of the document recorded on the data disc, such as "This disc is an English-Japanese dictionary, Japanese-English dictionary", is displayed.

The user operates the icon 93 to select an arbitrary document from the displayed documents.

Here, for example, if an English-Japanese dictionary is selected from the above-mentioned documents, the disc reproducing apparatus reproduces the document management block 75 of the file of the “English-Japanese dictionary”, and for example, as shown in FIG. "Word search (prefix), word search (suffix), condition search,
Menu search ”is displayed.

The user operates the icon 93 to select an arbitrary search method corresponding to the word to be searched.

For example, if the user wants to search for a word beginning with "MAN", the user selects a word search (front match) from the above search methods.

As a result, the disc reproducing apparatus reproduces the identifier 83 of the document management block in which the address of the index for word search (front match) is recorded, and reproduces the index of the index for word search (front match). While preparing for reproduction, for example, as shown in FIG. 21B, the characters "Please enter a search word" are displayed on the display screen.

According to the above, when the user inputs the above-mentioned "MAN" character, a search is performed according to the above-mentioned tree structure.
For example, as shown in FIG. 21C, words starting with "MAN" are read from the title data 68 and displayed on the display screen.

The user places an arbitrary word, for example, “man-full” from the displayed words on the cursor 9.
When the selection is made by using 3, for example, as shown in FIG. 21D, the meaning of the selected word "man-full" is displayed.

On the other hand, if the user wants to search for a word ending with "MAN", the user operates the icon 93 as shown in FIG. ).

As a result, the disc reproducing apparatus reproduces the identifier 83 of the document management block in which the address of the index for word search (backward match) is recorded, and reproduces the index of the index for word search (backward match). While preparing for reproduction, for example, as shown in FIG. 22 (b), the characters "Please enter a search word" are displayed on the display screen.

According to the above, when the user inputs the above-mentioned "MAN" character, a search is performed according to the above-mentioned tree structure.
For example, as shown in FIG. 22C, a word ending with "MAN" is read from the title data 68 and displayed on the display screen.

When the user selects an arbitrary word, for example, “space-man” from the displayed words by using the cursor 93, for example, as shown in FIG. "Space-ma
The meaning of "n" is displayed.

As is clear from the above description, the data search method according to the present embodiment includes the volume descriptor 211 including at least the data disc identification information and the root directory position information, the position of each data file and the Directory 212 including the position of the lower directory, and the root directory 212
In a data disk in which a file 213 whose position is specified by the file data 213 is recorded in a data recording area, the file 213 contains text data 66 including at least character data.
And various search indexes 76 for searching the body data 66, and various search indexes 76
And a document management block 75 for retrieving the body data 66, recordable item names as the various search indexes 76, and a recording start address of the index information 76 corresponding to the searchable item names. When a search is performed, the file name in the root directory 212 is displayed, one of the displayed files 213 is selected, and the document management block 75 of the selected file 213 is read out during the search. Various search methods are displayed based on the document management block 75, and a search is performed based on the search index 76 corresponding to the search method selected from the displayed various search methods. When the combined search is selected from the various search methods to be performed, the above-mentioned search item name is displayed, Enter the search item data corresponding to the serial displayed search item name, the search item data the input search based on the search index 76,
By reading and displaying the text data 66 corresponding to the above-mentioned search item data, the data recording format and the data search method can be unified, and a composite search can be performed.

Further, by unifying the data recording format and the data search method, the programmer of the data search method can reduce the development time, development cost, labor cost, etc. The apparatus and the like can be manufactured at low cost, and the user can use a plurality of data disks by learning the search method once because the search method is the same even for different data disks.

Further, by unifying the above data search method, the software recording the search method can be integrated into a disk player or the like, for example, by making it into an IC. Therefore, the size of the disk reproducing apparatus can be reduced, and the versatility of the data disk, the disk reproducing apparatus, and the like can be improved.

[0131]

According to the data retrieval method of the present invention, a volume descriptor including at least data disc identification information and root directory position information, and a root directory including the position of each data file and, if necessary, the position of a lower directory are provided. And a file specified by the root directory in a data recording area, the file includes text data including at least character data, and various search index information for searching the text data. And various kinds of search index information and document management information for searching the body data. In order to perform a compound search, an item name that can be searched as the various kinds of index information, Of the above index information corresponding to the name At the time of search, a file name in the root directory is displayed, a file name in the root directory is selected, one of the displayed files is selected, and the document management information of the selected file is read. Displaying various search methods based on the document management information, and performing a search based on the index information corresponding to the search method selected from the displayed various search methods. When the compound search is selected from the methods, the search item name is displayed, search item data corresponding to the displayed search item name is input, and the input search item data is entered based on the index information. The data recording format and data search are performed by reading and displaying the text data corresponding to the search item data. With unifying method, it is possible to enable complex search.

Also, by unifying the data recording format and the data search method, the side that creates the data search method program can save development time, development cost, personnel cost, etc. The apparatus and the like can be manufactured at low cost, and the user can use a plurality of data disks by learning the search method once because the search method is the same even for different data disks.

Furthermore, by unifying the above data search method, the software recording the search method can be integrated into a disc reproducing apparatus or the like, for example, as an IC, so that a floppy disk or the like recording the search method can be created. Therefore, the size of the disc reproducing apparatus can be reduced, and the versatility of the disc reproducing apparatus can be improved.

[Brief description of the drawings]

FIG. 1 is a schematic diagram for explaining a configuration of a data disk used in a data search method according to an embodiment.

FIG. 2 is a schematic diagram showing each data recorded in a file.

FIG. 3 is a schematic diagram for explaining a structure of a document management block.

FIG. 4 is a schematic diagram for explaining the structure of a file.

FIG. 5 is a schematic diagram for explaining a hierarchical index structure of a file.

FIG. 6 is a schematic diagram for explaining a physical structure of a hierarchical index.

FIG. 7 is a schematic diagram illustrating a physical format of an index at the same level.

FIG. 8 is a schematic diagram showing a format of a basic structure of an upper level index and a lower level index.

FIG. 9 is a schematic diagram showing a format of a basic entry in the case of a word search.

FIG. 10 is a schematic diagram showing formats of a basic entry, a group entry key item, and a member item in the case of a conditional search.

FIG. 11 is a schematic diagram showing a format of menu data in the case of menu search.

FIG. 12 is a schematic diagram for explaining a structure of a viewpoint management block.

FIG. 13 is a schematic diagram for explaining an input candidate table.

FIG. 14 is a schematic diagram showing the format of key items and member items of a basic entry and a group entry in the case of a compound search.

FIG. 15 is a block diagram of a disc reproducing apparatus according to the embodiment.

FIG. 16 is a diagram showing an appearance of a disk reproducing apparatus according to the embodiment.

FIG. 17 is a diagram illustrating an appearance of a disk reproducing apparatus according to the embodiment.

FIG. 18 is a flowchart for explaining the operation of the disc reproducing apparatus at the time of a composite search.

FIG. 19 is a schematic diagram showing a specific example of display at the time of a composite search.

FIG. 20 is a schematic diagram showing a specific example of an initial screen of data disk reproduction according to the embodiment.

FIG. 21 is a schematic diagram showing a specific display example in word search (front match).

FIG. 22 is a schematic diagram showing a specific display example in word search (backward match).

FIG. 23 is a schematic diagram showing a physical recording format of a CD-ROM.

FIG. 24 is a schematic diagram for explaining a format defined in ISO9660.

[Explanation of symbols]

61 primary index block, 62, 63 secondary index block, 64, 65 nth index block, 66 body data, 68 title data, 75 literature management block, 76 various search indexes, 79 external character font, 211
Volume descriptor, 212 root directory, 213 file

Continuation of the front page (51) Int.Cl. ⁶ identification code FI G06F 15/40 310G 360D 15/413 310B (58) Investigation field (Int.Cl. ⁶ , DB name) G06F 17/30 G06F 12/00 520 G11B 23/36 G11B 27/00 G11B 27/10

Claims (2)

(57) [Claims] 1. A volume descriptor including at least data disc identification information and root directory position information, a root directory including a position of each data file and, if necessary, a lower directory.
A file specified by the root directory is a data disc recorded in a data recording area. The file includes text data including at least character data, and various search index information for searching the text data. And a file name in the root directory using a data disk on which the various search index information and the document management information for searching the text data are recorded. One of the displayed files is selected. Then, the document management information of the selected file is read, various search methods are displayed based on the document management information, and based on the index information corresponding to the search method selected from the displayed various search methods. A data search method characterized by performing a search. 2. The various types of search displayed by using a data disc on which a searchable item name as the various types of index information and a recording start address of the index information corresponding to the searchable item name are recorded. When the compound search is selected from the methods, the search item name is displayed, search item data corresponding to the displayed search item name is input, and the input search item data is based on the index information. 2. The data search method according to claim 1, further comprising: reading out and displaying text data corresponding to the search item data.