JPH0324667A - Method for retrieving document - Google Patents

Abstract

PURPOSE:To shorten a retrieving time by referring the 1st storage means for storing the up-to-date document data and the 2nd storage means for storing required history control data provided on a control part to retrieve a document. CONSTITUTION:The 1st storage means for storing plural up-to-data data read out from a storage part 4 and the 2nd storage means to be a control table for storing the reading order of the up-to-date document data in plural documents, retrieving keys, page numbers, document numbers, file ID, attribute date, the existence of document data in the 1st storage means, history control information such as storage information obtained when the document data exist are included in the control part 8. The 1st or 2nd storage means is referred in accordance with retrieval information inputted from an input part 1 or 3, and when document data corresponding to the 1st storage means exist, the document data concerned are supplied to an image processing part 5 without passing the storage part 4 and a transfer control part 7 to be retrieving means. If the data concerned are not stored, the document data concerned are read out from the storage part 4 without passing the control part 7 in accordance with the contents of the 2nd storage means. Consequently, the retrieving time can be shortened.

Description

[Detailed Description of the Invention] (Technical field to which the invention pertains) The present invention relates to a document retrieval method for speeding up document data retrieval operations in a document retrieval device that stores, retrieves, and displays document data. It is. (Prior Art) When performing a search using a document retrieval device that stores, searches, and displays document data, conventionally, keywords entered directly from a keyboard, etc., or a list of keywords are displayed on a display, and then inputted using a mouse, etc. Search processing is performed based on the keywords selected by the searching device, and document data is retrieved from the storage section and displayed. In addition, when searching for a document that has already been searched again, the same way as when searching for a new document, the search process is performed based on keywords and read out from the storage section. Therefore, if the search section is complex, the search process will take time, and if the document data is a large amount of data such as image data, it will take time to read it from the storage section. If you want to return to the previous search results,
It took a long time to display the image, and there were problems with the human-machine interface. (Object of the Invention) An object of the present invention is to provide a search method that solves the drawbacks of the conventional document search methods described above and can search document data at high speed. (Structure of the Invention) (Characteristics of the Invention and Differences from the Prior Art) The present invention includes a first storage means for storing a plurality of latest document data sequentially read out from the storage section; Reading order of document data, search key, page number, document number, file ID, attribute data, presence or absence of document data on the first storage means, and if present, document on the first storage means A second storage means for storing history management data such as data storage information for a plurality of document data; and when searching document data, the history management data of the second storage means is checked based on search instruction information. , means for determining whether or not the corresponding document data exists in the first and second storage means, and when the document data exists in the t-th storage means, the storage unit and the search unit Without intervention,
Based on the information of the history management data, the document data is retrieved from the first storage means as a search result and displayed on the display section, and the corresponding document data does not exist in the first storage means, and If history management data for the corresponding document data exists in the second storage means, the corresponding document data is read out directly from the storage section without going through the search section based on the history management data and displayed. It is characterized by having a means for displaying on the part. Therefore, this method differs from conventional search methods in that it eliminates the need for search processing for already searched document data and read processing from the storage section, thereby reducing search time. (Embodiment) Fig. 1 is a block diagram of a document retrieval device in which the method of the present invention is implemented, and 1 is an input unit (A) consisting of a pointing device such as a tablet or a mouse for issuing search instructions, etc. , 2 is a display section that displays document data, etc. of search results, and 3 is an input section (B) consisting of a computer, scanner, etc., for inputting existing magazines, literature, etc. Reference numeral 4 denotes a storage unit that stores document data etc. input from the input unit (B) 3; 5 performs image processing such as enlarging, reducing, scrolling, etc. of the document data at high speed in order to display the document data on the display unit; 6 is a bus for transferring document data, 7 is a transfer control unit that controls the transfer of bus 6, and 8 is a control unit for controlling the entire device. This is a control unit that has database management functions such as document data registration and search, and history management data management functions. FIG. 2 is a diagram showing an example of the configuration of search keys for document data handled by the document search device shown in FIG. This is an example of the case of the key 22) and the title key 23. Figure 3 shows the registration of document data based on the search key in Figure 2.
Database management table 9 for managing searches, etc.
This is a diagram showing an example of the configuration. Figure 4 is an example of a history management data table IO for managing history information regarding searched document data. First, before explaining the document retrieval method of the present invention, since document data must be registered in the storage unit 4 shown in FIG. explain. Input the document data you wish to register from the input section (B) 3 in Figure 1. If the document data you want to register is a document that is already written on paper, such as a magazine or literature, the input section (B) 3 is configured with a scanner or the like, and the document code format document created with a computer, word processor, etc. In this case, it is configured by the computer or word processor itself. The document data input from the input section (B) 3 is sent to the control section 8.
The transfer control unit 7 is activated, and the data is transferred at high speed to the screen processing unit 5 via the bus 6. Therefore, in the screen processing section,
If the document data input from the input section (B) 3 is in code format, such as input from a computer, etc., it is converted to dot-bang format, and it is converted into dot-bang format, such as input from a scan, etc. If it is, the image is displayed on display unit 2 without any conversion processing. The registrant instructs the input section (A) 1 to enlarge, reduce, scroll, rotate, etc., confirm the input document data,
Arrange the format of document data. Then, the instruction information from the input section (A) 1 is analyzed in the 5 control section 8 based on the position information specified with the pointing device of the input section (A) 1, and sent to the screen processing section 5, and the instruction information Image processing is performed accordingly. Image processing in the screen processing unit 5 is executed at high speed to improve the man-machine interface. Once the document data has been confirmed and corrected, the registrant assigns a search key to the document data and registers it. To assign a search key, display a keyboard on the display section 2, select the corresponding key with the pointing device on the input section (A) 1, and use it as a keyword.
A) It can be assigned by inputting handwritten characters from 1 and using them as a search key. In the latter case, for example, by giving an integer value such as 1, 2, 3, etc. in the order of search key registration, and using this value as a keyword, a keyword is automatically assigned. ．． As an example of search keys, as shown in Fig. 2, document data has a hierarchical structure such as a large heading key 20, a medium heading key 21, a small heading key 22, and a title key 23, and 1...i between the search keys in
... nll # 11 ... ij ... in1 ... A search key can be constructed by ordering. In addition, by considering items without a search key as a type of search key, it is possible to deal with cases where no search key is assigned. By ordering the search keys, it is possible to uniquely assign a sequence number to each document data in the entire file and in each layer. In particular, the document number assigned throughout the document 24 that corresponds one-to-one with the title key 23 at the lowest level, or the page number assigned throughout the document to each document consisting of multiple pages, etc. can be used as a search key. can do. When registering a search key in a desired hierarchy, the search operation displays a list of already registered search keys in the relevant hierarchy, and inserts a new search key between the registered search keys and the search keys. It can be registered by specifying the order relationship at the same time. As described above, when the search key assignment is completed, the control unit 8 updates the database management table 9 shown in FIG. 4 and store it. Examples of the database management table 9 when the search keys are hierarchical as shown in FIG. 2 include a large heading table 90 and a medium heading table for managing hierarchical search keys, as shown in FIG. 91. Subheading table 92
, a title table 93, and a page table 94 that manages information regarding pages, which are the minimum units configuring a document.
, a file management table 95 and a head table 96 for managing information stored in the document data storage section. Each search key is distinguished by a search key ID, the hierarchical structure and order relationship of each search key is expressed by link information in each table, and the page number of document data is uniquely determined by the number of search keys and pages in the table. Determined. Search keys are added or deleted by updating the link information, number of search keys, and number of pages in each table. The operation of the embodiment of the present invention for the document data registered as described above will be explained below using the operation flow shown in FIG. First, a case will be described in which a searcher repeatedly selects a search key and displays a list of title keys 23, which are the lowest search keys, on the display unit 2 to repeatedly perform a search. The searcher selects a desired title key using the input section (A) 1 (drawing numbers are omitted below Set in Figure 5).
The selected instruction information is sent to the control unit 8 and analyzed (S.). Since the analysis result is a search key, the history management data table 10 (FIG. 4) is checked based on the search key (S2). The history management data table 10 is the fourth
As shown in the figure, this is a table that manages history information of document data read out from the storage section 4. Initially, nothing is written in this table, but after repeated searches, the storage section 4 It is added and updated every time document data is read from . The attribute table address and file ID of the history management data table IO are the third
Page table 94 of database management table 9 in the figure
and file management table 95. Furthermore, the number of document data that can be managed by the history management data table IO can be arbitrarily determined by changing the size of the table, but it is set to a value larger than the number of document data that can be stored in the screen memory, which will be described later. As a result of checking the history management data table IO, if there is no document data previously searched with the same search key, the instruction information is a search key (S5, S6), so the search process is executed using the search key and the search is performed. The storage information on the storage unit 4 of the document data corresponding to the key is obtained (S7). Then, the history management data table 10 is checked again based on the obtained file ID (S.). The history management data table 10 is checked again when the same document data has already been read out from the storage unit 4 using another search key, or when the search key is complex and consists of logical conditions of two or more search keys. This is because in such a case, it cannot be determined whether the document data has been previously read out from the storage section 4 by checking the history management data table 10 at 82 in FIG. ? If the same file ID exists in the history management data table 10, the operation will be the same as when the same search key is in the history management data table in Ss in FIG. Check the presence/absence information of document data (S.,S,,SE,). However, the route from 85 in Figure 5 differs from the route from S in Figure 5 in that no search processing is performed. As a result of checking the presence or absence of document data on the screen memory,
If there is document data to be searched on the screen memory,
Display on the display section 2 from the screen memory (SIS) - By doing this, in the case of the route from S in FIG. S. In the case of the route from , reading from the storage section 4 can be eliminated, allowing high-speed display. The operation when there is no corresponding document data in the screen memory at S in Figure 5 is the same as when there is no same file ID in the history management data table 10 at S in Figure 5, but the subsequent processing What document data do you need? The information to
In the case of the route from 81■ in the figure, it is obtained from the history management data table 10 without performing any search processing, and the S
In the case of the route from , the only difference is the points obtained through normal search processing, and the subsequent processing is the same. The number of document data that can be stored in the screen memory in the screen processing section 5 can be arbitrarily determined by changing the size of the screen memory, but as described above, it can be managed using the history management data table 10. Set the value to be smaller than the number of document data. As a result, even if the document data is not on the screen memory, the history management data table 10
If management data exists for the document data, it is possible to skip the search process. As mentioned above, there is a limit to the number of document data that can be stored in screen memory.
When reading document data from the storage section, check the usage status (S■,). If the screen memory is full, the oldest document data stored in the screen memory is deleted from the screen memory (SE,), and accordingly, the document data on the screen memory for the corresponding document data in the history management data table 10 is deleted. Css. to eliminate the presence/absence information and clear the storage address and data length on the screen memory. ).

