JP3035980B2 - Electronic firing device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention stores a personal computer, a workstation, and various other documents, and search data including a search item and an item element paired with the document. In connection with the improvement of an electronic filing device having a function of searching for a desired document by creating search conditions based on items / elements and logical operations on them, that is, an electronic filing device having a filing search function, in particular, prioritizing search conditions By performing the search and the rearrangement of the priorities at the same time, when the data cannot be stored in the output buffer, the desired documents can be quickly and easily searched by deleting the documents having the lower priorities. The present invention relates to an electronic filling device configured as described above.

Even when a plurality of search conditions are set and priorities are added, a search result can be obtained by one execution, and the order of the user can be changed by rearranging the priorities. The present invention relates to an electronic filling device capable of outputting.

In addition, by adding a limit on the number of output records and a limit on the minimum value of the search frequency, an electronic filling device that facilitates sorting after searching by removing in advance documents having conditions deviating from the user's desire. About.

2. Description of the Related Art Conventionally, in an electronic filling apparatus, in order to search a plurality of stored documents, search data including a search item and an item element forming a pair with each document is stored.
A searching function for creating a search condition by a search item / element set by a user and a logical operation on the search item / element and extracting a desired document from a plurality of documents is added.

In the conventional filling search process, search data consisting of search items and item elements paired with these documents is extracted from the beginning of a plurality of documents to be searched, one by one, and set by the user. Create search conditions by search items / elements and logical operations on them, for example, logical operations such as and / or / not / range, compare with search data based on these search conditions, and output matched search data Store in buffer.

However, in the conventional filling search process, if the capacity of the output buffer is limited, there is an inconvenience that when the maximum number of documents is exceeded, the remaining documents are excluded from the search target.

When a document is searched, if the search conditions include a plurality of priorities, such as a first request, a similar request, and a third request, the search is performed three times in accordance with each of the priorities. It is necessary to perform an operation of comparing and examining the obtained search results, and it takes time to set search conditions three times and to execute each of them.

Furthermore, as another search processing, there is a method in which all conditions are searched by a logical sum (or), and then the obtained search results are compared and examined. However, in such a method, the number of output results of the search results inevitably increases. Therefore, it is difficult to select a desired document from among the documents.

Conventionally, as an additional function separate from the search processing,
Rearrangement processing methods are also known.

However, the conventional sorting method simply sorts the elements in the items in ascending or descending order, so that the order is not always the one desired by the user, and the operability is not improved much. There is.

As described above, in the conventional filling search processing, if the number of search documents increases, the search processing ends when the maximum number of documents is exceeded due to the limitation of the output buffer, so that the remaining documents can be searched. The next search must be executed again.

In addition, when setting relatively ambiguous search conditions, the number of executions of the search is increased, and unnecessary documents are output as search targets, so that a lot of time and effort is required in the subsequent selection process. There is also.

Furthermore, in the conventional rearrangement processing method, the elements in the item are merely ascending / descending order, and therefore, there are many inconveniences such as that a search result according to the user's intention is not always obtained. Atsuta.

SUMMARY OF THE INVENTION In the present invention, such a disadvantage in a conventional electronic filing apparatus having a filing search function is first considered. That is, first, the search processing is performed when the maximum number is exceeded due to the limitation of the output buffer. Ends, so that it is necessary to search again for the remaining documents. Second, when the search is performed under relatively ambiguous search conditions, individual sorting processing is required for the output search results, Third, even in the rearrangement processing method, only the ascending / descending order of the elements in the item is possible, and a search result that matches the user's intention is not always obtained. To solve the inconvenience of

First, by adding priorities to search conditions created by logical operations on search items and elements, search processing and rearrangement by priority can be performed simultaneously, It is an object of the present invention to provide an electronic filling device in which search results are output to an output buffer in a sequence desired by a user, and a document to be searched having a low priority is removed, thereby facilitating selection after a search. Aim.

Secondly, by setting the maximum number of search results to be output, a limit on the number of output results is added, and documents having conditions deviating from the user's desire are removed in advance, thereby facilitating sorting after search. It is an object to provide a filling device.

Third, by setting the minimum value of the search frequency,
Similarly, an object of the present invention is to provide an electronic filling device that facilitates sorting after retrieval by previously removing a document having a condition deviating from the user's desire.

