JP2008176545A - Computer system for data retrieval, computer program for realizing data retrieval and method thereof - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently retrieve required data from among a large quantity of data. <P>SOLUTION: A retrieval term file, a full text file and an item management file are stored in a storage device of a computer. A prescribed retrieval keyword is input and the full text data file is retrieved on the basis of the keyword. Then, the item management file is retrieved on the basis of the retrieved result and the contents of an item management record are displayed. Further, an itemized retrieval keyword and the retrieval keyword are input, the item management file is retrieved on the basis of the itemized retrieval keyword and the full text data file is retrieved on the basis of the retrieved result. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a data search system, and more particularly to a system for efficiently searching for desired data from a large amount of data.

  Currently, there are many computer systems for retrieving data. Among them, there is a so-called full-text search system suitable for searching for desired data from a large amount of data. This is because a search word (search term) called an index is extracted and stored from a large amount of data, and when the system is requested to search for a desired search keyword, the word corresponding to the keyword is searched from the index. Search.

Full-text search system Namazu, [online], author unknown, [search January 18, 2007], Internet <URL http://www.namazu.org/>

Since this full-text search system is suitable for searching desired data from a large amount of data, it is widely used in various fields.
However, since this system searches from a large amount of data, there is a problem that search accuracy is low and efficient search processing cannot be performed. For example, when searching from a large number of patent specification full text databases, if you use a general term such as “printing system” or “water purification device” as a search keyword, you can search and extract more data than necessary. Therefore, there is a problem that desired data cannot be searched efficiently.
In addition, this system only displays the search result when data is searched, and does not perform any further processing. Therefore, there is a problem that the result of the corner search cannot be effectively used.
Accordingly, there is a need for a search system that can improve search accuracy and perform efficient search processing, a search system that can effectively use searched data, and the like.

The present invention is, for example, a computer system including the following means, a method in which the computer performs the following processing (steps), and a computer program that causes the computer to function as follows.
(1) Item information associating item identification information for identifying an item, item-specific auxiliary information into which item text and item auxiliary information are classified, and an individual terminology that collects terms suitable for search from the text First item information group storage means for storing item information groups including a plurality of items, first search keyword reception means for receiving input of a first search keyword, and second search for receiving input of second search keywords and search target items for each item Keyword receiving means, first search means for searching for the case specifying information of the case corresponding to the second search keyword from the search target items of the item-specific attached information, and the case specifying information searched by the first searching means An individual terminology extraction unit for extracting an individual terminology associated with the first terminology from the individual terminology extracted by the individual terminology extraction unit Second search means for generating and outputting a search result related to the case is provided.
(2) second item information group storage means for storing item information group including a plurality of item information that associates item identification information for specifying an item, item text, and item-specific auxiliary information into which item auxiliary information is classified; A first search term collection storage means for storing a search term collection in which terms suitable for a search are collected from the text, a third search keyword reception means for receiving an input of a third search keyword for each item and a search target item, A third search means for searching for the case specifying information of the case corresponding to the third search keyword from the search target items of the item-specific attached information, a case specified by the case specifying information searched by the third search means The first reorganization search terminology creation means for reorganizing the terms suitable for the search from the body and creating the reorganization search terminology, and accepting the input of the fourth search keyword Search keyword receiving means, and fourth search means for searching the reorganized search terminology based on the fourth search keyword to create and output a search result.
(3) Limit amount storage means for storing a limit amount for limiting the amount of search target, search target amount specifying means for specifying the search target amount, and the reorganization based on the limit amount and the search target amount Judgment means for judging whether or not processing is necessary is provided.
(4) A start time storage means for storing a reorganization start time for designating a time for starting the reorganization process, and a reorganization process start means for starting the reorganization process at the reorganization start time.
(5) Third case information group storage means for storing a case information group including a plurality of pieces of case information in which case specifying information for specifying a case and the main text of the case are associated; a term suitable for a search is collected from the main text Search from the text of the case specified by the second search term collection storage means for storing the search term collection, the reorganization case specification means for specifying the case for reorganizing the search term collection, and the reorganization case specification means Based on the fifth search keyword, a second reorganization search term collection creating means for reorganizing the terms suitable for the reorganization and creating a reorganization search glossary, a fifth search keyword receiving means for accepting the input of the fifth search keyword And a fifth search means for searching the reorganized search terminology and generating and outputting a search result.
(6) Limit amount storage means for storing a limit amount for limiting the amount to be searched;
Search target amount specifying means for specifying the search target amount, and determination means for determining whether or not the reorganization processing is necessary based on the limit amount and the search target amount.
(7) A start time storage unit that stores a reorganization start time that specifies a time at which the reorganization process is started, and a reorganization process start unit that starts the reorganization process at the reorganization start time.
(8) Item information associating item identification information for identifying an item, item-specific auxiliary information into which item text and item auxiliary information are itemized, and an individual glossary that collects terms suitable for search from the main text Item information group storage means for storing a case information group including a plurality of items, sixth search keyword reception means for receiving input of a sixth search keyword, and item specification information of a case including the sixth search keyword from the entire glossary 6th search means for searching, based on the case specifying information searched by the sixth search means, searching the attached information of the case specified by the case specifying information from the item-specific attached information, and obtaining the attached information Seventh search means for outputting is provided.

