Fault tolerance scheme for distributed hyperlink database

Details Fault tolerance scheme for distributed hyperlink database Fault tolerance scheme for distributed hyperlink database

2006-03-17

2009-12-01

Baderman, Scott T (Department: 2114)

Error detection/correction and fault detection/recovery

Data processing system error or fault handling

Reliability and availability

Reexamination Certificate

active

07627777

ABSTRACT:
Fault tolerance is provided for a database of hyperlinks distributed across multiple machines, such as a scalable hyperlink store. The fault tolerance enables the distributed database to continue operating, with brief interruptions, even when some of the machines in the cluster have failed. A primary database is provided for normal operation, and a secondary database is provided for operation in the presence of failures.

REFERENCES:
patent: 3109186 (1963-11-01), Glenn
patent: 3142485 (1964-07-01), Jacobsen
patent: 3424133 (1969-01-01), Brady
patent: 3517930 (1970-06-01), Jacobsen
patent: 3786526 (1974-01-01), Ausseil
patent: 4411422 (1983-10-01), Solloway
patent: 4416451 (1983-11-01), Solloway
patent: 4565369 (1986-01-01), Bedgood
patent: 4721300 (1988-01-01), Guzman
patent: 5011137 (1991-04-01), Murphy
patent: 5031904 (1991-07-01), Solloway
patent: 5183424 (1993-02-01), Field
patent: 5326296 (1994-07-01), De Jesus
patent: 6098081 (2000-08-01), Heidorn et al.
patent: 6112203 (2000-08-01), Bharat et al.
patent: 6301614 (2001-10-01), Najork et al.
patent: 6505191 (2003-01-01), Baclawski
patent: 6601066 (2003-07-01), Davis-Hall
patent: 7032168 (2006-04-01), Gerace et al.
patent: 7158926 (2007-01-01), Kampe
patent: 2001/0011335 (2001-08-01), Matthews et al.
patent: 2002/0103824 (2002-08-01), Koppolu et al.
patent: 2002/0133697 (2002-09-01), Royer et al.
patent: 2005/0256860 (2005-11-01), Eiron et al.
patent: 2007/0136279 (2007-06-01), Zhou et al.
Veritas Volume Manager 3.5, Aug. 2002, Veritas Software Corporation, pp. 247-258.
Adler, M. et al., “Towards Compressing Web Graphs”,CMPSCI Technical Report, 2000, 5 pages.
Arasu, A. et al., “PageRank Computation and the Structure of the Web: Experiments and Algorithms”,Technical Report, IBM Almaden Research Center, Nov. 2001, 3 pages.
Bharat, K. et al., “Improved Algorithms for Topic Distillation in a Hyperlinked Environment”,21stACM SIGIR Conference on Research and Development in Information Retrieval, 1998, 5 pages.
Bharat, K. et al., “The Connectivity Server: fast access to linkage information on the Web”,Computer Networks and ISDN Systems, 1998, 30, 469-477.
Brin, S. et al., “The Anatomy of a large-scale hypertextual Web search engine”,computer Networks and ISDN Systems, 1998, 30, 107-117.
Chen, Y-Y. et al., “I/O-Efficient Techniques for Computing Pagerank”,CIKM, 2002, 5 pages.
Cormen, T.H. et al., “Introduction to Algorithms”,MIT Press/McGraw-Hill, 1990, 337-344.
Ding, C. et al., “PageRank, HITS and a Unified Framework for Link Analysis”,Lawrence Berkeley National Laboratory, Nov. 2001, 1-12.
Haveliwala, T. H. et al., “Efficient Computation of PageRank”, Oct. 18, 1999, 1-15.
Kleinberg, J.M. “Authoritative Sources in a Hyperlinked Environment”,Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1998, 1-31.
Lempel, R. et al., “The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC Effect”,Department of Computer Science, The Technion, 1-39.
“The PageRank Citation Ranking: Bringing Order to the Web”, Jan. 29, 1998, 1-17.
Randall, K.H. et al., “The Link Database: Fast Access to Graphs of the Web”,SRC Research Report, www.research.compaq.com/SRC, Nov. 16, 2001, 1-16.
Suel, T. et al., “Compressing the Graph Structure of the Web”, pp. 1-10.
In the United States Patent and Trademark Office, Final Office Action In re: U.S. Appl. No. 11/512,887, filed Aug. 29, 2006, dated Jul. 16, 2009, 11 pages.
In the United States Patent and Trademark Office, Non-Final Office Action in re: U.S. Appl. No. 11/512,887, filed Aug. 29, 2006, dated Feb. 4, 2009, 20 pages.
In the United States Patent and Trademark Office, Corrected Notice of Allowance in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Dec. 13, 2007, 19 pages.
In the United States Patent and Trademark Office, Notice of Allowance in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Oct. 8, 2007, 20 pages.
In the United States Patent and Trademark Office, Final Office Action in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Feb. 1, 2007, 17 pages.
In the United States Patent and Trademark Office, Non-Final Office in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Aug. 18, 2007, 16 pages.
In the United States Patent and Trademark Office, Final Office Action in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Feb. 2, 2006, 18 pages.
In the United States Patent and Trademark Office, Non-Final Office in re: U.S. Appl. No. 10/413,645, filed Apr. 15, 2003, dated Oct. 5, 2005, 16 pages.

Affiliated with

Also associated with

Rating

Fault tolerance scheme for distributed hyperlink 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 Fault tolerance scheme for distributed hyperlink database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault tolerance scheme for distributed hyperlink database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4145689