Means for Solving the Problems To achieve the above object, an electronic filling apparatus of the present invention includes a plurality of documents, a search item paired with the document, and search data including an item element constituting the search item. A search condition creation unit for storing and creating search conditions by user-set search items and item elements and logical operations on them, and comparing the search data with the search conditions and outputting matched search data to an output buffer. And a document output unit (output control unit) for outputting a document corresponding to the search data stored in the output buffer, wherein a user inputs each search item and item element. First to set the indicated priority
Means, and a weight (search frequency) for assigning a predetermined weight (higher frequency) to each search item according to the priority set for each search item and the number of search items having the same priority Is calculated, and the search frequency assigned to each search item in this way is assigned to each item element constituting the search item by the priority set for each item element by the first means and the same priority. A second means for assigning and assigning according to the number of item elements, a third means for calculating the sum of the search frequencies of the item elements of the search data output to the output buffer (total search frequency), and And a fourth means for rearranging the document output order by the document output unit based on the information of the total search frequency.

Means for setting the maximum number of search documents output by the document output unit; and when search data is output to the output buffer exceeding the maximum search document number, the search data having the minimum total search frequency is output. Means for deleting from the buffer.

Further, there is provided a means for setting a minimum search frequency of the total search frequency, and a means for deleting search data less than the set minimum search frequency from the output buffer.

Embodiment Next, an embodiment of the electronic filling device of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a functional block diagram showing one embodiment of a main part configuration of an electronic filling device of the present invention. In the drawings, 1 is a keyboard, 2 is a pointing device, 3 is an input control unit, 4 is a search condition creation unit, 5
Is a priority creation unit, 6 is a search unit, 7 is a search frequency total unit,
8 is a maximum number detection unit, 9 is a lowest priority number monitoring unit, 10 is a sorting control unit, 11 is a search data storage unit, 12 is a document data storage unit, 13 is an output buffer, 14 is an output control unit, and 15 is an output control unit. CR
A bit map type display device composed of T or the like, 16 is a printer, and 17 is a system bus.

In order to facilitate understanding, the operation of the electronic filling device of the present invention shown in FIG.

The document data storage unit 12 stores data of a plurality of documents.

Then, search data including search items and item elements forming a pair with these documents is described in the search data storage unit 11.

When searching for a document, the user specifies the search items / elements of the search data and the type of logical operation on them.

These designations are made by the keyboard 1 and the pointing device 2.

The input control unit 3 transmits data input from the keyboard 1 and the pointing device 2 to the search condition creation unit 4.

The search condition creation unit 4 converts the transmitted data into a search condition based on the transmitted data, and provides the search condition to the search unit 6.

The search unit 6 compares the search data paired with the search condition with the search data in the search data storage unit 11, and transfers the search data of the matched document to the output buffer 13 for storage.

Further, in response to a user's instruction, the output control unit 4 outputs a document corresponding to the search data in the output buffer 13 to a display device 15 such as a CRT, a printer 16, or the like.

The above operation is based on the conventional feeling search system,
It is basically the same.

In the electronic filling device of the present invention, a priority creating unit 5, a search frequency totaling unit 7, a maximum number of detecting units 8, a minimum priority number monitoring unit 9, and a rearrangement control unit 10 are added.

The priority creating section 5 calculates and generates search frequency data for each search item / element based on the data from the input control section 3 and transfers the search data to the output buffer 13 for storage. Then, the sum of the search frequencies of the search data is calculated and stored in the output buffer 13 as a part of the search data.

The search frequency total unit 7 sums the element search frequencies of the element items corresponding to the respective search items shown in FIG.

The sorting control unit 10 calculates the total value of the search frequency at the time when the search data is newly stored in the output buffer 13,
The new search data is stored in an appropriate area of the output buffer 13 by comparing with the total value of the search frequencies of the search data already stored.

If there is a limit on the maximum number and / or the minimum total frequency, the maximum number detection unit 8 detects whether or not the maximum number has been reached, and the minimum priority number monitoring unit 9 determines whether the document with the minimum total frequency is If a document having the maximum number and / or the minimum total frequency is detected by monitoring whether or not the occurrence has occurred, the fact is notified to the sorting control unit 10, and the sorting control unit 10 deletes the corresponding data from the search target. I do.

Next, the operation at the time of retrieval in the electronic filling apparatus of the present invention will be described in detail with reference to an example of specific data.

FIG. 2 is a diagram showing an example of setting of search conditions and priorities. In the drawing, the symbol “優先” indicates the priority of the item / element, and the larger the number, the higher the priority. The number in parentheses in the search item in the left column indicates the item search frequency, and the number in the element item in the right column. The number in parentheses indicates the element search frequency.

