JPS6325774A - Information registering/retrieving device - Google Patents

Abstract

PURPOSE:To quickly and easily retrieve the desired information by showing the next effective retrieving key to an operator if the perfect coincidence is not secured between the retrieving result and the desired information. CONSTITUTION:When a retrieving key word is supplied from a retrieving key input part 19, an information retrieving part 17 retrieves the register information out of an information memory part 14 based on said key word. The retrieving result is stored in a retrieving result memory part 18 and also displayed at an information output part 24. A next retrieving key lead-out part 23 leads out a retrieving key effective to the next retrieval. This led-out key word is stored in a next retrieving key memory part 25 and also displayed at a next retrieving key display part 26.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to an information registration and retrieval device for registering and retrieving information such as documents and images.

2. Description of the Related Art In recent years, large-capacity storage devices such as optical disks have become available at low cost, and devices for registering and searching information such as documents and images are being actively developed. Below, a conventional device for registering and searching a large amount of documents and the technology used therein will be explained.

When registering document information in a large-capacity storage device such as an all-party disk, an identifier that uniquely determines a certain document, such as a serial number of the document, is stored in pairs with the document information, and when searching for all documents, the document It is widely practiced to specify the identifier added to a document and extract the corresponding document information. However, when the amount of document information increases, the method of specifying an identifier that uniquely determines a document becomes clearly inconvenient. This is because the user must remember a pair of an arbitrarily determined identifier and document information related thereto. Therefore, instead of an identifier that uniquely determines the sentence V, words indicating the content 2 of the document are stored in correspondence with the document, and when the user specifies all the words, all the corresponding words are stored together. A common method is to extract document information. The above-mentioned words and phrases are called ordinary keywords, and the above-mentioned search method is called full ordinary keyword search.

In the case of a keyword search, it is rare that a certain keyword uniquely specifies all documents, so usually a plurality of pieces of document information are searched using one keyword. Therefore, it is common practice to assign a plurality of keywords to one piece of document information, and to designate a plurality of keywords when searching, thereby reducing the number of related document information. The configuration and operation of a conventional information registration and search device having these functions will be explained. FIG. 4 is a block diagram of a conventional information registration and search device. Reference numeral 1 in the figure denotes a registration information input section, which is used to input all information such as document information to be registered in an information storage section, which will be described later. −
For example, if the document information is in the form of image information, a scanner input device or the like is used as the registration information input section 1.

Reference numeral 2 denotes a registration key input section, which inputs all codes of registered keywords to be stored in an information storage section, which will be described later, along with the information input from the registration information input section 1. This is for example JI
It may be a kana keyboard defined in SC-6233 or a kana-kanji conversion device, or it may be a device that can manually input a plurality of registered keywords for one piece of registered information. Reference numeral 3 denotes an information registration section that additionally stores the registration information output from the registration information input section 1 and the registration keyword output from the registration key input section 2 as a pair in an information storage section to be described later. Reference numeral 4 denotes an information storage unit that stores registered information and registered keywords output from the information registration unit 3 as a pair. For example, a magnetic disk device or an original disk device is used as the information storage unit 4. The information storage section 4 is also referred to by an information search section, which will be described later.

Reference numeral 5 denotes a search key input section for entering a search keyword that should match the registered keyword stored in the information storage section 4. This is input in the form of a code. For example, this is JIS C-
It may be a kana keyboard specified in 6233 or a kana-kanji conversion device. Furthermore, it may be possible to simultaneously input a plurality of search keywords and logical operation relationships between them, such as a logical sum and a logical product. Reference numeral 6 denotes an information search unit that searches the information storage unit 4 for registered information having a registered keyword that satisfies the search keyword outputted from the search key input unit 6 and the logical operation relationship between these keywords, and searches the information storage unit 4 for registered information that satisfies all of the search keywords output from the search key input unit 6 and the logical operation relationships between them. If there is, output information specifying the relevant registration information. As the information for specifying all of the registered information, for example, the start address of the area in the information storage section 4 in which the registered information is stored is used. Here, a plurality of pieces of registration information designation information may be output for one set of search keywords and logical operation relationships between them. On the other hand, if there is no satisfying registered information, the information search unit 6 outputs information to that effect. Reference numeral 7 denotes an information output unit, which extracts the registration information specified by the registration information designation information outputted by the information search unit 6 from the information storage unit 4, and stores it temporarily or outputs it in other states such as visual information. Convert to

