JPS6340937A - Information file device - Google Patents

Abstract

PURPOSE:To efficiently retrieve information by inputting an element of a retrieval data which necessitates a collation, and also, indicating an element which necessitates no collation, and collating only the element which necessitates a collation, in a storage retrieval data. CONSTITUTION:When an operator confirms a displayed key word and instructs a retrieval, a system control part 8 retrieves a retrieval data memory 12, and selects a retrieval data of the information concerned. This signal is transmitted to a display memory control part 4, and by the control part 4, it is displayed on a CRT 6, etc. Subsequently, when it is instructed to select and read out the data concerned from in the displayed retrieval data, the control part 8 specifies a registered of information which is stored in accordance with this data, and reads out information from an optical disk 10. This information is decoded by an encoding/decoding circuit 9, and thereafter, its signal is set to a page memory control part 2, stored temporarily in a page 3, and its information is displayed on the CRT 6, etc. in the same way as the time of registration.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an information file device that registers information in a large-capacity storage medium such as an optical disk and searches for the registered information using search data.

[Prior art]

In information file devices that register information such as documents and drawings on large-capacity storage media such as optical disks, search data related to the information is added to the information when the information is registered, and these search data are used to retrieve the information. It is common to search.

When registering information, information read by a scanner or the like is registered on an optical disk or the like, while search data related to the information is input from a keyboard or the like and added to the information. The search data includes the registration serial number that is automatically assigned at the same time as the information is registered, the registration date, and the file name of each information entered manually by the operator from the keyboard etc. during registration.

There are classification codes that systematically classify information, keywords that characteristically express the content of information, etc. These search data are stored in a hard disk or the like, and the registration address of the information on the optical disk is stored in association with this search data.

Next, when searching for information, when search data related to the information to be read is input from a keyboard or the like, the memory in the hard disk is searched, the registered address of the information is specified, and the information is read from the optical disk.

In this case, as a method of searching for information by inputting search data, for example, it is possible to search for a single piece of information by inputting a registration serial number, or by inputting file names, keywords, classification codes, etc., and searching for these search data. It is also possible to search for single or multiple information regarding. Regarding file names, keywords, classification codes, etc., there is also a so-called partial match search method that allows searching even if only a partial element of a plurality of elements constituting each is input.

Taking a classification code as an example, partial match search is
Each registered information has one code with four types of meanings, for example, company code, department code, department code, and serial number for each department.
5A-CI-1-1 in the above order as one classification code
50, "5A-AV-1-100", and when searching for information on company code SA and department code CI from among these emotions, the operator does not need to check the classification code. The part is indicated using any preset character, such as an asterisk (*), and the classification code "5" is used to indicate the part.
If you enter "A-CI-*", data below "*" will be excluded from verification, and the desired section code SA and department code C will be removed.
A search method in which information related to I is searched.

[Problem that the invention seeks to solve]

However, in conventional information file devices, if you specify an arbitrary character such as °*° as a part that does not require verification, data below *" is ignored and excluded from verification. For the purpose of searching for information with company code SA and department code 1 from among the information that has been assigned a classification code like If you enter , the data below the first ``*'' will be judged as unnecessary for verification.As a result, even if all the information related to company code SA is searched, the data below the first ``*'' will be searched.
The conditions are ignored and the desired information is not retrieved.

That is, for the above purpose, department codes such as "5A-CI-1-*" and "5A-AV-1-*" that do not require verification, such as "1CI', @AV", etc., must also be entered. This makes the data input work complicated, and when inputting data in this way, unnecessary data is also collated, so there is a problem in that it takes time to search for information, reducing search efficiency.

The present invention was made in order to solve these problems, and it simplifies the input work of search codes consisting of multiple elements such as classification codes among search data related to information, and improves information search. The purpose of the present invention is to provide an information file device that can improve efficiency.

[Means for solving problems]

The present invention provides an information file device that stores search data related to information to be registered and that can search the registered information using the stored search data. The present invention is characterized in that it includes means for specifying elements that do not require comparison among the elements when searching for information, and means for collating only the elements that require comparison based on the instruction means.