FIG. 2 is an example of a search for real estate apartment and apartment information, and each item from the property name of “1.” to the equipment of “7.” can be arbitrarily selected as search items.

 Here, the item search frequency will be described.

In the case of FIG. 2, the price range of the search item “6.” in the left column is marked with two triangles, and the highest priority is given.

Then, the address category of the search item "2.", the distance from the station of "4.", the layout of "5.", the facilities of "7."
Each is marked with a single triangle and is set to the next priority.

The item search frequency is a number shown in parentheses to the right of the mark for each item. The method of calculating the item search frequency will be described in detail in the flow of FIG. 6 described later. 100 ”, and is calculated by dividing by the number of levels indicating the priority order (in FIG. 2, two levels are indicated by two triangles and one triangle).

First, for the highest priority, that is, the price range of “6.” marked with two triangles, there is no other search item at the same level, so in this case, the divisor is set to “ As the second item of “search item of the same level + 1”, the previous higher frequency “100” is divided, and the item search frequency = 100/2 = 50.

Next, the search items with lower ranks, that is, the address division of "2.", which is marked with one △, the distance from the station of "4.", the layout of "5." Calculate the item search frequency for each item of the equipment of 7.).

Since the number of items at this level is 4 in total, the divisor is set to 4, and the item search frequency of the higher price range of “6.” is “50”. Divide the frequency "50" to obtain the item search frequency = 50/4 = 12 (fractions are truncated).

As described above, the item search frequency is a numerical value of a weight according to the priority of each item and the number of items having the same priority.

Next, each item element shown in the right column of FIG. 2 will be described.

The item element is an element indicating the contents constituting the corresponding search item in the left column, and like the search item, for each item element, for example, in the case of the price range of the search item `` 6. '' The price ranges are 50,000 yen, 60,000 yen, and 70,000 yen.

Each item element is provided with a triangle indicating priority and an element search frequency indicated by a number in parentheses on the right side thereof.

In this element search frequency, for example, an item element “50,000 yen level” corresponding to the price range of the search item “6.” is marked with three triangles, and the next item element “60,000 yen” The table has two triangles, and the item element "70,000 yen" has one triangle.

Therefore, in the item element corresponding to the price range of the search item “6.”, the priority order of “50,000 yen” is the highest, the next is “60,000 yen”, and the lowest is “70,000 yen”. Stand ".

As the element search frequency of each of these item elements, the same numerical value as the corresponding item search frequency in the left column is given to “50,000 yen level” having the highest priority.

The calculation formula is “corresponding item search frequency”, “5
This is a value obtained by dividing “0” by “2 to the power of 0 (= 1)”, resulting in “50” which is the same value as the item search frequency in the left column.

The next priority element search frequency of "60,000 yen level"
It is a value obtained by dividing “50” which is the “corresponding item search frequency” by “2 to the first power (= 2)”. In this case, it is “25”.

The lowest priority element search frequency of “70,000 yen level”
It is a value obtained by dividing "50" which is "corresponding item search frequency" by "2 square (= 4)". In this case, it is "12".

By the above calculation, the element search frequency is calculated for each element item.

In the case of this embodiment, the item search frequency indicates the maximum value of the item.

Therefore, the relationship of (item search frequency) ≧ (element search frequency) is established.

When a search condition is set, the priority of each document in the search condition is determined by adding the element search frequencies (total inspection frequency) shown in the right column of FIG.

Next, a description will be given of the processing at the time of retrieval using the element retrieval frequency in FIG.

FIG. 3 is a diagram illustrating an example of output data when a search condition and search data match. In the drawings, the number in parentheses in each column indicates the search frequency.

First, the document No. “006” is stored in the output buffer 13 of FIG. 1, and at this time, the total search frequency (here, 61 as shown in the column of the total search frequency in the bottom line) is stored. "61"
Is calculated and stored in the output buffer 13 in the same manner.

In this state, since there is only one data, the sorting function does not work.

Next, when the document No. “019” is stored in the output buffer 13 of FIG. 1, the total search frequency is calculated and becomes “86”.

In this state, the sorting function works and the previous document No.
“06” is stored in one paragraph, and this document No. “019” is stored at the highest level.

Next, when the document No. "033" is retrieved and stored in the output buffer 13 in FIG. 1, similarly, the total retrieval frequency is calculated to be "60", and the data associated therewith is stored in the position associated therewith. Is stored.

The state of the output buffer 13 at this point is as follows.
As shown in the figure.

