Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-08-08
2006-08-08
Le, Uyen (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
Reexamination Certificate
active
07089252
ABSTRACT:
A method of ranking a plurality of linked documents. The method comprises obtaining a plurality of documents, and determining a rank of each document. The rank of each document is generally a function of a rank of all other documents in the plurality of documents which point to the document and is determined by solving, by equation-solving methods (including Gauss-Seidel iteration and partitioning) of a set of equations wherein:xi=(1-α)+α∑jaijxj,where xiis the rank of the page indexed by i, α is a number strictly between 0 and 1.0, the summation is over all indices j such that page j points to page i, and aijis defined to be the reciprocal of the number of links pointing out from page j (denoted dj) if page j points to page i, and zero otherwise.
REFERENCES:
patent: 6285999 (2001-09-01), Page
patent: 6560600 (2003-05-01), Broder
patent: 6571229 (2003-05-01), Campbell
patent: 6792419 (2004-09-01), Raghavan
patent: 2003/0050909 (2003-03-01), Preda et al.
Borodin et al “Finding Authorities and Hubs from Structures on the World Wide Web”, ACM May 1-5, 2001, pp. 415-429.
Arasu Arvind
Tomkins Andrew S.
Tomlin John Anthony
Guzman Leonard T.
Le Uyen
Ziegler, Jr. Geza C.
LandOfFree
System and method for rapid computation of PageRank does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for rapid computation of PageRank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for rapid computation of PageRank will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3711095