Further, when the information search section 6 outputs all the information indicating that "corresponding registered information is hot", it outputs that no registered information satisfying the search information could be searched in the information storage section 4.

The operation of the conventional information registration and search device configured as described above will be described below.

Registration operation (1) The operator inputs information to be registered through the registration information input section 1.

(2) The input information is stored in an internal buffer (not shown) of the information registration section 3.

(3) Next, the operator inputs a registered keyword from the registration key input section 2.

(4) The inputted registration keyword is stored in the internal buffer B (not shown) of the information registration section 3 in the form of a code.

(5) Next, the information registration unit 3 refers to the information storage unit 4 and starts from the start address C of the area where information is to be stored.

Furthermore, the information registration unit 3 sequentially transfers the contents of the internal barafam and B to addresses C and subsequent addresses of the information storage unit 4 (registration operation Owa#)) 0 Search operation (6) The operator enters the search keyword and information from the search key input unit 6. Depending on the case, logical operation relationships between these may also be input.

(7) The input search keywords are stored in the internal buffer yD (not shown) of the information search unit 6 in the form of a code together with the logical operation relationships between them.

(8) Next, the information search unit 6 checks whether the code information in the registered keyword area associated with each registered information stored in the information storage unit 4 matches the code information in the internal buffer D. , when a logical operation relationship between search keywords is set, it is further determined whether the condition is satisfied. When the code information in the registered keyword area associated with certain registered information satisfies the search conditions in the internal buffer D, it is sent to the address DRi information output section T of the storage area of the registered information, and the information is output. The data is stored in an internal buffer yK (not shown) of the unit 7. The comparison 9 determination with the above search conditions is performed for all registered information in the information storage section 4. If, as a result of performing the above inspection on all the registered information in the information storage unit 4, no information that satisfies the search conditions is found, information NOf uniquely indicating that fact is sent to the information output unit 7. The data is sent out and stored in the internal buffer E of the information output section 7.

(9) Next, the information output unit 7 reads the contents (5DR or No. 5) of the internal buffer IE and performs the following processing.

・If the contents of the internal buffer IE are MUDR: Information output section 7
extracts the registered information after address DR in the information storage section 4, converts it into visual information and outputs it, or extracts the registered keyword associated with the registered information and outputs it.

If a plurality of MUDRs are stored in the internal buffer E, the above process is repeated for each person's DH.

- If the content in the internal buffer is NO: the information output unit 7 outputs information to the effect that "corresponding information was not retrieved" as visual information.

(Retrieval Operation Details) A specific example of the operation of the conventional information registration and retrieval device that operates as described above will be described next.

(10) Now, let's consider a case where an operator registers a product catalog for a computer. In response to operator's operations (1) and (3), this device performs (2) and (4),
Perform operation (5).

(11) By repeating this series of procedures, a large number of registered information is stored in the information storage section 4. These registered information include characteristics of each computer, such as "microcomputer", "personal computer", and "office computer".

"Mini computer", "large computer".

"Standalone", "Host Computer J.

"Network", "Intelligent Terminal".

"Kanji display", "Graphic display", "General-purpose machine"
, "dedicated machine", etc. shall be assigned as registered keywords. For products with multiple characteristics, all of them shall be assigned as registered keywords.

(12) The operator then attempts to search the device for a catalog of products with relevant characteristics in order to perform product research. Here, by performing the operation (6), search keywords such as "personal computer", "standalone", and "network" are selected.

Enter the logical product of all items as the logical operation relationship between "Kanji display", "Graphic display" and the search keyword.

(13) At this time, if product catalogs having all the above-mentioned keywords are stored as registered information in the information storage section 4, those catalogs are output. At this time, if the product catalog is not stored as registered information in the information storage unit 4, the information output unit 7 will visually display the information that “corresponding information was not found” according to the steps c7) to (smell). Output as information.

(14) Next, the operator selects "personal computer" as a search keyword by operating step (6).

"Standalone", "Network J, R Kanji Display"
, "Graphic display" is input as a logical sum of all items as a logical operation relationship between search keywords. At this time (7
) to (9), the information output section 7 receives a "personal computer".

