U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method for node ranking in a linked database

Patent 7058628 Issued on June 6, 2006. Estimated Expiration Date: Icon_subject July 2, 2021. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Technique for drawing directed graphs
Patent #: 4953106
Issued on: 08/28/1990
Inventor: Gansner, et al.

Graphs employing clusters
Patent #: 5450535
Issued on: 09/12/1995
Inventor: North

Method for retrieving high relevance, high quality objects from an overall source
Patent #: 5594897
Issued on: 01/14/1997
Inventor: Goffman

Method for searching a queued and ranked constructed catalog of files stored on a network
Patent #: 5748954
Issued on: 05/05/1998
Inventor: Mauldin

Method and apparatus for estimating transitive closure and reachability
Patent #: 5752241
Issued on: 05/12/1998
Inventor: Cohen

System for generation of user profiles for a system for customized electronic identification of desirable objects
Patent #: 5754939
Issued on: 05/19/1998
Inventor: Herz, et al.

Method and apparatus for indexing, searching and displaying data
Patent #: 5832494
Issued on: 11/03/1998
Inventor: Egger, et al.

Hypertext document retrieving apparatus for retrieving hypertext documents relating to each other
Patent #: 5848407
Issued on: 12/08/1998
Inventor: Ishikawa, et al.

System and method for accelerated query evaluation of very large full-text databases
Patent #: 5915249
Issued on: 06/22/1999
Inventor: Spencer

Real-time document collection search engine with phrase indexing
Patent #: 5920854
Issued on: 07/06/1999
Inventor: Kirsch, et al.

More ...

Inventor

Application

No. 09895174 filed on 07/02/2001

US Classes:

707/5, Query augmenting and refining (e.g., inexact access)707/10, Distributed or remote access715/501.1, Hypermedia707/6, Pattern matching access704/270.1Speech assisted network

Examiners

Primary: Le, Uyen

Attorney, Agent or Firm

International Class

G06F 17/00

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.

Other References

  • Yuwono et al., “Search and Ranking Algorithms for Locating Resources on the World Wide Web”, IEEE 1996, pp. 164-171.
  • L. Katz, “A new status index derived from sociometric analysis”, 1953, Psychometricka, vol. 18, pp. 39-43.
  • C.H. Hubbell, “An input-output approach to clique identification sociometry”, 1965, pp. 377-399.
  • Mizruchi et al., “Techniques for disaggregating centrality scores in social networks”, 1996, Sociological Methodology, pp. 26-48.
  • E. Garfield, “Citation analysis as a tool in journal evaluation”, 1972, Science, vol. 178, pp. 471-479.
  • Pinski et al., “Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics”, 1976, Inf. Proc. and Management, vol. 12, pp. 297-312.
  • N. Geller, “On the citation influence methodology of Pinski and Narin”, 1978, Inf. Proc. and Management, vol. 14, pp. 93-95.
  • P. Doreian, “Measuring the relative standing of disciplinary journals”, 1988, Inf. Proc. and Management, vol. 24, pp. 45-56.
  • P. Doreian, “A measure of standing for citation networks within a wider environment”, 1994, Inf. Proc. and Management, vol. 30, pp. 21-31.
  • Botafogo et al., “Structural analysis of hypertext: Identifying hierarchies and useful metrics”, 1992, ACM Trans. Inc. Systems, vol. 10, pp. 142-180.
  • Mark E. Frisse, “Searching for information in a hypertext medical handbook”, 1988, Communications of the ACM, vol. 31, No. 7, pp. 880-886.
  • Massimo Marchiori, “The quest for correct information on the Web: Hyper search engines”, 1997, Computer Networks and ISDN Systems, vol. 29, No. 8-13, pp. 1225-1235.
  • Oliver A. McBryan, “GENVL and WWWW: Tools for taming the web”, 1994, Proceedings of the first International World Wide Web Conference, pp. 1-13.
  • Carriere et al., “Web Query: Searching and visualizing the web through connectivity”, 1997, Proc. 6th International World Wide Web Conference, pp. 1-14.
  • Arocena et al., “Applications of a web query language”, 1997, Computer Networks and ISDN Systems, vol. 29, No. 8-13, pp. 1305-1316.
  • Jon M. Kleinberg, “Authoritative sources in a hyperlink environment”, 1998, Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 668-677.
  • Henzinger et al., “Measuring index quality using random walks on the web”, 1999, Proc. of the 8th International World Wide Web Conference, pp. 213-225.
  • Craig Boyle, “To link or not to link: An empirical comparison of Hypertext linking strategies”, ACM, 1992, pp. 221-231.
  • S. Jeromy Carriere et al., “Web Query: Searching and Visualizing the Web through Connectivity”, Computer Networks and ISDN Systems 29 (1997), pp. 1257-1267.
  • Wang et al., “Prefetching in World Wide Web”, IEEE 1996, pp. 28-32.
  • Ramer et al., “Similarity, Probability and Database Organisation: Extended Abstract”, IEEE 1996, pp. 272-276.
  • U.S. Appl. No. 09/899,068, filed Jul. 6, 2001, Page; Method For Scoring Documents in a Linked Database; 8 pages.
  • Recker et al.; “Predicting Document Access in Large Multimedia Repositories”; ACM Transactions on Computer-Human Interaction; vol. 3, No. 4; Dec. 1996; pp. 352-375.
  • J. Kleinberg, “Authoritative Sources in a Hyperlinked Environment,” IBM Research Report, RJ 10076 (91892), May 29, 1997, 37 pages.
  • Peter Pirolli et al.; “Silk from a Sow's Ear: Extracting Usable Structures from the Web”; Xerox Palo Alto Research Center; Conference on Human Factors in Computing Systems (CHI 96); Apr. 1996 (Canada); 8 pages.
  • U.S. Appl. No. 11/000,375, filed Dec. 1, 2004; entitled: “Scoring Documents in a Linked Database”; 20 pages.
  • U.S. Appl. No. 11/209,687, filed Aug. 24, 2005; entitled “Scoring Documents in a Linked Database”; 20 pages.
  • U.S. Appl. No. 11/208,597, filed Aug. 23, 2005; entitled “Scoring Document in a Linked Database”; 20 pages.
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?