The subsequent operation is the same as when the screen memory is not full, and the control unit 8 starts the transfer control unit 7, reads the corresponding document data from the storage unit 4, and transfers the data to the screen processing unit via the bus 6. Transfer to the screen memory section in 5. The screen processing section performs screen processing such as enlargement or reduction on the document data in the screen memory in accordance with the display screen of the display section 2, and displays it on the display section 2 (SE,). The control unit 8 checks the usage status of the history management data table 10 (S1g), and if it is full, deletes the management data for the oldest document data (SE,). The subsequent operation is the same as when the history management data table 10 is not full, and the management data for the document data read from the storage unit 4 is added to the history management data table in preparation for the next search operation (St*). - The case where the instruction information at the time of search is a search key has been described above, but the present invention is most effective when the instruction information is order information and page information. The search method using order information performs a search by specifying the order in which the display screens are displayed on the display unit 2, and is, for example, a method in which the display screens are displayed one after another by using the previous screen key. In addition, as mentioned above, the search method using page information is
Since document data is uniquely determined by the document number and page number, searching is performed by specifying page information. For example, the first page of each document can be displayed one after another using the previous document key or next document key. , the previous page key, the next page key, and displaying page by page one after another.The above two search methods improve usability by using methods similar to how normal people search for files. This is an effective method for searching document data. Therefore, the present invention has a significant effect of displaying document data that has already been searched at high speed. Below, embodiments of the present invention will be described in which the instruction information is order information and page information. When the search instruction from the input section (A) 1 is a search based on order information or a search based on page information, the control section 8 selects the sequence number or page based on the coordinate value data from the input section (A) 1, respectively. number or document number, and use this to obtain the sequence number, page number,
Check the document numbers to see if there are any that are the same (SowS,,S,,S, in Figure 1). The method to obtain the sequence number, page number, and document number from the coordinate value data is as follows:
It can be determined from the sequence number, page number, and meaning of the key corresponding to the coordinate value of the document number (previous screen, previous page, previous document, etc.) of the currently displayed document data. If the history management data table has the same order information or page information, the operations after Sat in FIG. 5 are performed, as in the case where the above-mentioned instruction information is a search key. In other words, if there is document data on the screen memory,
If the document data is displayed on the display unit 2 from the screen memory without performing readout and search processing from the storage unit 4, and there is no document data on the screen memory, the search processing is not performed and the history management data table 1o is displayed. Using the management table, document data is directly read from the storage section 4 and displayed on the display section 2, thereby speeding up the search operation. At S in FIG. 5, if the history management data table 10 does not have the same order information or page information, search processing is performed as in a normal search (S.
), reads the document data from the storage section and displays it. (Effects of the Invention) As explained above, according to the present invention, document data that has already been searched and displayed is displayed on the display section without performing both search processing and reading from the storage section, or without performing search processing. By doing so, it is possible to speed up the search operation. Furthermore, by applying it to searches based on order information and page information, it becomes possible to perform high-speed flip-by-page searches, and has the advantage of providing an excellent document search method for man-machine interfaces.