"Standalone", "Network", "Kanji display"
, "Graphic display" All registered information that is accompanied by at least one registered keyword is displayed.

Problems to be Solved by the Invention Conventional information registration and search devices only present information directly related to search result information, such as the number of search results and the actual display of search result information.
If you set inappropriate search conditions and the number of search results becomes too large or too small, you will need information 2 to make your next search more effective.
I couldn't get it.

In view of the above-mentioned problems that conventional information registration and search devices had, the present invention presents information directly related to search result information, such as the number of search results and an actual display of search result information, as a search result. In addition to this, information registration search makes it possible to easily and quickly set search conditions to be used in the next search by presenting search conditions that can be derived from the search conditions as search condition candidates for the next search. The purpose is to provide equipment.

Means for Solving the Problems In order to achieve all of the above objects, the present invention provides a registration information input unit for inputting information to be registered, and a registration information input unit for inputting a registration key for information input from the registration information input unit. a key input unit; an information storage unit that stores information input from the registration information input unit and a registration key for the information input from the registration key input unit as a pair; an information registration section for registering information, a search key input section for inputting the key of the information to be searched, a search key storage section for storing the input search key, and a search key storage section for storing the search key stored in the search key storage section. an information search unit that searches the information storage unit for information having the key as a registration key; a search result storage unit that stores information indicating each piece of information searched;
an information output section that outputs each piece of information in the search result storage section; a key relationship input section that inputs relationships between keys; and a rewritable key that stores relationships between keys input from the key relationship input section. a relationship storage unit, a key relationship management unit that manages key relationships in the key relationship storage unit, a key relationship output unit that outputs the contents of the key relationship storage unit, and a search key stored in the search key storage unit. and a next search key derivation unit that derives search conditions effective for the next search using the key relationships stored in the key relationship storage unit and each piece of information in the search result storage unit; This information registration and search device is equipped with a next search key storage unit that stores all of the output information, and a next search key display unit that displays the next search key stored in the next search key storage unit.

Effect of the present invention With the above-described configuration, the present invention presents all information directly related to the search result information, such as the number of search results and the actual display of the search result information, and also displays search results that are caused by setting inappropriate search conditions. When the amount of information becomes very large or, conversely, very small, the search conditions that can be derived from the search conditions are presented, and guidelines for conducting the next search effectively are presented. To easily and quickly set search conditions that are likely to be performed.

Embodiment Hereinafter, one embodiment of the present invention will be explained with reference to the drawings. In FIG. 1, reference numeral 11 denotes a registration information input section, which is used to input information such as document information to be registered in an information storage section, which will be described later. be. 12 is a registration key input section; registration information input section 1;
A registered keyword to be stored in the information storage unit, which will be described later, is input in the form of a code along with the information input from 1. This may allow input of a plurality of registered keywords for one piece of registered information. Reference numeral 13 denotes an information registration section that additionally stores the registration information output from the registration information input section 11 and the registration keyword output from the registration key input section 12 as a pair in an information storage section to be described later. Reference numeral 14 denotes an information storage section which stores a large number of pairs of registration information output from the registration information input section 11 and registered keywords output from the registration key input section 12.

For example, a magnetic disk device or an original disk device is used. A search key input section 15 is used to input a search keyword in the form of a code as a clue for retrieving registered information stored in the information storage section 14. This may be such that multiple search keywords can be input for one search operation. A search key storage unit 16 stores the key derived by the next search key derivation unit 23 and the key relationship used in the derivation process as a pair.

Reference numeral 17 denotes an information retrieval unit that retrieves registered information from the information storage unit 14 that includes registered keywords to which at least some of the search keywords stored in the search key storage unit 16 correspond.
Search from among them, and if applicable registration information exists, output information specifying that registration information. The specified information includes, for example, the information storage unit 14 in which the registration information is stored.
The start address of the area within is used. Here, a plurality of pieces of registration information designation information may be output for the input search keyword. Further, if there is no corresponding registered information, the information search unit 17 outputs information to that effect. Reference numeral 18 denotes a search result storage unit that stores registered information designation information output from the information search unit 17. Reference numeral 24 denotes an information output unit that retrieves registered information specified by each piece of information in the search result storage unit 18 from the information storage unit 14, and stores it temporarily or converts it into another state such as visual information. do. Further, when the information search section 17 outputs information indicating that "no corresponding registered information", it outputs that the registered information corresponding to the search keyword could not be searched in the information storage section 14. Reference numeral 19 denotes a key relationship input unit for inputting a definition of a relationship between keywords to be registered in a key relationship storage unit to be described later.

