History preservation in a computer storage system
First Claim
Patent Images
1. A method for ensuring that rules that prevent premature deletion of data objects stored in a storage system are enforced by servers that store blocks of content that constitute the data objects, the method comprising:
- associating distinct reference source identifiers with each of a plurality of storage system entities that make reference to blocks of content;
associating a set of rules with a data object, the set of rules governing when deletion is allowed and when it is disallowed;
computing a hash value based at least in part on both a reference source identifier and information descriptive of or used by the set of rules; and
communicating information which allows the hash value to be computed, to a server that stores a block of content that is a constituent of the data object;
wherein the communicated information is part of a request to delete the block of content; and
wherein when deletion of the data object is disallowed, modification of the content of the data object is also disallowed.
4 Assignments
0 Petitions
Accused Products
Abstract
A method by which a disk-based distributed data storage system is organized for protecting historical records of stored data entities. The method comprises recording distinct states of an entity, corresponding to different moments of time, as separate entity versions coexisting within the distributed data storage system, and assigning expiration times to the entity versions independently within each of a plurality of storage sites according to a shared set of rules, before which times deletion is prohibited.
-
Citations
32 Claims
-
1. A method for ensuring that rules that prevent premature deletion of data objects stored in a storage system are enforced by servers that store blocks of content that constitute the data objects, the method comprising:
-
associating distinct reference source identifiers with each of a plurality of storage system entities that make reference to blocks of content; associating a set of rules with a data object, the set of rules governing when deletion is allowed and when it is disallowed; computing a hash value based at least in part on both a reference source identifier and information descriptive of or used by the set of rules; and communicating information which allows the hash value to be computed, to a server that stores a block of content that is a constituent of the data object; wherein the communicated information is part of a request to delete the block of content; and wherein when deletion of the data object is disallowed, modification of the content of the data object is also disallowed. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
Specification