JPS63208936A - File retrieving method - Google Patents

Abstract

PURPOSE:To perform a file retrieving job at high speed compared with a case where the file contents are directly retrieved, by applying a card style file managing method provided with a label region where a key word, etc., are written. CONSTITUTION:A series of data on the document information, etc., are arranged in accordance with a prescribed rule and a file FL of a card style using a label are LB for file management is stored in a memory 1. The file numbers are written into the area LB of a file together with the retrieving function data, the final application date date, the application frequency data, the plural key words showing the contents of said data, etc. In this system the retrieving function data showing the importance of files are written into the region LB based on the final application date and the application frequency of the files. Thus an access is given at high speed to a desired file with the retrieval of the retrieving function data.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a file search method for accessing files such as civilian information stored in databases etc., particularly files in card format [Summary of the Invention] The present invention provides a file search method for accessing a file in a card format, in which search function data calculated from file use count data and last use date data is written on a label along with the use count data and last use date data. By setting an area for each file, first searching for search function data in each file, and then executing a content search for files whose search function data that meets the conditions are written in the label area, a large amount of data can be searched. It allows for efficient file searching and high-speed access to desired files.

[Conventional technology]

Generally, when managing a large amount of document information, etc., a series of information is stored in a storage device as files organized according to predetermined rules, and the necessary files are read from the storage device according to the user's request. File management is performed.

Conventionally, in order to perform 7-pool searches at high speed in databases and the like that manage a large number of files, efforts have been made to increase the speed of software by increasing the speed of hardware and reviewing the algorithms of search programs. and,
In the case of card-format files, a widely adopted method is to provide each file with a label area that assigns a reduced image, classification, or keyword to the information content, and to speed up file searches by using each label area. .

(Problem to be Solved by the Invention) By the way, as mentioned above, by adopting a card-type file management method that provides a label area for entering keywords, etc., it is possible to improve the efficiency compared to directly searching the file contents. , it is possible to speed up the file search process, but in this case too, conventionally, each label area for all files is sequentially searched, so the search speed increases in proportion to the increase in the number of files. This poses a problem in that the time required for the work increases and it becomes impossible to quickly access a desired file.

SUMMARY OF THE INVENTION In view of the above-mentioned conventional problems, it is an object of the present invention to provide a file search method that allows a desired file to be efficiently searched from a large number of files and accessed at high speed.

(Means for Solving the Problems) In order to solve the above-mentioned problems, the present invention provides search function data calculated from file use count data and last use date data. A label area is provided in each file to be filled in along with the day data, and the search function data of each file is first searched, and then,
It is characterized in that a content search is executed for files in which search function data that satisfies conditions is written in the label area.

[Effect]

In the present invention, the use count data and the last use date data written in the label area provided in the file indicate the usage status of the file, and the importance of the file is determined based on the use count data and the most recent use date data. The search function data indicating the degree is calculated in advance and entered in the label area above, and the search function data is set and searched prior to searching the contents of each file to actually perform the content search. It is possible to reduce the number of files and perform efficient file searches.

〔Example〕

Hereinafter, one embodiment of the present invention will be described in detail with reference to the drawings.

Figures 1 to 8 show an embodiment in which the present invention is applied to a database system. In this embodiment, the database system stores files such as document information, as shown in the block diagram of Figure 2. A host machine 2 manages a large amount of files stored in the storage device 1, and searches for desired files by operating the keyboard 4 of the terminal machine 3. The information is read out from the Ja device f onto the screen of the display device T1.5 of the terminal machine 3.

As schematically shown in FIG. 1, the storage device 1 has a card format in which a series of data (DATA) such as document information is organized according to predetermined rules, and a label area LB for file management is provided. A large amount of files FL have been accumulated. The label area LB of the above file FL includes its file number (magnetic), search function data (K), last use date data (t), use count data (N), and multiple numbers indicating the contents of the above data (DATA). Keyword (KW)
etc. are entered.