The present invention has the following effects.
(1) If the present invention is used, desired data can be efficiently retrieved from a large amount of data in a short time. That is, in the present invention, since the full text search is performed after narrowing down the items first, the search accuracy can be remarkably improved without searching for irrelevant data. As a result, it is possible to avoid inconveniences such as the fact that irrelevant data is included in the search result and the meaningful search cannot be performed even though the corner search is performed.
(2) In the present invention, search terms are reorganized into one search term, so that it is possible to instantly cope with a search for keywords that are not determined in advance.
Also, by making the search terms one (one) search terms, the limit number set in the full-text search system will not be exceeded, and even the number exceeding the limit number can be processed. It becomes possible.
Furthermore, since the start time can be specified, the re-creation process can be performed in a time zone in which the computer processing capacity is high, and the decrease in the processing capacity and the processing speed of the computer can be minimized.
(3) If the present invention is used, the result of the full text search can be used effectively. In other words, if the present invention is used, not only the result of the full text search can be known, but also the attached information of the searched item (for example, patent application number and publication date in the case of a patent case) can be known. After that, it is possible to save the trouble of performing a separate search operation in order to check the incidental information of the case again.

  The present invention relates to a data search system, and more particularly to a system for efficiently searching for desired data from a large amount of data. Hereinafter, description will be given based on the drawings.

A first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a schematic diagram showing hardware necessary for implementing the present invention. This is a schematic diagram of a general computer, and this computer is provided with an input device (keyboard or mouse), a processing device, a storage device, and an output device (display monitor or printer).
The storage device stores a computer program and predetermined data for realizing the present invention, and the computer performs predetermined processing in accordance with processing instructions of the computer program.

Next, the contents of data stored in the storage device will be described. In the present embodiment, data used when searching for application documents containing a desired keyword from among the entire text of a large number of patent applications will be described as an example.
The storage device stores the full-text data file, the search term file, and the case management file shown in FIGS.
FIG. 2A shows the first record (full text data record) included in the full text data file. The full text data record is a data record in which the full text of the patent application document (case text) is associated with the URL used to display it. A plurality of these are collected as a full text data file.

FIG. 2B shows the first record (search term record) included in the search term file. A search term record is a data record (individual glossary) in which a search term is associated with the aforementioned URL. A collection of a plurality of these is a search term file (overall terminology, search terminology).
The search term is a collection of only terms suitable for the search extracted from the entire patent application documents. For example, when there is a description of “a printing system using the Internet” in the entire application document, terms such as “Internet”, “use”, and “printing system” are extracted and collected.

(C) of FIG. 2 represents the 1st record (case management record) contained in a case management file. The case management record is an item that includes information on the case (patent application number, filing date, patent publication number, publication date, invention name, inventor, patent applicant name, full text search connection number, etc.). Data records associated with each other, and a plurality of these are collected as matter management files (item-specific attached information).
The three files (full text data file, search term file, and case management file) are associated with the last three digits of the URL (001: case specifying information) and the full text search connection number (001: case specifying information). This serves as a project information group, and each record plays a role as project information. The storage device storing these data includes a first case information group storage means, a second case information group storage means, a third case information group storage means, a first search term collection storage means, and a second search term collection. Acts as a storage means.
The above is the details of the data shown in FIG. The data from FIG. 3 to FIG. 5 is the same data as the data in FIG.