The relationship between keywords is not limited to the %2-ary relationship, but may include a general N-ary relationship. Examples of relationships include synonymous relationships, hierarchical relationships, and dependent relationships. 2o is the key relationship storage unit,
Memorizes many key relationships. 22 is a key relationship output unit which converts the key relationships stored in the key relationship storage unit 20 into visual information and displays it in an easy-to-understand manner. Reference numeral 23 denotes a next search key derivation unit which uses the search keys written in the search key storage unit 16 and the contents of the key relationship storage unit 20 to derive a search key effective for the next search. At this time, different search keys may be derived depending on the number of search results in the previous search stored in the search result storage unit 18. For example, when the number of search results is large, a search key is derived that reduces the number of search results, and conversely, when the number of search results is small, a search key is derived that increases the number of search results. 26 is a next search key storage unit that stores the output of the next search key derivation unit 23. A next search key display section 26 displays all next search keys stored in the next search key storage section 26. In addition, the next search key storage unit 26
By referring to the key relationships stored in pairs with the keys derived in , the key relationships are output in response to inquiries regarding the key relationships used in the derivation process.

The operation of the information registration and search device of the present invention configured as described above will be described below.

Registration operation (1) The operator inputs information to be registered from the registration information input section 11.

(2) The input information is stored in the internal bag 7F (not shown) of the information registration section 13.

(3) Next, the operator inputs all registered keywords from the registration key input section 12.

(4) The inputted registration keyword is stored in the internal buffer Q (not shown) of the information registration section 13 in the form of a code.

(5) The information registration unit 13 refers to the information storage unit 14, obtains the start address R of the area where information is to be stored, and sequentially transfers the contents of the internal buffers P and Q to the information storage unit 14 starting from address R. . (End of registration operation) Key relationship registration operation (6) The operator inputs the key relationship to be registered from the key relationship input section 19.

(7) The input information is stored in an internal buffer X (not shown) of the key relationship management section 21.

(8) The key relationship management unit 21 is the key relationship storage unit 20'lt
Refer to it to obtain the start address Y of the area where all the information should be stored,
The entire contents of the internal buffer x are sequentially transferred to address Y and beyond in the key relationship storage section 20.

Furthermore, the key relationship may be registered using a known method such as an indexing method or a hash method other than those described above.

(End of key relationship registration operation) Search operation (9) The operator inputs a search keyword from the search key input section 15. At this time, it may be possible to specify all the search keywords, and furthermore, it may be possible to specify all the logical products or logical sums between them.

(1o) The input search keyword is stored in the search condition storage unit 16 in the form of a code, and the information search unit 1
7 is stored in an internal buffer S (not shown).

(11) The information search unit 1 regards the keys stored in the search condition storage unit 16 as search keywords, searches the information storage unit 14 for registered information that has associated registered keywords corresponding to the keys, and searches the information storage unit 14 for registered information that has corresponding registered keywords. If there is registered information, the first address person DR of the area in the information storage unit 14 where the registered information is stored as information specifying the registered information.
is sent to the search result storage section 18. Furthermore, for the input search keyword, multiple registered information designation information A
DH may be output. Further, if there is no corresponding registered information, the information search unit 17 sends information NQi to that effect.
The search results are sent to the search result storage unit 18.

(12) The information output section 24 performs all of the following processing according to the content of the information in the search result storage section 18.

- When the content of the information is a person DH: The registered information specified by this is retrieved from the information storage section 14 and temporarily stored, or output after being converted into another state such as visual information.

- If the information content is No: The registered information corresponding to the search keyword is in the information storage unit 1
Outputs that the search was not possible within 4.

(13) The next search key derivation unit 23 determines the content of the search key storage unit 16 and the content of the key relationship storage unit 20 based on the number of items of information in the search result storage unit 18, which may be used for the next search. Derive the key. The derivation process usually takes place in multiple stages. At that time, the next search key derivation unit 23 may control the entire derivation process so that unnecessary derivation or duplicate derivation does not occur. As an example based on the number of pieces of information in the search result storage unit 18, the keyword for the next search is derived as follows, for example.

