Method and system for information retrieval using embedded links

• US 8,244,710 B2
• Filed: 08/06/2007
• Issued: 08/14/2012
• Est. Priority Date: 08/03/2007
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Singh, Ajay Kumar, Syamala, Madhu
• Primary Examiner(s): LY, CHEYNE D
• Application Number:
  US11/834,665
• Publication Number:
  US 20090037409A1
• Time in Patent Office: 1,835 Days
• Field of Search: 707/710, 707/723, 707/726, 707/737
• US Class Current: 707/710
• CPC Class Codes: G06F 16/35 Clustering; Classification
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: H04L 51/00 User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail

Abstract

Retrieving information from information sources using links. A set of information sources is preprocessed to extract content from text and existing links in the information sources according to some predetermined criteria. A set of search results is generated from amongst the preprocessed information sources in response to a received search query.

Claims

1. A method comprising:

preprocessing, by a preprocessing module, a set of information sources to extract content from text and existing links and to extract attributes of the existing links in said set of information sources according to some predetermined criteria, wherein the existing links have a primary link and have associated levels which increase from the primary link'"'"'s level, and wherein the extracting includes;

limiting the depth of information extracted from the set of information sources in response to an input,

limiting the maximum amount of information extracted from the set of information sources, wherein the set of information sources includes at least a first information source and a second information source, and wherein the first information source at least includes the primary link,

limiting the maximum amount of information extracted from at least one page of the first information source and the second information source,

ranking the set of information sources automatically or in response to an input,

determining that said first information source is related to the second information source, and

in response to determining that said first information source is related to the second information source, clustering the first information source, wherein the second information source corresponds to the existing links of the first information source, and wherein maximum information is extracted from the second information source is limited based on the level of the link;

receiving, by a search module, a search query and extracting search results from amongst the preprocessed information sources based on the content from the text and the existing links;

generating search results based on content from the existing links which comprises extracting information from the second information source;

tagging said content extracted from the links in said information sources, wherein a tag includes a keyword or term associated with the extracted content; and

displaying said set of search results.

2. The method of claim 1 wherein the set of information sources comprises electronic mail, instant messenger, workspace, calendar, web pages and combinations thereof.

3. The method of claim 1, wherein said existing links comprise a hypertext link, a hyper media link and an embedded object.

4. The method of claim 1, further comprising:

ranking each of the tags; and

comparing each of the ranked tags with a threshold value, wherein the threshold value is tuned to the depth of the level of the link associated with the tag, and wherein the higher the level the higher the threshold.

5. The method of claim 4, further comprising if the rank of the tag is higher than the threshold value, processing the information content of the associated link.

6. A computer program stored on a tangible machine-readable medium product, comprising instructions operable to cause a programmable processor to:

preprocess a set of information sources to extract content from text and existing links and to extract attributes of the existing links in said set of information sources according to some predetermined criteria, wherein the existing links have a primary link and have associated levels which increase from the primary link'"'"'s level, and wherein the extracting includes;

limiting the depth of information extracted from the set of information sources in response to an input,

limiting the maximum amount of information extracted from the set of information sources, wherein the set of information sources includes at least a first information source and a second information source, and wherein the first information source at least includes the primary link,

limiting the maximum amount of information extracted from at least one page of the first information source and the second information source,

ranking the set of information sources automatically or in response to an input,

determining that said first information source is related to the second information source, and

in response to determining that said first information source is related to the second information source, clustering the first information source, wherein the second information source corresponds to the existing links of the first information source, and wherein maximum information is extracted from the second information source is limited based on the level of the link;

receive a search query and extract search results from amongst the preprocessed information sources based on the content from the text and the existing links;

generate search results based on content from the existing links which comprises extracting information from the second information source;

tag said content extracted from the links in said information sources, wherein a tag includes a keyword or term associated with the extracted content; and

display said set of search results.

7. The product of claim 6, wherein the set of information sources comprises electronic mail, instant messenger, workspace, calendar, web pages and combinations thereof.

8. The product of claim 6, wherein said existing links comprise a hypertext link, a hyper media link and an embedded object.

9. The computer program stored on a tangible machine-readable medium product of claim 6, wherein the instructions are further operable to cause the programmable processor to:

rank each of the tags; and

compare each of the ranked tags with a threshold value, wherein the threshold value is tuned to the depth of the level of the link associated with the tag, and wherein the higher the level the higher the threshold.

10. The computer program stored on a tangible machine-readable medium product of claim 9, wherein the instructions are further operable to cause the programmable processor to if the rank of the tag is higher than the threshold value, process the information content of the associated link.

11. A system comprising:

a storage memory; and

a processor coupled with the storage memory, the storage memory having sets of instructions stored thereon, which when executed by the processor, cause the processor to;

preprocess a set of information sources to extract content from text and existing links and to extract attributes of the existing links in said set of information sources according to some predetermined criteria, wherein the existing links have a primary link and have associated levels which increase from the primary link'"'"'s level, and wherein the extracting includes;

limiting the depth of information extracted from the set of information sources in response to an input,

limiting the maximum amount of information extracted from the set of information sources, wherein the set of information sources include at least a first information source and a second information source, and wherein the first information source at least includes the primary link,

limiting the maximum amount of information extracted from at least one page of the first information source and the second information source,

ranking the set of information sources automatically or in response to an input,

determining that said first information source is related to the second information source, and

in response to determining that said first information source is related to the second information source, clustering the first information source, wherein the second information source corresponds to the existing links of the first information source, and wherein maximum information is extracted from the second information source is limited based on the level of the link;

receive a search query and extract search results from amongst the preprocessed information sources based on the content from the text and the existing links;

generate search results based on content from the existing links which comprises extracting information from the second information source;

tag said content extracted from the links in said information sources, wherein a tag includes a keyword or term associated with the extracted content; and

display said set of search results.

12. The system of claim 11, wherein the sets of instructions further cause the processor to:

rank each of the tags; and

compare each of the ranked tags with a threshold value, wherein the threshold value is tuned to the depth of the level of the link associated with the tag, and wherein the higher the level the higher the threshold.

13. The computer program stored on a tangible machine-readable medium product of claim 12, wherein the sets of instructions further cause the processor to if the rank of the tag is higher than the threshold value, process the information content of the associated link.