Next, the characteristics of the data shown in FIGS. 2 to 5 will be described.
(1) In the first record of FIG. 2, it is assumed that a company called ABC Corporation is a patent applicant, and the full text of the application documents and the search term include the word “printing system”.
(2) The fifth record in FIG. 3 also has a company named ABC Corporation as a patent applicant, and the full text of the application documents and the search term include the word “printing system”.
(3) The eighth record in FIG. 4 is that the company DEF Co., Ltd. is a patent applicant, and the full text of the application documents and the search term include the word “printing system”. In addition, the applicant of the patent application shown in the eighth record is “DEF Co., Ltd.”, but the full text of this patent application document includes the phrase “For example, ABC Co., Ltd. specialized in poster printing”. Therefore, it is assumed that the search term includes the word “ABC Inc.”.
(4) The tenth record in FIG. 5 is a company named ABC Inc., which is a patent applicant, but the full text of the application documents and the search term do not include the word “printing system”.

Next, an example of search processing will be described. In this embodiment, an efficient search process is performed by inputting a search keyword, first searching for a case management file to narrow down the search target in advance, and then searching for a search term file.
In the present embodiment, a case where a searcher searches for the entire application document including the keyword “printing system” filed by “ABC Inc.” will be described as an example. In this case, the searcher uses “ABC Co., Ltd.” and “Printing System” as search keys. The effect of the search process is greatly different from the case where the search term file is subsequently searched). Hereinafter, it demonstrates, comparing both.

First, a case where only full text search is performed as in the prior art will be described.
In this case, the processing device accepts “search keyword =“ ABC Inc. ”and“ printing system ”” from the input device, and searches the search term file. As a result, the records shown in FIGS. 2, 3, and 4 including “ABC Inc.” and “printing system” are retrieved. The problem here is that even the records shown in FIG. 4 have been searched. That is, the searcher wants to search for the application “ABC Co., Ltd.”, but the search is performed up to the record in FIG. This is because the full text of the application document in FIG. 4 has a single sentence in the “Background Technology” column that reads “Specialized in poster printing from ABC Inc.” and the search term “ABC Inc.” is included. This is because. For this reason, in the prior art, even an unrelated record in FIG. 4 is searched (by only full-text search), which causes a problem that the search accuracy is lowered. In the present embodiment, only one of the three cases is searched excessively, so the problem of this reduction in search accuracy does not seem to be a big problem, but this is a case where hundreds of thousands of data are searched. This is a very serious problem, and there is such a limit in the prior art.

  On the other hand, if the search process according to the present embodiment is performed, such a problem does not occur. Hereinafter, a search process (a process of first searching for a case management file and then searching for a search term file) according to the present embodiment will be described.

<Search keyword input>
In the case of the present embodiment, the processing apparatus includes “search object = patent applicant column (search object item)”, “applicant name = ABC Co., Ltd. (second search keyword and third search keyword for each item)” and “search An input of a search keyword “keyword = print system (first search keyword)” is received from the input device. A processing device that performs this process serves as a first search keyword receiving unit, a second search keyword receiving unit, and a third search keyword receiving unit.

<Matter file search>
Next, the processing apparatus searches “ABC Inc.” in the “patent applicant” column of the case management file. As a result, the processing device searches the records of FIGS. 2, 3, and 5 corresponding to “ABC Inc.” and specifies the full-text search connection numbers (case specifying information) of 001, 005, and 010. At this time, the record in FIG. 4 is not searched because the patent applicant field is “DEF Co., Ltd.”. In addition, the processing device that performs this process plays a role as the first search means.

<Search term file search>
Next, the processing device searches the search term file corresponding to the searched full-text search connection number (001) of FIG. 2 from the search term file, and thereby the search term record of FIG. 2 is first searched and extracted. Note that the processing device that performs this process plays a role as individual terminology extraction means.