- When the number of pieces of information is large: Using the contents of the search key storage unit 16 and the contents of the key relationship storage unit 20, a search key that reduces the number of pieces of search information is derived. For example, keys representing lower-level concepts of the search key are derived, and their combination is set as the next search key.

- When the number of pieces of information is small: Using the contents of the search key storage section 16 and the contents of the key relationship storage section 20, a search key that increases the number of pieces of search information is derived. For example, keys representing higher-level concepts of the search key are derived, and their combination is set as the next search key.

The final result of key derivation is stored in the next search key storage section 25.

(14) The next search key display section 26 is the next search key storage section 26
The search keyword candidates for the next search stored in are converted into visual information and displayed. Further, by referring to the key relationships stored in pairs with the derived key in the next search key storage unit 26, it is possible to output them in response to inquiries regarding the key relationships used in the derivation process. (Search Operation Details) A specific example of the operation of the information registration and search apparatus of the present invention that operates as described above will be described with reference to a case where an operator registers and searches a product catalog of a computer. In order to simplify the explanation, it is assumed here that the key relationships shown in the table shown in FIG. 3 have already been defined as key relationships. Furthermore, each keyword represents the characteristics of the product that is registered in the product catalog.

Registration operation example (1) Now, assume that the storage state of the information storage unit 14 is as shown in FIG. 2. In the figure, the U column is the document number that can uniquely identify the registered information, the ■ column is the registered keyword given to the registered information, and the W column is the pointer to the area where the registered information is actually stored. 0 (2) Consider that an operator wants to register a new computer product catalog. At this time, the operator inputs the product catalog from the registration information input section 11.

(3) Furthermore, the operator inputs a "personal computer" indicating the characteristics of the product using the registration key input section 12;
"Stand-alone J, r general-purpose machine".

Input six registered keywords: "Network" and [MsDO3J.

(4) The information registration unit 13 additionally registers the registered information and the registered keyword as a pair in the information storage unit 14.

(Phrase) As a result of the above operations, the storage state of the information storage unit 14 changes as shown in Figure 2. (Registration operation ends) Search operation example (6) Now, the storage state of the key relationship storage unit 2o changes to the second
Assume that the situation is as shown in the table. In the figure, the N column indicates the key relationship number that can be arbitrarily identified based on the key relationship.
The S column represents keywords to be associated, the R column represents relationships, and the D column represents keywords to be associated. For example, key relationship 1 indicates that the keyword "computer" is a keyword representing a superordinate concept of "microcomputer", "personal computer" [office computer J, 11 computer], and "large computer".

(7) When conducting a computer product search, the operator desires to search for computers having the characteristics of "computer" and "general-purpose O3J."

(8) The operator inputs search keywords such as "computer" and "general purpose O5J" from the search key input section 19, together with the AND of all items as a logical operation relationship between the search keywords.

p) At this time, the information search unit 17 searches the information storage unit 14 for registered information having the two search keywords “computer” and “general-purpose O5J” as registered keywords.

In this case, the registration information of document number 2 is searched.

(10) A pointer to the document with document number 2 searched by the information search unit 17 is sent to the search result storage unit 18 and stored therein.

, (11) The information output unit 24 sequentially retrieves the contents of the search result storage unit 18, retrieves the registered information indicated by the pointer from the information storage unit 14, and displays this as visual information.

(12) Next, the next search key derivation unit 23 derives a search keyword effective for the next search. That is, the search keyword stored in the search key storage unit 16 is rewritten in multiple stages using the key relationship stored in the key relationship storage unit. For this example,
Since the number of documents in the search result storage section 18 is 1, a search key is derived that will yield more search result documents. For example, the keyword "computer" is used as key relationship 3 to create "i'-OA equipment".

Keywords such as "FA equipment", "computing equipment", and "control equipment" are derived. In addition, "unix J," MS-DO3J, "unix J,""MS-DO3J,
The keywords "OP/M" and l'-FLKXJ are derived.

(13) The keyword derived by the next search key derivation unit 23 is sent to the next search key storage unit 26 and stored therein.

