US6138113A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for identifying near duplicate pages in a hyperlinked database
Assignee: AltaVista Co
•
Filing: 1998-08-10
•
Granted: 2000-10-24
•
Expires: 2018-08-10
Abstract
Abstract A method is described for identifying pages that are near duplicates in a linked database. In the linked database, pages can have incoming links and outgoing links. Two pages are selected, a first page and a second page. For each selected page, the number of outgoing links is determined. The two pages are marked as near duplicates based on the number of common outgoing links for the two pages.
Inventors
- 👤 Jeffrey Dean
- 👤 Monika R. Henzinger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 05:11
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/951; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
85 words
A method for identifying pages that are near duplicates in a linked database, the pages in the database having incoming links and outgoing links, comprising the steps of: selecting a first page and a second page; determining the outgoing links for the first page and the second page; determining the number of outgoing links that are common for the first page and the second page; marking the first page and the second page as near duplicate pages based on the number of common outgoing links.
Claim 2
Independent Claim
85 words
A method for identifying pages that are near duplicates in a linked database, the pages in the database having incoming links and outgoing links, comprising the steps of: selecting a first page and a second page; determining the outgoing links for the first page and the second page; determining the number of outgoing links that are common for the first page and the second page; marking the first page and the second page as near duplicate pages based on the number of common outgoing links.
Claim 3
Dependent Claim
25 words
The method of claim 1 wherein the number of common outgoing links is the intersection of the outgoing links of the first and second pages.
Claim 4
Dependent Claim
45 words
The method of claim 1 wherein the first and second pages are near duplicate pages when the ratio of the number of common outgoing links divided by the union of the outgoing links of the first and second pages is larger than a predetermined threshold.
Claim 5
Dependent Claim
39 words
The method of claim 1 wherein the first and second pages are near duplicate pages when the ratio of the number of common outgoing links divided by the total number of outgoing links is larger than a predetermined threshold.
References Cited (Backward Citations)
US5241305A
Cited
US5345227A
Cited
US5335325A
Cited
US5309433A
Cited
US5425021A
Cited
US5483522A
Cited
US5991809A
Cited
US5917424A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-24 | 2004-04-24 | 2004-10-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-24 | 2008-04-24 | 2008-10-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-24 | 2012-04-24 | 2012-10-24 | $7700.00 | Window Closed / Lapsed |