Method for node ranking in a linked database

Abstract A method assigns importance ranks to nodes in a linked database, such as any database of documents containing citations, the world wide web or any other hypermedia database. The rank assigned to a document is calculated from the ranks of documents citing it. In addition, the rank of a document is calculated from a constant representing the probability that a browser through the database will randomly jump to the document. The method is particularly useful in enhancing the performance of search engine results for hypermedia databases, such as the world wide web, whose documents have a large variation in quality.

---

Inventors:	Page; Lawrence (Stanford, CA)
Assignee:	The Board of Trustees of the Leland Stanford Junior University (Stanford, CA)
Appl. No.:	09/004,827
Filed:	January 9, 1998

---

Current U.S. Class:	1/1 ; 707/999.005; 707/999.007; 707/E17.097; 707/E17.108; 715/206; 715/207; 715/230; 715/256
Current International Class:	G06F 17/30 (20060101); G06F 017/30 ()
Field of Search:	707/100,5,7,513,1-3,10,104,501 345/440 382/226,229,230,231

---

References Cited [Referenced By]

---

U.S. Patent Documents

4953106	August 1990	Gansner et al.
5450535	September 1995	North
5748954	May 1998	Mauldin
5752241	May 1998	Cohen
5832494	November 1998	Egger et al.
5848407	December 1998	Ishikawa et al.
6014678	January 2000	Inoue et al.

Other References

S Jeromy Carriere et al, "Web Query: Searching and Visualizing the Web through Connectivity", Computer Networks and ISDN Systems 29 (1997). pp. 1257-1267.* .