(14) The next search key display section 26 displays the next search key storage section 2
The next search key stored in 5 is converted into full visual information and displayed. Thereby, the operator can easily obtain the search keyword to be specified next.

(15) Furthermore, when the operator performs an operation to find out why the search key displayed by the next search key display section 26 was presented, the next search key display section 26 is derived to the next search key storage section 25. All key relationships stored in pairs with the key are referenced, and the key relationships used in the derivation process are output. This allows the operator to know why the search keyword candidates to be specified as the first one were derived, so the operator can easily decide which one to actually select from the displayed key candidates. . (End of search operation example) As mentioned above, in this embodiment, "computer",
``If all searches are performed under the search condition of ``general-purpose O8J'' and only one search result catalog is obtained, and the search result catalog is not the one desired by the operator, this device will be effective when used for the next search. The search keywords that are likely to be "OM equipment", "FA equipment", "computing equipment"
.

"Control equipment J, 1-unix J," MS-DO5J.

rc'P/MJ, rFLEXJ' is presented to the derivation L, sott, ui operator. Furthermore, the operator can know why the displayed keyword was presented as a search key family in the next search, so the operator can know which of the displayed key candidates should actually be selected. All can be easily determined. Therefore, even if the operator does not remember all the keys accurately, he or she can quickly and easily know which search key to specify for the next search, making it possible to search for desired information more quickly and easily. In this example, the logical operation relationship between search keywords is the logical product of all items, but in addition to the logical sum of all items, the logical sum of 8 partial items, the logical sum of 2 partial items, the logical product of 2 partial items, and the logical sum of all items. It may also be a logical product of logical sums of one partial item.

Effects of the Invention In the information registration and search device of the present invention, if the search results obtained after performing a search based on certain search conditions do not completely match the information desired by the operator, the information registration and search device of the present invention can be used for the next search. Since the search keys that are likely to be valid can be presented to the operator, even if the operator does not remember all the keys accurately, he can quickly and easily know all the search keys to be specified in the next search. This allows the operator to quickly and easily search for desired information. In addition, keys that are closely related to the field of information that the operator is searching for are presented as search key candidates for the next search, making it possible to search with fewer omissions. These have great practical effects.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of an information registration and retrieval device according to an embodiment of the present invention, FIG. 2 is an explanatory diagram of the storage state of the information storage section in the embodiment, and FIG. 3 is a diagram of the key relationship storage section in the embodiment. FIG. 4, which is an explanatory diagram of the storage state, is a configuration diagram of a conventional information registration and search device. 11... Registration information input section, 12... Registration key input section, 13... Information registration section, 14...
... Information storage section, 16 ... Search key input section, 16 ... Search key storage section, 17 ...
Information search unit, 18...Search result storage unit, 19.
...Key relationship input unit, 20...Key relationship storage unit, 21...Key relationship management unit, 22...
...Key relationship output unit, 23...Search key derivation unit, 24...Information output unit, 26...Next search key storage unit, 26...・Next search key display area. Name of agent: Patent attorney Toshio Nakao and 1 other person 2nd
Figure color) Figure 2 (Figure 3 Figure 4)

Claims (1)

[Claims] a registration information input section for inputting information to be registered; a registration key input section for inputting a registration key for information input from the registration information input section; and information input from the registration information input section and from the registration key input section. an information storage unit that stores a registration key of the input information as a pair; an information registration unit that registers a pair of information and a key in the information storage unit; and a search key that inputs a key of information to be searched. an input section, a search key storage section that stores the input search key, and an information search section that searches the information storage section for information having the search key stored in the search key storage section as a registered key. , a search result storage unit that stores information indicating each piece of searched information; an information output unit that outputs each piece of information in the search result storage unit; a key relationship input unit that inputs relationships between keys; a rewritable key relationship storage unit that stores the relationships between keys input from the key relationship input unit; a key relationship management unit that manages the key relationships in the key relationship storage unit; and outputs the contents of the key relationship storage unit. a key relationship output section,
Deriving search conditions useful for the next search using the search key stored in the search key storage, the key relationship stored in the key relationship storage, and each piece of information in the search result storage. a search key derivation section, a next search key storage section that stores each piece of information output from the search key derivation section, and a next search key display section that displays the next search key stored in the next search key storage section. 1. An information registration and search device, characterized in that it presents search conditions to be set at the time of re-search.