Method and system for creating and using shadow roots

Details Method and system for creating and using shadow roots Method and system for creating and using shadow roots

2005-01-28

2010-02-02

Corrielus, Jean M (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C715S259000, C715S260000, C706S045000, C706S046000, C706S060000, C706S061000

Reexamination Certificate

active

07657543

ABSTRACT:
A method for storing a first copy of an object, including obtaining the object including a globally unique identifier (GUID), generating a first derived GUID using the GUID of the object, storing the first copy of the object identified by the first derived GUID in a root node of the object, publishing possession of the first copy of the object identified by the first derived GUID by the root node of the object, associating a first shadow root with the first copy of the object, and storing the first copy of the object identified by the GUID in the first shadow root.

REFERENCES:
patent: 5640564 (1997-06-01), Hamilton et al.
patent: 5761511 (1998-06-01), Gibbons et al.
patent: 5907837 (1999-05-01), Ferrel et al.
patent: 6629203 (2003-09-01), Humlicek
patent: 2002/0133491 (2002-09-01), Sim et al.
patent: 2002/0174275 (2002-11-01), Jay et al.
patent: 2003/0055805 (2003-03-01), Gardner
patent: 2005/0015775 (2005-01-01), Russell et al.
patent: 2005/0165724 (2005-07-01), West
patent: 2005/0262097 (2005-11-01), Sim-Tang et al.
patent: 2006/0168154 (2006-07-01), Zhang et al.
patent: 2006/0179037 (2006-08-01), Turner et al.
patent: 2007/0094312 (2007-04-01), Sim-Tang
John Kubiatowics, OceanStore: An Architecture for Global-Scale Persistent Storage, 2000, University of California, Berkeley, 12pages.
A. Adya, et al.; “Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment”; Proceedings of the 5thSymposium on Operating Systems and Design Implementation OSDI; Dec. 2002 (14 pages).
I. Clarke, et al.; “Freenet: A Distributed Anonymous Information Storage and Retrieval System”; Lecture Notes in Computer Science; 2000 (21 pages).
J. Kubiatowicz, et al.; “OceanStore: An Architecture for Global-Scale Persistent Storage”; Proceedings of ACM ASPLOS; Nov. 2000 (12 pages).
A. Rowstron, et al.; “Storage Management and Caching in PAST, a Large-Scale, Peristent Peer-to-Peer Storage Utility”; Symposium on Operating System Principles; Oct. 2001 (13 pages).
S. Quinlan, et al.; “Venti: A New Approach to Archival Storage”; Proceedings of the FAST 2002 Conference on File and Storage Technologies; First USENIX Conference on File and Storage Technologies; Jan. 2002 (14 pages).
A. Muthitacharoen, et al.; “Ivy: A Read/Write Peer-to-Peer File System”; Proceedings of the 5thUSENIX Symposium on Operating Systems Design and Implementation (OSDI '02); Dec. 2002 (23 pages).
F. Dabek, et al.; “Towards a Common API for Structured Peer-to-Peer Overlays”; Proceedings of 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), Feb. 2003 (11 pages).
I. Stoica, et al.; “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”; Proceedings of the SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications; Aug. 2001 (12 pages).
B. Zhao, et al.; “Tapestry: A Resilient Global-Scale Overlay for Service Deployment”; IEEE Journal on Selected Areas in Communications; Jan. 2004 (15 pages).
A. Rowstron, et al.; “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems”; Lecture Notes in Computer Science; 2001 (22 pages).
C. Greg Plaxton, et al.; “Accessing Nearby Copies of Replicated Objects in a Distributed Environment”; ACM Symposium on Parallel Algorithms and Architectures; Jun. 1997 (23 pages).
M. Castro, et al.; “Practical Byzantine Fault Tolerance”; Symposium on Operating Systems Design and Implementation; Feb. 1999 (14 pages).
D. B. Terry, et at.; “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System”; Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles; Dec. 1995 (12 pages).
D. Boneh, et al.; “Efficient Generation of Shared RSA Keys”; Journal of the ACM; 2001 (21 pages).
Y. Frankel, et al.; “Robust Efficient Distributed RSA-Key Generation”; Proc. 30thAnnual ACM Symposium on Theory of Computing (STOC); May 1998 (10 pages).

Affiliated with

Also associated with

Rating

Method and system for creating and using shadow roots 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 creating and using shadow roots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for creating and using shadow roots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4215252