[Effect]

When registering information, among the search data related to information, the search data consisting of multiple elements is divided into elements and stored, and when searching for information, the elements of the search data that need to be verified are entered, and the When an unnecessary element is specified, only the elements that need to be collated are collated among the stored search data as described above, and the corresponding information is retrieved.

〔Example〕

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in detail below based on drawings showing embodiments thereof. FIG. 1 is a block diagram of an information file device according to the present invention. When registering information, information such as documents and drawings is read by the scanner 1, and the read information is temporarily stored in the page memory 3 under the control of the page memory control section 2.

The system control unit 8 transmits the information stored in the page memory 3 to the encoding/decoding circuit 9, encodes it, and registers it on the optical disc 10. Further, a signal of the information stored in the page memory 3 is transmitted from the page memory control section 2 to the display memory control section 4, and is displayed on a CRT 6 or the like via the display memory 5. Note that the information stored in the page memory 3 can also be obtained as a hard copy using a printer.

As information is registered, search data related to the information will be
Although the input is from the keyboard 11 etc., the system control unit 8
transmits the input search data signal to the display memory control section 4, and passes these search data through the display memory 5 to the CR.
Display on T6 etc. When the operator confirms the displayed search data and instructs registration, the information is registered on the optical disc 10 as described above. The system control unit 8 controls the optical disk 10? The registered address of the information in the database and the search data related to this information are associated with each other and stored in the search data memory 12 such as a hard disk.

Next, when searching for information, when search data related to the information desired to be read is input from the keyboard 11 or the like, these search data are entered into the CI? as in the case of registration. Display on 76 etc. When the operator confirms the displayed keywords and instructs a search, the system control unit 8 searches the search data memory 12, selects the search data for the relevant information, and sends this signal to the display memory system. 2[1], and the display memory control unit 4 displays these in the form of a list on a CRT 6 or the like. When the operator selects the relevant data from the displayed search data and instructs to read it, the system control unit 8 specifies the registered address of the information stored in association with this search data, and reads the data to this address. Information is read from the optical disc 10 based on the information. After the read information is decoded by the encoding/decoding circuit 9, the signal is transmitted to the page memory control unit 2 and temporarily stored in the page memo IJ 3. The information stored in the page memory 3 is transferred to the CRT 6 in the same way as when registering.
etc. to be displayed. It is also possible to obtain a hard copy of the information stored in the page memory 3 using a printer.

The storage method of search data in the information file device having such a configuration and the search method using this search data are as follows.
This will be described in detail with reference to the conceptual diagram of the memory shown in FIG. 2 and the flowchart of the search procedure shown in FIG. For example, if the classification code of the search data is expressed as ^BC-DE-FGH-IJ, then "ABC-DE-FGI(-IJ" is itself one search data, but one code is "AB
C", "DE", "PG)1. It consists of four elements of "IJ", and these are assumed to mean a company code, a department code, a section code, and an information serial number, respectively. Divide this classification code into each element: comma (1), slash (1), and colon (:).

Symbols such as ) are used as delimiters to indicate so-called element separations, and one of these is given to each element separation of the classification code (hereinafter referred to as delimiter d), and 1
At the end of each classification code, a delimiter of a different type from delimiter d is added (hereinafter referred to as delimiter e) to indicate separation from other classification codes. As mentioned above, when registering information, divide the classification code and use the keyboard 11 along with the delimiter.
Input from search data memory 1 like other search data.
2.

Next, when searching for information, for example, the first .
When searching for information regarding the third element, ie, ABC, "FGH", the second element, which is not involved in the information search, is searched for. the fourth element,
r! For r1 stone "DE" and "IJE:C, enter any preset characters, such as an asterisk (*), and enter ABC-*-FGH- from the keyboard 11.
*”, as shown in memory b in Figure 2, 1
A character is stored at one address.

Also, as described above, among the search data stored in the search data memo January 2, the classification code data is read out, and one character is stored in one address of the memory a.