<Search term field search>
Next, the processing apparatus searches for a record including “printing system” from the search term column of the search term record of FIG. Since the search keyword “printing system” exists in the search term column of FIG. 2, the processing device creates a search result like the first case in FIG. 6 (if no “printing system” exists, no search result is created). ).
Then, the processing apparatus performs the processing of <search term file search> and <search term column search> for the records of FIGS. 3 and 5 and displays the created search results on the display monitor as shown in FIG. Output. Note that the processing device that performs this process plays a role of the second search means.

  In this way, it is possible to search only the records of FIG. 2 and FIG. 3 requested by the searcher without searching for the irrelevant records of FIG. 4 (records of applicant DEF, Inc.). That is, the search accuracy is greatly improved and the search time can be shortened.

A second embodiment of the present invention will be described.
As described in the first embodiment, the conventional technique (full-text search system) has a problem that the search accuracy is low, and the search accuracy can be improved by making it as in the first embodiment. However, there are two further problems in the prior art and the invention of the first embodiment. In the present embodiment, an invention that can solve these two problems will be described.

First, the first problem will be described.
In the first embodiment, when searching for a search term file, the same processing is repeated as many times as the number of cases searched in <Search case management file>. That is, since the case management file was searched and “patent applicant = ABC Inc.” was searched three times, the processing device repeated <search term file search> and <search term column search> three times. In the first embodiment, this same process is repeated three times, so that a large load is not applied to the computer. However, if this process is repeated dozens or hundreds of times, a large load is applied to the computer, causing problems such as a decrease in the processing capacity of the computer and a decrease in the processing speed. Therefore, in the case of the prior art and the first embodiment, it is necessary to limit the number of cases that can be processed at one time. For example, data is stored in the storage device such as “limit number of cases = 50”, and the number of cases beyond that cannot be processed at one time. However, there are many requests for searching beyond the limit number in daily work, but the first embodiment cannot meet this request. That is, the conventional technique and the first embodiment have a problem that processing exceeding a certain number cannot be performed.

Next, the second problem will be described.
In the first embodiment, a case where to search in advance what kind of search keyword "printing system" of the Corporation ABC has been determined has been described as an example.
However, there are many cases where search keywords are not determined in advance in daily work. For example, there is a case where “A printing system” of ABC Co., Ltd. is searched, and thereafter, “Copier” of ABC Co., Ltd. is further searched. That is, in addition to searching for a predetermined keyword, there are many cases in which a searcher searches variously for a search keyword that has been determined in advance during the search.

When the searcher wants to search for “copier” of ABC Co., Ltd. in this way, in the first embodiment, <Matter management file search>, <Search term file search>, and <Search term column search> are all performed again. It will be.
However, among these processes, <Matter management file search> and <Search term file search> are exactly the same processes and are useless. Especially when searching for dozens or hundreds of matter management files, the processing time of <Matter management file search> and <search term file search> is long, and the search results are output. There is a problem that becomes slow. As described above, there is a problem in the prior art and the first embodiment that a search result cannot be provided at an early stage in response to a new search request.
The invention described in this embodiment solves these problems. This will be described in detail below.

  The hardware shown in FIG. 1 and the data shown in FIGS. 2 to 5 are the same as those in the first embodiment. Further, in this embodiment, it is assumed that “the limit number (limit amount) = 50” and “specified time (start time) = AM 2:00” are stored in the storage device of FIG. 1 (limit amount storage means) , Start time storage means). Note that, as described above, the limit number represents the limit of the number of processing cases (the limit of the number of cases that can be processed at one time) provided in order not to reduce the processing capacity of the computer. The designated time designates a time for starting a <search term re-creation process> to be described later.

In the case of the present embodiment, first, the processing device accepts only “search target item = patent applicant name” from the input device, and searches the case management file (third search means). As a result, 70 records (amount to be searched) corresponding to “patent applicant = ABC Inc.” are searched and specified. That is, the processing apparatus has identified 70 cases here (reorganization case specifying means).
Next, the processing device compares the 70 cases with the limit number of 50 cases to determine whether the limit number is exceeded (reorganization processing is necessary) (determination means).
When the limit number is exceeded, the processing device performs the following <start time confirmation processing> and <search term re-creation processing>. Hereinafter, these processes will be described.

<Start time confirmation process>
The processing apparatus acquires the current time periodically (for example, every minute) from a clock (time acquisition means) provided in the computer, and determines whether or not AM 2:00 of the designated time has come. When the start time is reached, the following <search term re-creation processing> is performed (reorganization processing start means).