FIG. 4 is a diagram showing an example of data storage in the output buffer.

In FIG. 4, the arrangement order of the document numbers in the left column is as follows.
The numerical values of the total search frequency shown in the right column are in descending order.

Thus, in the electronic filling device of the present invention,
By adding priorities to the search conditions, it is possible to search while rearranging the order of documents according to the priorities.

That is, the search results can be output in the order desired by the user, and the efficiency of the search operation is significantly improved.

Here, regarding the electronic filling device of the present invention,
The process based on the search condition and the priority will be described with reference to the flowchart.

FIG. 5 is a flowchart showing a main processing flow at the time of retrieval in the electronic filling apparatus of the present invention. In the drawing, # 1 to # 21 indicate steps.

 In step # 1, a search condition and a priority are input.

 In step # 2, a search condition is created.

In the next step # 3, the search frequency based on the priority order is calculated. The details are shown in the flow of FIG. 6 described later.

 Proceeding to step # 4, the data pointer is initialized.

In the next step # 5, retrieval data indicated by the pointer is extracted.

At step # 6, it is determined whether or not the search condition matches the search data.

If the result of the determination in step # 6 is that they match, the process proceeds to step # 7, where the total value of the search frequencies is calculated. In the next step # 8, the minimum total value is compared with the frequency total value.

If, in the comparison in step # 8, the total frequency is not larger than the minimum total (minimum total ≧ frequency total), it is determined to be search data for a document not to be searched (claims). Embodiment corresponding to the invention described in the item 3)), and proceed to step # 12.

If the total count is greater than the lowest total,
Proceed to step # 9.

In step # 9, a rearrangement process is performed, and the search data is stored at an appropriate position in the output buffer.

In step # 10, the maximum number and the number of stored cases are compared, and if the number of stored cases is larger than the maximum number, the process proceeds to step # 11 to delete the least significant data (claim 2). Example corresponding to the invention described in the section).

 In step # 12, the pointer is updated.

As a result of the determination in the previous step # 6, when the search condition and the search data do not match, and when the number of storages is not larger than the maximum number in the comparison between the maximum number and the storage number in step # 10 ( (Maximum number ≧ number of stored items)
Also proceeds to step # 12 to update the pointer.

At step # 13, it is determined whether or not the search data has been completed. If the search data has not been completed, the previous step # 5 is performed again.
Then, the same processing is repeated.

If the search data is completed, the process proceeds to the next step # 14, and the data pointer is initialized.

In the next step # 15, the data of the output buffer indicated by the pointer is extracted.

At step # 16, the document specified by the search data is displayed on the display screen, and at the next step # 17, designation of printing or an operation instruction of the pointer is input.

At step # 18, it is determined whether or not printing has been designated. If so, printing is performed at the next step # 19, and the process proceeds to the next step # 20.

In step # 20, the pointer is updated. Note that, even if printing has not been designated in the determination of step # 18,
Proceed to this step # 20.

At step # 21, it is determined whether or not the search data has been completed. If the search data has not been completed, the previous step # 15 is performed again.
Then, the same processing is repeated.

If the search data ends, the flow of FIG. 5 ends.

Through the processing in steps # 1 to # 21, the data search processing based on the search conditions and priorities by the electronic filling apparatus of the present invention is completed.

FIG. 6 is a flowchart showing a detailed processing flow of calculating the search frequency based on the priority in the electronic filling apparatus of the present invention. In the drawing, # 31 to # 45
Indicates a step.

The flow of FIG. 6 shows in detail the process of calculating the item frequency in step # 3 of FIG.

At step # 31, the level is set to the highest level (upper frequency = 100).

In the next step # 32, the number of level items is calculated, and the process proceeds to step # 33 to determine whether there is an item of a lower level.

If there is a lower level item, the next step # 34
Then, the current number of level items is incremented by "+1", and the process proceeds to the next step # 35. It should be noted that, even if there is no lower-level item in the judgment of the previous step # 33, the process proceeds to this step # 35.

In step # 35, the level item frequency is calculated based on the higher frequency / the number of level items.

In step # 36, the higher frequency is set to the level item frequency, and in the next step # 37, the level is down.

In step # 38, it is determined whether or not there is a level item. If there is a level item, the process returns to the previous step # 32, and the same processing is repeated.

If it is determined in step # 38 that there is no level item, the process proceeds to the next step # 39, and the item pointer is initialized.

In the next step # 40, the element pointer is initialized, and the flow advances to step # 41 to calculate the element frequency by the item frequency / 2 raised to the power of the element level.