Let the start addresses of the data stored in memory a and memory b be X and Y, respectively, and the data will be stored at addresses X+1 . . . as shown in FIG. X+2...or Y+1. It is assumed that the data is stored following Y+2...

When the data to be compared is stored in memories a and b, respectively,
A pointer indicating the verification start address is set to the first character of the input search data, that is, address Y of memory b (3). At this time, the first address of memory a is assumed to be X. First, it is determined whether the contents of the memory specified by the pointer are *゛ or not. is updated to the first delimiter d, that is, If so, the data from address Y to address Y+2, one address before the first *", and the corresponding data in memory a "
ABC" (6). After the verification is completed, the pointer specifies the next address of the verified data in memory b, that is, address Y+3. Also, the start address of memory a is specified as the next address of the verified data in memory b. Update to the next address, that is, the next delimiter address X+3.Result of data verification (
7) If the memory contents match, it is determined whether the contents of the first address X+3 of the memory a is a delimiter e indicating the delimiter of one classification code (8). If the delimiter is not delimiter e, then the collation element of one classification code follows, so update the start address of memory a to the address of the first character of the next element (9)
Again, as described above, the content of the pointer in memory b is read, it is determined whether data collation is necessary or not (4), and processing is performed in accordance with the determination result.

On the other hand, if the delimiter is the delimiter e, the delimiter e indicates the separation of one classification code, and if the matching results so far match, this classification code is
αφ displayed in 6th grade. Subsequently, the start address of memory a is updated to the next address of delimiter e (11), and the presence or absence of subsequent search data is determined (12). If there is subsequent search data, return the pointer in memory b to the address Y of the first character of the search data input at the time of search3.
), perform the search in the same manner as above.

In addition, if the results of the data verification are inconsistent,
Since this classification code is not a classification code related to the information you wish to read, the verification start address in memory a is updated to the next address of delimiter e that first appears after the current verification address (11), and the subsequent The presence or absence of data is determined (12).

As a result of performing the above information search for all classification codes in the search data memory 12, the search data for information related to the first and third elements of the classification code is in the form of a list, for example. This information is displayed on a CRT 6 or the like, and can be read out according to instructions from the operator.

In this embodiment, an example of the classification code of the search data has been described in detail, but the same effect can be obtained even if the search data consists of a plurality of elements, such as keywords, registration dates of information, etc.

Furthermore, in this embodiment, when data is compared, the data of a plurality of classification codes is read out from the search data file in advance and stored in the memory, and the data of the plurality of classification codes is compared while updating the address of the memory. Similar effects can also be obtained by reading out data sets one by one from the search data file, storing them in a memory area that has already been verified, and performing data verification while updating the memory contents.

Furthermore, in this embodiment, the storage capacity of one address of the memory is reduced to 1
Although it is set to a character, it is not limited to one character.

〔effect〕

In the present invention, search data that is composed of a plurality of elements, such as a classification code, is divided and stored in element units, and when searching for information, data of elements that require internal illumination of the search data and By inputting arbitrary characters that indicate elements that do not need to be verified, only the necessary elements are verified, which eliminates the need to input unnecessary data elements and simplifies data input work. Furthermore, since unnecessary data elements are not collated, information retrieval time can be shortened and retrieval efficiency can be improved.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of the information file device according to the present invention, FIG. 2 is a conceptual diagram of the memory showing the data storage format, and FIG. 3 is a flowchart showing the procedure for information searching and retrieval by the device of the present invention. It is. 2...Page memory control unit 3...Page memory 4
...Display control unit 5...Display memory 6...CR
T8... System control unit 9... Encoding/decoding circuit 10... Optical disk 12... Search data memory No. 1 Kaya 2 Country

Claims (1)

[Claims] 1. An information file device that stores search data related to information to be registered and that can search the registered information using the stored search data, which divides the search data into a plurality of elements. Information comprising: a means for storing; a means for indicating elements that do not need to be verified among the elements when searching for information; and a means for collating only the elements that require verification based on the indicating means. File device.