Optimizing a storage system to support short data lifetimes

Details Optimizing a storage system to support short data lifetimes Optimizing a storage system to support short data lifetimes

2011-06-07

2011-06-07

Yen, Syling (Department: 2166)

Data processing: database and file management or data structures

File or database maintenance

Database archive

C707S610000, C707S640000, C707S661000, C707S667000, C707S672000, C707S673000, C707S674000, C707S687000, C707S758000, C707S781000, C707S812000, C707S822000, C709S203000, C709S204000, C709S205000, C709S206000, C711S100000, C719S311000, C719S315000, C719S316000

Reexamination Certificate

active

07958093

ABSTRACT:
A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.

REFERENCES:
patent: 5513336 (1996-04-01), Vishlitzky et al.
patent: 6073142 (2000-06-01), Geiger et al.
patent: 6446188 (2002-09-01), Henderson et al.
patent: 6615318 (2003-09-01), Jarvis et al.
patent: 6671766 (2003-12-01), Vandenbergh et al.
patent: 6678793 (2004-01-01), Doyle
patent: 6732237 (2004-05-01), Jacobs et al.
patent: 6757708 (2004-06-01), Craig et al.
patent: 6983318 (2006-01-01), Doyle
patent: 7020658 (2006-03-01), Hill
patent: 2002/0078077 (2002-06-01), Baumann et al.
patent: 2002/0083006 (2002-06-01), Headings et al.
patent: 2004/0078518 (2004-04-01), Kuwata
patent: 2005/0097260 (2005-05-01), McGovern et al.
patent: 2006/0106852 (2006-05-01), Siddall et al.
patent: 2006/0190924 (2006-08-01), Bruening et al.
patent: 2006/0200700 (2006-09-01), Malcolm
Title: How to set AutoArchive Date: Sep. 9, 2003 Pertinent pp. 7 Publisher: exchange.sandi.net/info/pdf/How%20to%20set%20AutoArchive%20.pdf Riding the Wave of Technology.
Blackwell et al., “Heuristic Cleaning Algorithms in Log-Structured File Systems”, In Proceedings of the Winter 1995 USENIX Conference, Jan. 1995.
Chandrasekaran et al., “TelegraphQC: Continuous Dataflow Processing for an Uncertain World”, In Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR), 2003.
Gärtner et al., “Efficient Bulk Deletes in Relational Databases”, In proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, Apr. 2001, IEEE.
Gavish et al., “Dynamic File Migration in Distributed Computer Systems” Communications of the ACM, 33(2):177-189, 1990.
Raxco Software, Inc., “A tutorial on disk defragmentation for windows nt/2000/xp and windows server 2003”, http://www.raxco.com/products/perfectdisk2k/whitepapers/defrag—tutorial.pdf, May 2003.
Iyer et al., “Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O”, in Symposium on Operating Systems Principles, pp. 117-130, 2001.
McKusick et al., “A Fast File System for Unix”, ACM Transactions on Computer Systems, 2(3): 181-197, Aug. 1984.
Menon et al., “An Age-Threshold Algorithm for Garbage Collection in Log-Structured Arrays and File Systems”, IBM Research Report RJ 10120, 1998.
Ousterhout et al., “Beating the I/O bottleneck: A Case for Log-Structured File Systems”, ACM Operating Systems Review, 23(1):11-28, Jan. 1989.
Patterson et al., “Informed Prefetching and Caching”, in Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, pp. 79-95, Dec. 1995.
Rosenblum et al., “The Design and Implementation of a Log-Structured File System”, ACM Transactions on Computer Systems, 10(1):26-52, Feb. 1992.
Santry et al., “Deciding when to forget in the Elephant file system”, In Symposium on Operating Systems Principles, pp. 110-123, 1999.
Seltzer et al., “An Implementation of a Log-Structured File System for UNIX”, In Proceedings of the Winter 1993 USENIX Conference, pp. 1-18, Jan. 1993.
Wang et al., “Wolf—a Novel Reordering Write Buffer to Boost the Performance of the Log-Structured File Systems”, In Proceedings of the First USENIX Conference on File and Storage Technologies, Monterey, CA, 2002.
Wilkes et al., “The HP Autoraid hierarchical storage system”, ACM Transactions on Computer Systems, vol. 14, No. 1., Feb. 1996.
Zdonik et al., “The Aurora and Medusa Projects”, Bulletin of the IEEE Computer Society Technical Committe on Data Engineering, pp. 1-8, 2003.
Anderson et al., System and Method for Optimizing a Storage System to Support Full Utilization of Storage Space, Sep. 17, 2004.

Affiliated with

Also associated with

Rating

Optimizing a storage system to support short data lifetimes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing a storage system to support short data lifetimes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing a storage system to support short data lifetimes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2671825