Method of extracting network information

• US 5,892,908 A
• Filed: 09/10/1996
• Issued: 04/06/1999
• Est. Priority Date: 09/10/1996
• Status: Expired due to Term

• Current Assignee: Mobilevue, Inc.
• Original Assignee: Marketscape
• Inventors: Hughes, Jeffrey Alan, Chan, Lai-chong May, Elliott, Richard Stephen, Pinna, Robert William
• Primary Examiner(s): Ramirez, Ellis A.
• Assistant Examiner(s): PIERCE, IVAN
• Application Number:
  US08/711,045
• Time in Patent Office: 938 Days
• Field of Search: 395/200.39, 395/600, 395/200.53, 395/200.15, 395/619, 395/161, 395/200.8, 395/200.54, 395/200.55, 395/200.79, 395/700
• US Class Current: 709/250
• CPC Class Codes: G06F 16/957 Browsing optimisation, e.g. caching or content distillation

Abstract

A method of extracting network information first receives an initial link address (102) and retrieves a file (104) associated with the initial link address. The file is then parsed (106) to find a hyper text link. Next it is determined (108) if the hyper text link has a link address that contains the network address as a root. When the link address contains the initial link address as the root, a link file associated with the link address is retrieved (110).

Claims

1. A method of extracting network information, comprising the steps of:

(a) receiving an initial link address that points to a file;

(b) retrieving the file associated with the initial link address;

(c) parsing the file to find a hyper text link that points to a link file;

(d) determining if the hyper text link has a link address that contains the initial link address as a root; and

(e) when the link address contains the initial link address as the root, retrieving the link file associated with the link address.

2. The method of claim 1, further including the steps of:

(f) when the link address does not contain the initial link address as the root, storing the link address in a discovery database.

3. The method of claims 1, wherein step (b) further includes storing the initial link address in a discovery database.

4. The method of claim 1, further including the steps of:

(f) determining if the link file is a hyper text file;

(g) when the link file is the hyper text file, parsing the link file to find a hyper text link.

5. The method of claim 4, further including the steps of:

(h) when the link file is not the hyper text file, returning to step (c).

6. The method of claim 4, further including the step of:

(h) storing the link address in a discovery database.

7. A method of extricating network information, comprising the steps of:

(a) receiving an initial link address point to a file;

(b) copying the file associated with the initial link address;

(c) scanning the file for a plurality of hyper text links; and

(d) storing a link address, that points to a link file, for each of the plurality of hyper text links, in a discovery database.

8. The method of claim 7, wherein step (a) further includes the step of storing the initial link address in the discovery database.

9. The method of claim 7, further including the step of:

(e) storing a file parameter associated with each of the plurality of hyper text links in the discovery database.

10. The method of claim 7, further including the steps of:

(e) selecting an unanalyzed hyper text link from the discovery database;

(f) determining if a link address associated with the unanalyzed hyper text link has a common root with the initial link address;

(g) when the link address does not have the common root with the initial link address, returning to step (e).

11. The method of claim 10, further including the steps of:

(h) when the link address does have the common root with the initial link address, determining if the unanalyzed hyper text link is a hyper link file;

(i) when the unanalyzed hyper text link is not the hyper link file, returning to step (e).

12. The method of claim 11, further including the steps of:

(j) when the unanalyzed hyper text link is the hyper link file, copying an unanalyzed link file associated with the link address;

(k) searching the unanalyzed link file for a plurality of new hyper text links;

(l) adding the plurality of new hyper text links to the discovery database.

13. The method of claim 7, further including the steps of:

(e) converting a server side image map in the file to a client side image map;

(f) converting a link address associated with each of the plurality of hyper text links to a local relative address.

14. The method of claim 7, further including the steps of:

(e) selecting an unanalyzed hyper text link from the discovery database;

(f) determining if the unanalyzed hyper text link is a hyper link file;

(g) when the unanalyzed hyper text link is not the hyper link file, returning to step (e).

15. The method of claim 14, further including the steps of:

(h) when the unanalyzed hyper text link is the hyper link file, determining if a link address associated with the unanalyzed hyper text link has a common root with the initial link address;

(i) when the link address does not have the common root with the initial link address, returning to step (e).

16. The method of claim 15, further including the steps of:

(j) when the link address does have the common root with the initial link address, copying an unanalyzed file associated with the link address;

(k) scanning the unanalyzed file for a plurality of new hyper text links;

(l) adding the plurality of new hyper text links to the discovery database.

17. A computer-readable storage medium containing computer-readable information that when executed by a computer connected to a network performs the following steps:

(a) receiving an initial link address that points to a file;

(b) locating the file on the network associated with the initial link address;

(c) downloading the file from the network to the computer;

(d) parsing the file to locate a plurality of hyper text; and

(e) writing a plurality of link addresses associated with the plurality of hyper text links to a discovery database, each of the plurality of link addresses pointing to a link file.

18. The computer-readable storage medium of claim 17, further performing the steps of:

(f) determining for each of the plurality of link addresses in the discovery database if they have a common root with the initial link address;

(g) when one of the plurality of link addresses does have the common root, retrieving an associated file.

19. The computer-readable storage medium of claim 18, further performing the steps of:

(h) parsing the associated file to locate a plurality of new hyper text links.

(i) writing a new link address for each of the plurality of new hyper text links to the discovery database;

(j) returning to step (e).

20. The computer-readable storage medium of claim 19, wherein step (i) further includes the step of:

(ii) writing a local relative address, for each new link address, to the discovery database.