Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-06-06
2006-06-06
Le, Uyen (Department: 2163)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C715S252000
Reexamination Certificate
active
07058628
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.
REFERENCES:
patent: 4953106 (1990-08-01), Gansner et al.
patent: 5450535 (1995-09-01), North
patent: 5594897 (1997-01-01), Goffman
patent: 5748954 (1998-05-01), Mauldin
patent: 5752241 (1998-05-01), Cohen
patent: 5754939 (1998-05-01), Herz et al.
patent: 5832494 (1998-11-01), Egger et al.
patent: 5848407 (1998-12-01), Ishikawa et al.
patent: 5915249 (1999-06-01), Spencer
patent: 5920854 (1999-07-01), Kirsch et al.
patent: 5920859 (1999-07-01), Li
patent: 6014678 (2000-01-01), Inoue et al.
patent: 6112202 (2000-08-01), Kleinberg
patent: 6163778 (2000-12-01), Fogg et al.
patent: 6269368 (2001-07-01), Diamond
patent: 6285999 (2001-09-01), Page
patent: 6389436 (2002-05-01), Chakrabarti et al.
patent: 2001/0002466 (2001-05-01), Krasle
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. 6thInternational 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 9thAnnual 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 8thInternational 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.
Harrity & Snyder LLP
Le Uyen
The Board of Trustees of the Leland Stanford Junior University
LandOfFree
Method for node ranking in a linked database does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for node ranking in a linked database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for node ranking in a linked database will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3637143