System and method for record retention date in a write once...

Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S004000, C711S112000, C711S156000, C711S161000, C711S163000, C707S609000, C707S663000

Reexamination Certificate

active

07930493

ABSTRACT:
This invention provides a specified retention date within a data set that is locked against deletion or modification within a WORM storage implementation. This retention date scheme does not utilize any proprietary application program interfaces (APIs) or protocols, but rather, employs native functionality within conventional file (or other data containers, data sets or block-based logical unit numbers) properties available in commonly used operating systems. In an illustrative embodiment, the retention date/time is calculated by querying the file's last-modified time prior to commit, adding the retention period to this value and thereby deriving a retention date after which the file can be released from WORM. Prior to commit, the computed retention date is stored in the file's “last access time” property/attribute field, or another metadata field that remains permanently associated with the file and that, in being used for retention date, does not interfere with file management in a WORM state. Since this field is not utilized in a WORM context, it can be adapted to store this date. Once stored, the retention date in this field is locked against modification. Where extension (never reduction) of a retention period is desired, the last access time field be updated, wherein the new retention period is added to the existing last access time value to derive a new, later retention date for the file. Upon expiry of the retention date, the system allows deletion of the expired WORM file/data set.

REFERENCES:
patent: 4974156 (1990-11-01), Harding et al.
patent: 5025396 (1991-06-01), Parks et al.
patent: 5163131 (1992-11-01), Row et al.
patent: 5355453 (1994-10-01), Row et al.
patent: 5485579 (1996-01-01), Hitz et al.
patent: 5802366 (1998-09-01), Row et al.
patent: 5813009 (1998-09-01), Johnson et al.
patent: 5819292 (1998-10-01), Hitz et al.
patent: 5831859 (1998-11-01), Medeiros et al.
patent: 5832263 (1998-11-01), Hansen et al.
patent: 5931918 (1999-08-01), Row et al.
patent: 5941972 (1999-08-01), Hoese et al.
patent: 5963962 (1999-10-01), Hitz et al.
patent: 6038570 (2000-03-01), Hitz et al.
patent: 6065037 (2000-05-01), Hitz et al.
patent: 6085298 (2000-07-01), Ohran
patent: 6108285 (2000-08-01), Freeman et al.
patent: 6185661 (2001-02-01), Ofek et al.
patent: 6298386 (2001-10-01), Vahalia et al.
patent: 6330571 (2001-12-01), Bills et al.
patent: 6425035 (2002-07-01), Hoese et al.
patent: 6457130 (2002-09-01), Hitz et al.
patent: 6496907 (2002-12-01), James
patent: 6574591 (2003-06-01), Kleiman et al.
patent: 6604118 (2003-08-01), Kleiman et al.
patent: 6606693 (2003-08-01), Morris
patent: 6615330 (2003-09-01), Debiez et al.
patent: 6823336 (2004-11-01), Srinivasan et al.
patent: 6993539 (2006-01-01), Federwisch et al.
patent: 7051053 (2006-05-01), Sinha
patent: 7107385 (2006-09-01), Rajan et al.
patent: 7146388 (2006-12-01), Stakutis et al.
patent: 7155460 (2006-12-01), McGovern et al.
patent: 7454445 (2008-11-01), Lewis et al.
patent: 2004/0186858 (2004-09-01), McGovern et al.
patent: 2005/0097260 (2005-05-01), McGovern et al.
patent: 2006/0010150 (2006-01-01), Shaath et al.
patent: 04818283.6 (2009-10-01), None
patent: WO02/25445 (2002-03-01), None
Microsoft Computer Dictionary, 4thEdition, 1999, p. 486, definition of WORM.
IBM Dictionary of Computing, 10thEdition, 1993, p. 751, definition of WORM.
IEEE 100, “The Authoritative Dictionary of IEEE Standards Terms,” Seventh Edition, Dec. 2000, definition of “data structure.”
Apvrille, et al., “A Time Stamped Virtual WORM System,” pp. 1-12, Proceedings of the SEcurit\'e des Communications sur Internet Workshop (SECI 2002), Sep. 2002.
Lueth, Chris, “WORM Storage on Magnetic Disks Using SnapLock Compliance and SnapLock Enterprise” TR3263, pp. 1-13, Sep. 2003.
Common Internet File System (CIFS) Version: CIFS-Spec 0.9, Storage Networking Industry Association (SNIA), Draft SNIA CIFS Documentation Work Group Work-in-Progress, Revision Date: Mar. 26, 2001, 126 pages.
Fielding et al., Hypertext Transfer Protocol—HTTP/1.1, Network Working Group, Request for Comments (RFC) 2616, The Internet Society, Jun. 1999, 143 pages.
Hitz, Dave et al., File System Design for an NFS File Server Appliance, Technical Report 3002, Rev. C3/95, USENIX Winter 1994, San Francisco, CA, The USENIX Association, Jan. 19, 1994, 23 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Filing Date: Mar. 5, 2004, International Application No. PCT/US2004/06836, Applicant: Network Appliance, Inc., Date of Mailing: Sep. 7, 2005, pp. 1-17.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Filing Date: Apr. 22, 2004, International Application No. PCT/US2004/12378, Applicant: Network Appliance, Inc., Date of Mailing: Jul. 3, 2008, pp. 1-15.

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

System and method for record retention date in a write once... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for record retention date in a write once..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for record retention date in a write once... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2677755

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