In step # 42, the element pointer is updated, and the process proceeds to the next step # 43, and it is determined whether or not the element has been completed. If not completed, the process returns to the previous step # 41, and so on. Repeat the process.

In step # 43, when it is determined that the element is completed,
Proceeding to the next step # 44, the item pointer is updated.

At step # 45, it is determined whether or not the item has been completed. If the item has not been completed, the process returns to the previous step # 40, and the same processing is repeated.

When it is determined in step # 45 that the item has been completed,
The flow of FIG. 6 ends.

Through the processing in steps # 31 to # 45, the search frequency is calculated based on the priority order.

In the above embodiment, the relationship between the item search frequency of the item with the higher priority and the item search frequency of the item with the lower priority is determined by comparing the item search frequency of the item with the higher priority with the item of the lower priority item. The case where the setting is made to be larger (or equal) than the sum of the search frequencies has been described.

However, in the setting of the search frequency, such a relationship does not necessarily need to be established. For example, the search frequency of the lowest rank may be set to “1”, and the search frequency may be set to “+1” every time the rank rises. Also, the user can set an appropriate value that changes sequentially according to the priority order, and the present invention is not limited to the embodiment.

According to the electronic filling device of the present invention, priorities can be added to the search conditions, so that the search can be performed while rearranging the order of the documents according to the priorities.

As a result, the search results can be output in the order desired by the user (an effect corresponding to the first aspect of the present invention).

In addition, since the maximum number of search results to be output can be set, documents with low priorities can be removed in advance.

Therefore, the output of unnecessary documents is reduced, and the efficiency of the search operation is improved (the effect corresponding to the second aspect of the present invention).

Furthermore, since the lowest line of the priority of the search condition can be set, similarly, a document having a low priority can be removed in advance, and the efficiency of the search operation can be reduced by reducing the output of unnecessary documents. Many excellent effects such as further improvement (effect corresponding to the invention of claim 3) can be obtained.

[Brief description of the drawings]

FIG. 1 shows an electronic firing device of the present invention.
FIG. 2 is a functional block diagram showing an embodiment of the main part configuration, FIG. 2 is a diagram showing an example of setting of search conditions and priorities, and FIG. FIG. 4 is a diagram showing an example of data, FIG. 4 is a diagram showing an example of data storage in an output buffer, and FIG.
FIG. 6 is a flow chart showing a main processing flow at the time of retrieval. FIG.
7 is a flowchart showing a detailed processing flow of calculating a search frequency by priority. In the drawing, 1 is a keyboard, 2 is a pointing device, 3 is an input control unit, 4 is a search condition creating unit, 5 is a priority order creating unit, 6 is a search unit, 7 is a search frequency total unit, and 8 is a maximum number of cases detected. Unit, 9 is the lowest priority number monitoring unit, 10 is the sorting control unit, 11 is the search data storage unit, 12 is the document data storage unit, 13 is the output buffer, 14 is the output control unit, 15 is the display device, and 16 is the display device. Printer.

Claims (3)

(57) [Claims] 1. A method for storing a plurality of documents, a search item paired with the document, and search data including an item element constituting the search item, wherein the search item set by a user, the item element, and Search condition creation means for creating search conditions by a logical operation on them, search means for comparing the search data with the search conditions and outputting matched search data to an output buffer, and stored in the output buffer. An electronic filling device having document output means for outputting a document corresponding to search data, wherein: a first means for setting a priority designated by a user to each of the search items and the item elements; In accordance with the priority set for each search item and the number of search items having the same priority, a predetermined weight (higher frequency) is set. The search frequency assigned to each search item is calculated (search frequency), and the search frequency assigned to each search item is assigned to each item element constituting the search item by the first means. Means for assigning and assigning according to the set priority and the number of item elements having the same priority, and the sum of the search frequencies of the item elements of the search data output to the output buffer (total search frequency ) To calculate the third
Means, and a fourth means for rearranging the output order of the documents by the document output means based on the information on the total search frequency calculated by the third means. 2. An electronic filling apparatus according to claim 1, wherein said means for setting the maximum number of search documents output by said document output means is greater than the maximum number of search documents set by said means. Means for deleting the search data having the smallest total search frequency from the output buffer when the search data is output to the output buffer. 3. An electronic filling apparatus according to claim 1, wherein: a means for setting a minimum search frequency of said total search frequency; and a minimum search frequency set by said means. Means for deleting the search data less than the frequency from the output buffer.