Method and system for managing data records on a computer...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000, C709S219000

Reexamination Certificate

active

07096228

ABSTRACT:
A method and system for managing data records on a computer network is described, in which copies of data records are distributed among various servers in a hierarchical tree structure, and in which servers that experience an excessive number of requests for a particular data record transmit replicas of that data record to other servers to distribute the load.

REFERENCES:
patent: 5331637 (1994-07-01), Francis et al.
patent: 5355371 (1994-10-01), Auerbach et al.
patent: 5721914 (1998-02-01), DeVries
patent: 5805824 (1998-09-01), Kappe
patent: 5831975 (1998-11-01), Chen et al.
patent: 5935206 (1999-08-01), Dixon et al.
patent: 6269080 (2001-07-01), Kumar
patent: 6505254 (2003-01-01), Johnson et al.
patent: 6553413 (2003-04-01), Leighton et al.
patent: 6584075 (2003-06-01), Gupta et al.
patent: 6735200 (2004-05-01), Novaes
patent: 6771593 (2004-08-01), Popovich
patent: 2002/0010798 (2002-01-01), Ben-Shaul et al.
patent: 2002/0078174 (2002-06-01), Sim et al.
patent: 2002/0133491 (2002-09-01), Sim et al.
patent: 2003/0023505 (2003-01-01), Eglen et al.
Ratnasamy et al.,A Scalable Content-Addressable Network; Dept. of Electrical Eng. & Comp Sci., University of California, Berkeley and ACIRI, AT&T Center for Internet Research at ICSI, pp. 161-171(Aug. 27-31, 2001), Berkeley,CA USA.
Rowstron et al.,Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems*, Proc. of the 18thIFIP/ACM International Conference Distributed Systems Platforms, pp. 1-22, (Middleware 2001). Heidelberg, Germany, Nov. 2001.
Rowstron et al.,SCRIBE: The design of a large-scale event notification infrastructure*, Proceedings of 3d International Workshop on Networked Group Communications, pp. 1-13; (2001).UCL, London, UK.
Rowstron et al.,Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility, SOSP-18, pp. 1-13, (Nov. 2001) Canada.
Stoica et al.,Chord: A Scalable Peer-to-Peer Lookup Service For Internet Applications, MIT Laboratory for Computer Science, pp. 149-160, (Aug. 27-31, 2001).
Zhao et al.,Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, Computer Science Division, University of Berkeley, Report No. UCB/CSD-01-1141, Berkeley, California, pp. 1-27; (Apr. 2001).
Zhuang et al.,Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination, Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video, pp. 1-9, (Jun. 2001) Port Jefferson, New York.
Chankhunthod et al,.A Hierarchical Internet Object Cache, Proceedings of the USENIX 1996 Annual Technical Conference pp 153-163, (1996) Berkeley CA.
Ratnasamy, et al., “Application-level Multicast Using Content-Addressable Networks,”Proceedings of Third International Workshop on Networked Group Communication(NGC '01), 12 pp. (2001), printed at http://citeseer.lst.psu.edu/ratnasamy01applicationlvevl.html.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system for managing data records on a computer... 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 and system for managing data records on a computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for managing data records on a computer... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3682783

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.