Method and system for compression of data for block mode...

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, C711S004000

Reexamination Certificate

active

07424482

ABSTRACT:
A method and system for creating, reading and writing compressed data for use with a block mode access storage. The compressed data are packed into plurality of compressed units and stored in a storage logical unit (LU). One or more corresponding compressed units may be read and/or updated with no need of restoring the entire storage logical unit whilst maintaining de-fragmented structure of the LU.

REFERENCES:
patent: 5761536 (1998-06-01), Franaszek
patent: 5774715 (1998-06-01), Madany
patent: 5778411 (1998-07-01), DeMoss et al.
patent: 5813011 (1998-09-01), Yoshida et al.
patent: 5813017 (1998-09-01), Morris
patent: 6092071 (2000-07-01), Bolan et al.
patent: 6115787 (2000-09-01), Obara
patent: 6349375 (2002-02-01), Faulkner et al.
patent: 6532121 (2003-03-01), Rust et al.
patent: 6577734 (2003-06-01), Etzel et al.
patent: 6584520 (2003-06-01), Cowart et al.
patent: 6678828 (2004-01-01), Pham et al.
patent: 2002/0097172 (2002-07-01), Fallon
patent: 2004/0030813 (2004-02-01), Benveniste et al.
patent: 2005/0021657 (2005-01-01), Negishi et al.
patent: 2005/0125384 (2005-06-01), Gilfix et al.
patent: 95/18997 (1995-07-01), None
Wee Keong Ng et al., Block-Oriented Compression Techniques for Large Statistical databases, 1997, IEEE, pp. 314-328.
EMC White Paper, Leveraging Networked Storage for Your Business, Mar. 2003.
Ziv, J. et al., “A Universal Algorithm for Sequential Data Compression” IEEE Transactions on Information Theory, vol. IT-23, No. 3, May 1977, pp. 337-343.
Kampf, F.A., “Performance as a Function of Compression,” IBM Systems Journal, 1998, vol. 42, No. 6, pp. 1-2.
Pajarola et al., “An Image Compression Method for Spatial Search,” 2000, IEEE, pp. 358, 359 and 364.
Wee-Keong et al., “Block-Oriented Compression Techniques for Large Statistical Databases,” Mar.-Apr. 1997, vol. 9, issue 2, p. 318 section 3.2 and 321 section 4.3.
I. C. Tuduce et al., “Adaptive Main Memory Compression”, Apr. 15, 2005, Internet Article.
P. R. Wilson et al., “Dynamic Storage Allocation: A Survey and Critical Review”, 1995, Internet Article, XP-002420154.
M. D. Flouris et al., “Violin: A Framework for Extensible Block-level Storage”, Apr. 2005, Internet Article.
B. Praveen et al., “Design and Implementation of a File System with on-the-fly Data Compression for GNU/Linux”, Feb. 2000, Internet Article.
P. T. Breuer et al., “The Network Block Device”, Dec. 1999, Internet Article.
R. Dykhuis, “Compression with Stacker and DoubleSpace”, Computers in Libraries, vol. 13, No. 5, pp. 27-29, May 1993. XP-000671468.
T. R. Halfhill, “How Safe is Data Compression?”, BYTE.COM Online, Feb. 1994. XP-002419411.
Anon, “How NTFS Works”, Mar. 28, 2003, Internet Article. XP-002419412.
T. Kawashima et al., “A Universal Compressed Data Format for Foreign File Systems”, IEEE, p. 429, 1995.
Z. M. Yusof et al., “Compressed Memory Core”, pp. 50-52, Electronic Systems and Control Division Research 2003, Internet Article.
Storewiz, “A new approach to data compression”, 2007, Internet Article. XP-002419413.

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

Rate now

     

Profile ID: LFUS-PAI-O-3991716

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