<Search term recreation processing (reorganization processing)>
The processing device searches the last three digits of the URL of the full text data file using the full text search connection number “001” of the case management record (FIG. 2) searched from the case management file as a search key, and thereby the full text data of FIG. A record is retrieved. Next, words suitable for the search are extracted from the entire application documents shown in FIG. 2, and the first reorganized search term is created as shown in FIG. Note that the word extraction process suitable for the search term is a known process. At that time, the last three digits “001” of the URL are added to the head of the reorganized search term.
Then, the processing apparatus performs this re-creation processing for the other 69 cases searched for by <Matter management file search>. As a result, a reorganization search term as shown in FIG. 7 is finally created. In other words, the processing device creates a re-edit of 70 search term records into one search term record. The processing device that performs this process serves as first reorganization search term collection creation means and second reorganization search term collection creation means.

Next, the processing device receives an input of “search keyword = print system (fourth search keyword, fifth search keyword)” from the input device (fourth search keyword receiving means, fifth search keyword receiving means). Then, the processing device searches the reorganization search terms for a word that matches the “printing system” and creates a search result as shown in FIG. 8 (fourth search means, fifth search means). At this time, the processing device includes the last three digits of the URL such as “001” in the search result.
If the searcher wants to search for “copier” (keyword not decided in advance) of ABC Corporation, the processing device accepts the input of “search keyword = copier” from the input device, and sets the reorganized search term. A word matching “copier” is searched from the inside, and a search result similar to FIG. 8 is created.

In this way, in this embodiment, since 70 search terms are reorganized into one search term, it is possible to instantly cope with a search for keywords that are not determined in advance. That is, the search processing is performed without repeating <Matter management file search> and <Search term file search> 70 times, so that the search result can be provided quickly, and the processing capacity is reduced by applying an excessive load on the computer. The inconvenience can be avoided.
Also, by making 70 search terms into one (one) search term, the limit number set in the full-text search system will not be exceeded, and even if the number exceeds the limit number in practice. It can be processed.
Furthermore, since the start time can be specified, the re-creation process can be performed in a time zone in which the computer processing capacity is high, and the decrease in the processing capacity and the processing speed of the computer can be minimized. In other words, the computer performs various processes during the daytime, and re-creation processing during this period places a load on the computer and adversely affects other processes. The risk of giving is minimized.

The present embodiment may be as follows.
(1) In this embodiment, the case management file is searched and the item to be reorganized is specified. However, if the item to be reorganized is known in advance, the case management file need not be searched. In this case, the processing apparatus receives from the input apparatus specific information about the case that is known in advance. At this time, the processing device that receives the specific information of the known case serves as a reorganized item specifying means.
(2) In this embodiment, reorganization terms are created by extracting terms suitable for search from the entire application documents, and reorganization processing is performed. This is performed by searching a search term record (individual glossary). The reorganization process may be performed by incorporating the words in the term column into the reorganization search term.
(3) In this embodiment, one reorganization term is used, but a plurality of reorganization terms may be used. That is, any number of reorganization search terms may be used as long as the limit number is not exceeded. In this case, it is stored in advance in the storage device such as “number of reorganized search terms = 3”, but this may be set in a range not exceeding the limit number.

Next, a third embodiment of the present invention will be described.
In the conventional full-text search system, the processing device receives an input of a search keyword, searches for a search term file, displays the search result, and ends the process.
However, in this embodiment, after searching the search term file, the matter management file is searched and the contents of the matter management record are displayed. Hereinafter, the search processing of the present embodiment will be described. The contents of the hardware in FIG. 1 and the data in FIGS. 2 to 5 are the same as in the first embodiment.

For example, suppose that the searcher searches the entire application document including the keyword “printing system” and wants to know the attached information (application number, publication number, etc.). In this case, the processing device receives “search keyword = print system” (sixth search keyword) from the input device (sixth search keyword receiving means).
Next, the processing apparatus searches for a search term record including the word “printing system” from the search term file (sixth search means). In the present embodiment, since the word “printing system” is included in the records of FIGS. 2, 3, and 4, these three records are searched.