Here, in a database that accumulates document information such as technical documents, recently used files are likely to be usable immediately, and frequently used files are likely to be reused. The vertical axis is the file usage date I3 [(N), and the number of days that have passed since the last usage date (1) is (
As shown in Figure 3, where (1/T) is plotted as T) on the horizontal axis, the possibility of using a file whose number of uses (N) and number of days elapsed (T) are both in the small area (C) is low (, Also,
wIJ with a large number of uses (N) and number of days elapsed (〒)
The possibility of using the file in J(A) is high.

Therefore, in this embodiment, the search function data (K) given under K-αN/β is converted into the last use date data (1) written in the label area LB of the file FL.
) and usage frequency data (N) and written in the label area LB in advance.
is a weighting that can be set arbitrarily by the user depending on whether to give more weight to the date of last use or to frequency of use.For example, in each file 10.20 shown in FIG. 1, α and β are set to 1. Each search function data (K) calculated on December 5, 1985 as Kx = Nx/Tx-17/4-4.25Ky -Ny
/Ty -11/1-11 is each label area 11.21
is written in.

When the file search mode is specified by the terminal machine 3, the host machine 2 enters the search level (Ko) in the label area LB of the file FL, as shown in the flowchart of FIG. A search is executed for the search function data (K). The search operation for this search function data (K) is performed by reading the search function data (K) written in the label area LB and if it is less than the above search level (Ko), incrementing the file number (Ko) and next. Moving on to the search work for the search function data (K) of the file, only for the file FL in which the search function data (K) of the above search level (Ko) or higher is written in the label area LB, the keyword of the label wI area LB is searched. (KW) to search the file contents 0 For example, when the search level (Ko) is set to 5, the search function data Kx of Kx = 4.25 shown in Fig. 1 is written in the label area 11. For the file 10 in which the search function data Ky-11 is written in the label area 21, the content search using each keyword is omitted, and for the file 20 in which the search function data Ky-11 is written in the label area 21, the content search using each keyword is executed.

When the host machine 2 accepts the file access request for reading data (DATA) of the desired file PL searched in the file search mode, the host machine 2 processes the requested file as shown in the flowchart of FIG. Open the file, execute the task, and retrieve the data (DATA).
), the usage count data (N) of the label area LB is incremented, and the file is closed with the file access date set as the last usage date (1).

Furthermore, the host machine 2 periodically performs bunch processing as shown in the flowchart of FIG. Find the number of elapsed days (T) from the last use date data (1) written in the label area LB of FL, and calculate the search function data (K) from this number of elapsed days (T) and the number of use data (N). Bunch processing of the procedure shown in the flowchart of FIG. 6 is periodically performed.

In such a database system, the file FL stored in the storage device 1 is calculated using the last use date (1) and the number of uses (N) as parameters.
The search function data (K) indicating the importance of is stored in the label area LB.
, so before searching the contents of each file,
Specify the search level (Ko) and retrieve the above search function data (K
), it is possible to find a file that is worth performing a content search from among a large number of files, perform the content search efficiently and quickly, and access the required file at high speed.

〔Effect of the invention〕

In the present invention, the use count data and last use date data that are written in the label area provided in the file include the use count data and last use date data that indicate the usage status of the file, and the use count data and last use date data that indicate the usage status of the file are entered. By calculating the search function data indicating the importance of the file in advance from the date data and entering it in the label area above, you can perform a search with a search level set for the search function data before searching the contents of each file. You can reduce the number of files whose contents are actually searched by executing
Efficient file searches can be performed for a large number of files. Therefore, according to the present invention, it is possible to efficiently and quickly search for a required file among a large number of files and access it at high speed.

[Brief explanation of the drawing]

Figures 1 to 6 show the present invention as a database system◇
FIG. 1 is a schematic diagram showing a schematic structure of a file, FIG. 2 is a block diagram showing a schematic structure of a database system, and FIG. 3 is a diagram showing a schematic structure of a database system. FIG. 4 is a flowchart showing a file search operation, FIG. 5 is a flowchart showing a file access operation, and FIG. 6 is a flowchart showing a batch processing operation. It is. 1...Storage device 2...Host machine 3...Terminal machine

Claims (1)

[Scope of Claims] Each file is provided with a label area in which search function data calculated from file usage count data and last usage date data is written together with the usage count data and last usage date data. A file search method characterized by executing a search for search function data, and then executing a content search for a file in which search function data satisfying a condition is written in a label area.