Method and system for improving a text search

• US 7,054,882 B2
• Filed: 02/12/2003
• Issued: 05/30/2006
• Est. Priority Date: 07/21/2000
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Seiffert, Roland, Munoz, Joseph A., Doerre, Jochen F., Richardt, Randal J., Lynn, Ronald W., Dockter, Michael J.
• Primary Examiner(s): Gaffin, Jeffrey
• Assistant Examiner(s): Wu, Yicun
• Application Number:
  US10/365,648
• Publication Number:
  US 20030135828A1
• Time in Patent Office: 1,203 Days
• Field of Search: 707/1, 707/2, 707/3, 707/4, 707/5, 707/6, 707/7, 707/8, 707/104.1, 707/9, 707/10, 707/100, 707/101, 707/102, 707/103.R, 345/584, 382/305
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3328 using graphical result space presentation or visualisation
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor
• CPC Class Codes: G06F 16/38 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: Y10S 707/917 Text
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

A method and system for improving text searching is disclosed. The method and system provides a network of document relationship and utilizes the network of document relationships to identify the region of documents that can be used to satisfy a user'"'"'s request. In a preferred embodiment, the text searching method in accordance with the present invention augments a conventional text search by using information on document relationships and metadata. The text searching method and system improves upon conventional text search techniques by incorporating relationship metadata to define regions to search within. In the present invention the definition of a region is not limited to just categories as it includes neighborhoods around individual documents and sets which have been user defined.

Claims

1. A method for improving a text search comprising the steps of:

(a) preprocessing a plurality of documents, including performing relationship mining that provides a network of document relationships for the documents and relationship metadata, wherein a relevance ranking is determined during the preprocessing;

(b) receiving an identification from a user of at least one candidate document from a first plurality of documents obtained via a text search query provided by the user, the text search query using the preprocessed documents, wherein the step (a) of preprocessing is performed before the first plurality of documents are obtained via the text search query;

(c) locating a second plurality of documents that are related to the at least one candidate document by the relationship metadata, wherein the network of document relationships is used to locate the second plurality of documents; and

(d) providing a third plurality of documents to the user as search results to the text search query, each of the third plurality of documents being provided based upon the at least one candidate document and the number of relationships it has with the first and second plurality of documents, wherein the network of document relationships and the relevance ranking are used to provide the third plurality of documents.

2. The method of claim 1 wherein the number of the second plurality of documents is less than the first plurality of documents.

3. The method of claim 1 wherein each of the third plurality of documents are provided based upon a relevance, a number of relationships it has with first and second plurality of documents and whether it was the at least one candidate document.

4. The method of claim 1 wherein the third plurality of documents is listed in an order of presentation to the user that is based on the number of relationships each of the third plurality of documents has with the first and second plurality of documents, and based on whether each of the third plurality of documents was the at least one candidate document.

5. A system for improving a text search comprising:

means for preprocessing a plurality of documents, including means for performing relationship mining that provides a network of document relationships for the documents and relationship metadata, wherein a relevance ranking is determined during the preprocessing;

means for receiving an identification from a user of at least one candidate document from a first plurality of documents obtained via a text search query provided by the user, the text search query using the preprocessed documents, wherein the means for preprocessing performs the preprocessing before the first plurality of documents are obtained via the text search query;

means for locating a second plurality of documents that are related to the at least one candidate document by the relationship metadata, wherein the network of document relationships is used by the means for locating the second plurality of documents; and

means for providing a third plurality of documents to the user as search results to the text search query, each of the third plurality of documents being provided based upon the at least one candidate document and the number of relationships it has with the first and second plurality of documents, wherein the network of document relationships and the relevance ranking are used by the means for providing the third plurality of documents.

6. The system of claim 5 wherein the number of the second plurality of documents is less than the first plurality of documents.

7. The system of claim 5 wherein each of third plurality of documents are provided based upon a relevance, a number of relationships it has with first and second plurality of documents and whether it was the at least one candidate document.

8. The system of claim 5 wherein the third plurality of documents is listed in an order of presentation to the user that is based on the number of relationships each of the third plurality of documents has with the first and second plurality of documents, and based on whether each of the third plurality of documents was the at least one candidate document.

9. A computer readable medium containing program instructions for improving a text search comprising:

(a) preprocessing a plurality of documents, including performing relationship mining that provides a network of document relationships for the documents and relationship metadata, wherein a relevance ranking is determined during the preprocessing;

(b) receiving an identification from a user of at least one candidate document from a first plurality of documents obtained via a text search query provided by the user, the text search query using the preprocessed documents, wherein the step (a) of preprocessing is performed before the first plurality of documents are obtained via the text search query;

(c) locating a second plurality of documents that are related to the at least one candidate document by the relationship metadata, wherein the network of document relationships is used to locate the second plurality of documents; and

(d) providing a third plurality of documents to the user as search results to the text search query, each of the third plurality of documents being provided based upon the at least one candidate document and the number of relationships it has with the first and second plurality of documents, wherein the network of document relationships and the relevance ranking are used to provide the third plurality of documents.

10. The computer readable medium of claim 9 wherein the number of the second plurality of documents is less than the first plurality of documents.

11. The computer readable medium of claim 9 wherein each of third plurality of documents are provided based upon a relevance, a number of relationships it has with first and second plurality of documents and whether it was the at least one candidate document.

12. The computer readable medium of claim 9 wherein the third plurality of documents is listed in an order of presentation to the user that is based on the number of relationships each of the third plurality of documents has with the first and second plurality of documents, and based on whether each of the third plurality of documents was the at least one candidate document.