In a data storage server, for each subsets which does not...

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, C707S793000, C707S793000, C382S232000, C710S068000, C380S269000

Reexamination Certificate

active

10755020

ABSTRACT:
In a technique for compressing data, a data storage server receives a set of data, which includes a first number of subsets. The storage server defines a number of compression groups for the set of data, each compression group including multiple entries, each entry containing a pointer to a different subset of the set of data. At least part of the set of data is then compressed into a smaller number of subsets. For each of the subsets which does not contain compressed data after the compression, a predetermined value is stored in the corresponding entry of the corresponding compression group, to indicate that corresponding data is compressed and represented elsewhere in the compression group. The predetermined value may also indicate which compression algorithm was used to compress the data.

REFERENCES:
patent: 5403639 (1995-04-01), Belsan et al.
patent: 5760716 (1998-06-01), Mathews et al.
patent: 5774715 (1998-06-01), Madany et al.
patent: 5813017 (1998-09-01), Morris
patent: 5850565 (1998-12-01), Wightman
patent: 6138126 (2000-10-01), Hitz et al.
patent: 6157743 (2000-12-01), Goris et al.
patent: 6163856 (2000-12-01), Dion et al.
patent: 6374250 (2002-04-01), Ajtai et al.
patent: 6418449 (2002-07-01), Chen et al.
patent: 6457130 (2002-09-01), Hitz et al.
patent: 6532121 (2003-03-01), Rust et al.
patent: 6574591 (2003-06-01), Kleiman et al.
patent: 6604106 (2003-08-01), Bodin et al.
patent: 6640233 (2003-10-01), Lewis et al.
patent: 6721764 (2004-04-01), Hitz et al.
patent: 6779095 (2004-08-01), Selkirk et al.
patent: 6795583 (2004-09-01), Barnes et al.
patent: 6804733 (2004-10-01), Michel et al.
patent: 6842872 (2005-01-01), Yedida et al.
patent: 6934877 (2005-08-01), Tamatsu
patent: 6965897 (2005-11-01), Chen
patent: 7096311 (2006-08-01), Chiang
patent: 7099884 (2006-08-01), Gu
patent: 7110608 (2006-09-01), Chan et al.
patent: 2002/0069317 (2002-06-01), Chow et al.
patent: 2003/0149793 (2003-08-01), Bannoura et al.
patent: 2003/0217067 (2003-11-01), Gilstrap et al.
patent: 2004/0255140 (2004-12-01), Margolus et al.
patent: 2005/0182799 (2005-08-01), Hitz et al.
patent: 1333379 (2003-08-01), None
patent: 2413867 (2005-11-01), None
patent: WO 97/39421 (1997-10-01), None
patent: WO 99/13403 (1999-03-01), None
patent: WO 01/29752 (2001-04-01), None
patent: WO 01/50612 (2001-07-01), None
patent: WO 2006/063057 (2006-06-01), None
Schindler,M et al. “a fast block-sorting algorithm for lossless data compression”, proceddings in data compression conference 1997, p. 469.
Shapira,D et al. “in-place differential file compression of nonaligned files with applications to file distribution, backups, and string similarity”,proceedings of the data compression confierence, Mar. 2004, pp. 82-91.
Saeed,F et al. “data compression with Huffman coding; an efficient dynamic implementation using file partitioning”, proceedings of the 1990 symposium on applied computing, 1990, pp. 348-354.
Damon John Searle, “A multi-tier scientific data distribution system”, Jan. 2004.
Ghim Hwee Ong, “A multi-block data compression method based on arthmetic coding for a library database”,Communications on the move, Singapore ICCS/ISITA, '92, vol. 3, pp. 1067-1071.
Summit Roy et al. “improving system performance with compressed memory”, IEEE 2001.
Ramabadran,T.V. et al. “An adaptive algorithm for the compression of computer data”, IEEE transactions on communications, vol. 37, issue: 4, 1989, pp. 317-324.
Feng Xiaodong et al. “An improved process data compression Algorithm”, proceedings of the 4th world congress on intelligent control and automation, Jun. 2002, pp. 2190-2193.

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

In a data storage server, for each subsets which does not... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with In a data storage server, for each subsets which does not..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and In a data storage server, for each subsets which does not... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3736019

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