Next, the processing device searches the case management file using the last three digits (001, 005, 008) of the URLs of these three records as a search key, and the contents of the searched case management records (the case management record, FIG. The matter management record in FIG. 3 and the contents of the matter management record in FIG. 4 are displayed (output) on the display monitor as shown in FIG. 9 (seventh search means).
In this way, not only the full text search but also the attached information such as the patent application number and the publication number can be known, so the result of the full text search can be used effectively.

Although specific cases have been described in the above embodiments, the present invention is not limited to these specific cases. For example, the following cases may be used.
(1) In the above embodiment, the patent matter search process has been described as an example, but the present invention is not limited to this. For example, it can be used in various scenes such as search for academic papers and books.
(2) The content of the data is not limited to the data described in the embodiment. That is, any other data may be used as long as it can play the same role. For example, the search term file of the above embodiment has both the role of individual terminology and the whole terminology, but this search term file is divided into two and one side has the role of individual terminology, and the other is the terminology glossary. You may give the role. Further, the number of search target items may be one or plural. In the above embodiment, the last three digits of the URL and the full-text search connection number are used as the case specifying information, but the present invention is not limited to this. Any information can be used as long as it can identify the project. Furthermore, the limit number is not limited to 50 and may be any numerical value.
(3) The hardware is not limited to that described in the embodiment. That is, any other hardware may be used as long as it can play the same role. For example, in the above-described embodiment, all processing is performed by one computer, but this may be performed in a distributed manner by a plurality of computers.
(4) The processing contents and procedures are not limited to those described in the embodiment. That is, any other processing content / procedure may be used as long as it can play the same role.
(5) It is assumed that data (data items) of data (data records, files) appearing in the above-described embodiments are stored in association with (associated with) each other in principle. The same applies to what is shown in the drawings.

It is a figure which shows the outline of the hardware utilized by this invention. It is a figure which shows the 1st record of a search term file. It is a figure which shows the 5th record of a search term file. It is a figure which shows the 8th record of a search term file. It is a figure which shows the 10th record of a search term file. It is a figure which shows the display content of the search result regarding a case. It is a figure which shows the search term re-edited. It is a figure which shows the result of having searched the re-edited search term. It is a figure which shows the display content of the searched accessory information.

Claims (24)

Includes multiple item information that associates item identification information that identifies an item, item-specific accessory information that categorizes the item text and item incidental information, and an individual glossary that collects terms suitable for searching from the text First case information group storage means for storing the case information group, first search keyword reception means for receiving input of the first search keyword, second search keyword reception means for receiving input of the second search keyword and search target item for each item The first search means for searching for the case specifying information of the case corresponding to the second search keyword from the search target items of the item-specific attached information, and the case specifying information searched by the first search means An individual terminology extracting means for extracting the individual terminology, and an item including the first search keyword from the individual terminology extracted by the individual terminology extracting means. Computer system for data retrieval, characterized in that it comprises a second search means for creating and outputting a search result that. Second item information group storage means for storing item information group including a plurality of item information that associates item specifying information for specifying an item, item text, and item-specific auxiliary information into which item auxiliary information is classified, A first search term collection storage means for storing a search term collection in which terms suitable for a search are collected, a third search keyword reception means for accepting input of a third search keyword for each item and a search target item, and attachment for each item Third search means for searching for the case specifying information of the case corresponding to the third search keyword from the search target items of information, and the text of the case specified by the case specifying information searched by the third search means First reorganization search terminology creation means for reorganizing the terminology suitable for the search from the list and creating a reorganization search terminology, and a fourth search key for receiving the input of the fourth search keyword Computer system for data retrieval, characterized in that it comprises the word receiving unit, the fourth search means for creating and outputting a search result by searching the restructuring search glossary based on the fourth search keyword. Limit amount storage means for storing a limit amount for limiting the search target amount, search target amount specifying means for specifying the search target amount, and the reorganization processing is necessary based on the limit amount and the search target amount 3. The computer system for data retrieval according to claim 2, further comprising a judging unit for judging whether or not. The reorganization process start means for starting the reorganization process at the start time storage means for storing the reorganization start time for designating the time for starting the reorganization process and the reorganization start time. A computer system for retrieving data according to claims 2 to 3. A third item information group storage means for storing item information group including a plurality of item information in which item specifying information for specifying an item and the item text are associated with each other; a search terminology for collecting terms suitable for search from the main item Second search term collection storage means for storing, reorganization case specifying means for specifying a case for reorganizing the search terminology, suitable for searching from the text of the case specified by the reorganization case specifying means Second reorganization search term collection creating means for performing a reorganization process for collecting terms again to create a reorganization search glossary, fifth search keyword receiving means for receiving input of a fifth search keyword, and the reorganization based on the fifth search keyword A computer system for data search, characterized by comprising fifth search means for searching a search terminology and generating and outputting a search result. Limit amount storage means for storing a limit amount for limiting the amount to be searched;
6. A search target amount specifying means for specifying a search target amount, and a determination means for determining whether or not the reorganization processing is necessary based on the limit amount and the search target amount. Computer system for data retrieval. The reorganization process start means for starting the reorganization process at the start time storage means for storing the reorganization start time for designating the time for starting the reorganization process and the reorganization start time. A computer system for data retrieval according to 5 to 6. Includes multiple item information that associates item identification information that identifies an item, item-specific accessory information that categorizes the item text and item incidental information, and an individual glossary that collects terms suitable for searching from the text A case information group storing means for storing a case information group, a sixth search keyword accepting means for accepting an input of a sixth search keyword, and a search for item specific information of a case including the sixth search keyword from the entire glossary. 6 searching means, searching the attached information of the case specified by the case specifying information from the item-specific attached information based on the case specifying information searched by the sixth searching means, and outputting the attached information 7. A computer system for data search, comprising a search means. Item information that associates computer with item identification information that identifies an item, item-specific accessory information that categorizes the item text and item attachment information, and an individual terminology that collects terms suitable for search from the above-mentioned text First item information group storage means for storing item information groups including a plurality of items, first search keyword reception means for receiving input of a first search keyword, and second search for receiving input of second search keywords and search target items for each item Keyword receiving means, first search means for searching for the case specifying information of the case corresponding to the second search keyword from the search target items of the item-specific attached information, and the case specifying information searched by the first searching means Individual terminology extraction means for extracting an individual terminology associated with the first term keyword from the individual terminology extracted by the individual terminology extraction means Computer program for data retrieval, characterized in that function as a second search means for creating and outputting a search result related matters including. Second item information group storage means for storing item information group including a plurality of item information in which the computer associates item specifying information for specifying an item, item text, and item-specific auxiliary information into items. A first search term collection storage means for storing a search term collection in which terms suitable for a search are collected from the text, a third search keyword reception means for receiving an input of a third search keyword for each item and a search target item, A third search means for searching for the case specifying information of the case corresponding to the third search keyword from the search target items of the item-specific attached information, a case specified by the case specifying information searched by the third search means The first reorganization search terminology creation means for reorganizing and reorganizing the terms suitable for the search from the above-mentioned body to create the reorganization search terminology, and receiving the fourth search keyword And a fourth search keyword receiving means for functioning as a fourth search means for searching the reorganized search terminology based on the fourth search keyword and generating and outputting a search result. program. Limit amount storage means for storing a limit amount for limiting the search target amount, search target amount specifying means for specifying the search target amount, and the reorganization processing is necessary based on the limit amount and the search target amount The computer program for data retrieval according to claim 10, wherein the computer program is made to function as a determination means for determining whether or not. 2. A start time storage unit that stores a reorganization start time that specifies a time for starting the reorganization process, and a reorganization process start unit that starts the reorganization process at the reorganization start time. Item 12. A computer program for data retrieval according to items 10 to 11. A third case information group storage means for storing a case information group including a plurality of pieces of case information in which the case specifying information for specifying the case and the case text are associated with each other, the term suitable for the search is collected from the text Search from the text of the case specified by the second search term collection storage means for storing the search term collection, the reorganization case specification means for specifying the case for reorganizing the search term collection, and the reorganization case specification means Based on the fifth search keyword, a second reorganization search term collection creating means for reorganizing the terms suitable for the reorganization and creating a reorganization search glossary, a fifth search keyword receiving means for accepting the input of the fifth search keyword A computer program for data search, wherein the computer program functions as fifth search means for searching the reorganized search terminology and generating and outputting a search result. Limit amount storage means for storing a limit amount for limiting the amount to be searched;
14. A search target amount specifying means for specifying a search target amount, and a determination means for determining whether or not the reorganization processing is necessary based on the limit amount and the search target amount. Computer program for retrieving described data. 2. A start time storage unit that stores a reorganization start time that specifies a time for starting the reorganization process, and a reorganization process start unit that starts the reorganization process at the reorganization start time. Item 15. A computer program for data retrieval according to items 13 to 14. Item information that associates computer with item identification information that identifies an item, item-specific accessory information that categorizes the item text and item attachment information, and an individual terminology that collects terms suitable for search from the above-mentioned text Item information group storage means for storing a case information group including a plurality of items, sixth search keyword reception means for receiving input of a sixth search keyword, and item specification information of a case including the sixth search keyword from the entire glossary 6th search means for searching, based on the case specifying information searched by the sixth search means, searching the attached information of the case specified by the case specifying information from the item-specific attached information, and obtaining the attached information A computer program for data search, characterized by functioning as seventh search means for outputting. Item information in which the computer associates item identification information for identifying an item, item-specific auxiliary information into which item text and item incidental information are classified, and an individual terminology that collects terms suitable for search from the main text First item information group storing step for storing item information groups including a plurality of items, a first search keyword receiving step for receiving input of a first search keyword, and a second search for receiving input of second search keywords and search target items for each item A keyword accepting step, a first search step for searching for case specifying information of a case corresponding to the second search keyword from the search target items of the item-specific attached information, and the case specifying information searched by the first searching step Individual glossary extraction step for extracting an individual glossary associated with the individual glossary, and the individual glossary extracted by the individual glossary extraction step The method for data retrieval and performing a second search step of creating and outputting the search results for projects including the first search keyword from within. A second item information group storage step in which a computer stores item information groups including a plurality of item information in which item identification information for identifying an item, item text, and item-specific auxiliary information into which item auxiliary information is classified; A first search term collection storage step for storing a search term collection in which terms suitable for a search are collected from the text; a third search keyword reception step for receiving an input of a third search keyword for each item and a search target item; A third search step of searching for item specifying information of a case corresponding to the third search keyword from the search target items of the item-specific attached information, a case specified by the case specifying information searched by the third search step A first reorganization search terminology creation step for creating a reorganization search terminology by performing a reorganization process for recollecting terms suitable for the search from the body of the text; A data search comprising: a fourth search keyword receiving step for receiving a search keyword input; and a fourth search step for searching the reorganized search terminology based on the fourth search keyword to create and output a search result. Way for. A limit amount storing step for storing a limit amount for limiting the amount of search target, a search target amount specifying step for specifying the amount of search target, and the reorganization processing based on the limit amount and the search target amount The method for data retrieval according to claim 10, further comprising a determination step of determining whether or not. The start time storing step for storing a reorganization start time for designating the time for starting the reorganization processing, and the reorganization processing start step for starting the reorganization processing at the reorganization start time are performed. A method for data retrieval according to 10 to 11. A third case information group storing step for storing a case information group including a plurality of pieces of case information in which the case specifying information for specifying the case and the case text are associated with each other, collecting terms suitable for searching from the text A second search term storage step for storing a search terminology, a reorganization item specification step for specifying a case for reorganizing the search terminology, and a search from the body text of the case specified by the reorganization item specification means Based on the fifth search keyword, a second reorganization search term collection creation step for creating a reorganization search glossary by reorganizing the terms suitable for the search, a fifth search keyword reception step for accepting the input of the fifth search keyword, and the like. And performing a fifth search step of searching the reorganized search terminology and generating and outputting a search result. A limit amount storing step for storing a limit amount for limiting the amount of search target;
The search target amount specifying step for specifying a search target amount, and a determination step for determining whether or not the reorganization processing is necessary based on the limit amount and the search target amount are performed. For data retrieval. The start time storing step for storing a reorganization start time for designating the time for starting the reorganization processing, and the reorganization processing start step for starting the reorganization processing at the reorganization start time are performed. 15. A method for data retrieval according to 13-14. Item information in which the computer associates item identification information for identifying an item, item-specific auxiliary information into which item text and item incidental information are classified, and an individual terminology that collects terms suitable for search from the main text A case information group storing step for storing a plurality of case information groups, a sixth search keyword receiving step for receiving an input of a sixth search keyword, and item specification information of a case including the sixth search keyword from the entire glossary A sixth search step for searching; searching for the attached information of the case specified by the case specifying information from the item-specific attached information based on the case specifying information searched by the sixth search step; A method for data retrieval, comprising performing a seventh retrieval step of outputting.

Images