[Brief explanation of drawings]

Fig. 2 is a block diagram of a document retrieval device in which the method of the present invention is implemented, and Fig. 2 is a diagram showing an example of the structure of a search key for document data handled by the document retrieval device of Fig. 1. FIG. 3 is a diagram showing an example of the structure of the database management table 9 for managing document data registration, searches, etc. based on the search keys in FIG. 2, and FIG. 4 is a diagram showing the history of searched document data. FIG. 5 is a diagram showing an example of the structure of a history management data table IO for managing information, and FIG. 5 is a diagram showing an operation flow of the present invention. 1...Input section (A), 2...Display section, 3
...Input section (B), 4...Storage section, 5...Screen processing section, 6...Bus, 7...Transfer control section, 8
...control unit, 9...database management table,
10...History management data table.

Claims (1)

[Claims] In a document retrieval device having a document data storage section, a search section, and a display section, a first storage means for storing a plurality of latest document data sequentially read from the storage section; Data reading order, search key,
History management data such as page number, document number, file ID, attribute data, presence or absence of document data on the first storage means, and if so, storage information of document data on the first storage means. A second memory that stores multiple document data.
and when searching for document data, check the history management data of the second storage means based on the search instruction information and check whether the corresponding document data exists in the first and second storage means. If the document data is present in the first storage means, the document data is retrieved as a search result based on the information of the history management data without going through the storage section and the search section. is retrieved from the first storage means and displayed on the display section, and there is no corresponding document data in the first storage means, and history management data for the corresponding document data is stored in the second storage means. If the document data exists, the method further comprises means for directly reading out the corresponding document data from the storage section without going through the search section based on the history management data and displaying it on the display section. .