WO2005071574A1 - Preload library for transparent file transformation - Google Patents
Preload library for transparent file transformation Download PDFInfo
- Publication number
- WO2005071574A1 WO2005071574A1 PCT/US2004/018478 US2004018478W WO2005071574A1 WO 2005071574 A1 WO2005071574 A1 WO 2005071574A1 US 2004018478 W US2004018478 W US 2004018478W WO 2005071574 A1 WO2005071574 A1 WO 2005071574A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- file
- transformed
- chunk
- files
- Prior art date
Links
- 230000009466 transformation Effects 0.000 title claims description 16
- 230000036316 preload Effects 0.000 title abstract description 30
- 238000000034 method Methods 0.000 claims description 54
- 238000013144 data compression Methods 0.000 claims 2
- 230000001131 transforming effect Effects 0.000 claims 2
- 238000005192 partition Methods 0.000 abstract description 3
- 230000006835 compression Effects 0.000 description 31
- 238000007906 compression Methods 0.000 description 31
- 230000008569 process Effects 0.000 description 19
- 238000012545 processing Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 10
- 230000008901 benefit Effects 0.000 description 9
- 230000004044 response Effects 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 239000000463 material Substances 0.000 description 3
- 238000012360 testing method Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008602 contraction Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000010410 layer Substances 0.000 description 1
- 239000002346 layers by function Substances 0.000 description 1
- 230000000116 mitigating effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/542—Event management; Broadcasting; Multicasting; Notifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/11—File system administration, e.g. details of archiving or snapshots
- G06F16/116—Details of conversion of file system types or formats
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/542—Intercept
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
Definitions
- Lossless compression has long been used to reduce storage requirements and network transmission costs. Compressing data can help reduce the amount of data that must be accessed from main memory and therefore may be useful in mitigating the I/O bottleneck.
- Compressing data can help reduce the amount of data that must be accessed from main memory and therefore may be useful in mitigating the I/O bottleneck.
- the nominal disk - bandwidth is d bytes/second, it requires — time to effectuate the transfer.
- the data can d be compressed by some compressor with compression ratio r (the ratio of the size of the compressed data to that of the original) however, and the uncompression speed is u t bytes/second (compression and uncompression speeds typically depend on the resulting compression ratio, which tends to be similar for different files from the same domain or
- Equation (1) yields several useful observations.
- Compression schemes used in practice e.g., Huffman coding used in pack, Lempel-Ziv coding used in compress, gzip, and zlib, and the Burrows-Wheeler transform used in bzip
- Huffman coding used in pack Lempel-Ziv coding used in compress, gzip, and zlib
- Burrows-Wheeler transform used in bzip all share the characteristic that uncompression must start from the beginning of the compressed data. That is, to retrieve any byte requires uncompressing the entire text up to the desired access point. This complicates any application that requires arbitrary access into the data While some theoretical advances have been made in the area of string matching in compressed data, general-purpose computation over compressed data remains elusive.
- This access problem may be generalized to situations having the following characteristics.
- slow memory such as a disk drive, tape, CD ROM, DVD or the like.
- One such technique as applied to compression of files partitions the original file into segments, then compresses each compressed segment individually and stores each compressed segment starting in the exact location in slow memory (usually disk memory) in which the original uncompressed segment was stored.
- slow memory usually disk memory
- Another approach partitions the file into segments and then applies the transform (e.g. compression, encryption, etc.) to each segment.
- the resulting "chunks" i.e. transformed segments
- a preload library transforms file data in segments, each independently of the other as part of the process of retrieving and writing data to the file.
- the preload library creates a meta-data structure for each file to be transformed in response to a system call to that file issued by a system application or some other system library program.
- the file to be transformed comprises meta-data including a map that identifies each of the transformed segments with their original untransformed counterparts.
- the file meta-data may further include trailer information describing the transform methodology, the original length of the file prior to transformation, length of the segments, and checksum data
- the map permits fast location of the segment(s) containing any arbitrary range of original data locations.
- desired data can be retrieved from anywhere within the file by inverting the transform of only the compressed segments) of interest.
- Each of the transformed segments referred to herein as "chunks" is initially stored contiguously in memory, but with some additional space built in for those cases in which the chunk grows as a result of its segment being altered through a memory write.
- the preload library permits operation within a system having files that are not transformed, as well as the additional flexibility to treat individual files differently with the respect to the parameters of the transformation process.
- Files may be transformed using different methodologies as well as different segment sizes for example.
- Figure 1 is a block diagram representation of the relationships between the various functions operating in a computer system;
- Figure 2 is a block diagram representation of the functional operation of an embodiment of the invention.
- Figure 3 a cuagrammatical representation of a format for storing transformed data in accordance with an embodiment of the invention
- system calls specifying associated file descriptors originated by system applications or other library programs are intercepted by a preload library.
- Each system call handled by the preload library respects its standard semantics such that return values and expected side effects are preserved.
- the preload Ubrary operates transparently with respect to an apphcation and the operating system. If the file(s) specified by the intercepted system call are determined to have been previously transformed by the preload library or are to be transformed once created, the library allocates a meta-data structure to maintain the relevant meta-data, which is initialized from the file on disk. Otherwise, no meta-data structure for the referenced file is created and the preload library simply passes the system calls directly to the OS for processing.
- Fig. 1 illustrates the functional layers that exist in a typical computer system.
- the computer system could be a notebook or desk top computer, and could be as complex as a server with multiple CPUs.
- the operating system (OS) 17 communicates with the physical devices 19, typically through an interface of software routines sometimes known as drivers 18 for each device.
- the OS 17 performs functions that include maintaining internal data structures such as a file table to provide a record of all of those files that have been opened at the request of apphcation programs 10 or other libraries 14.
- the OS 17 further maintains pointers into those files so that it knows where in a particular file data has just been read from or written to (i.e. accessed) and the next location. Thus, the OS 17 will know from where to start reading, for example, if an application 10 requests the next 1000 bytes of the file.
- the applications 10 and other libraries 14 typically make requests of the OS 17 and receive responses to those requests from the OS 17 by way of apphcation program interfaces (APIs) 12.
- APIs apphcation program interfaces
- OS 17 used. Nevertheless, the system calls from a functional standpoint are quite similar, including basic system functions such as "open a file,” “read from a file,” “write to a file,” “close a file,” “create a file,” etc.
- the Ubrary layer 14 sits between the applications 10 and the OS 17. It is generaUy designed to perform functions that one may not wish to incorporate into the OS 17, at least until they've been proven, or to provide functions over which the user may want control.
- a library function 14 intercepts certain system calls from the appUcations to the OS 17. It then performs some sort of processing in response to the call and then passes on a call to the OS 17 by which to complete the processing.
- Fig. 2 illustrates a functional flow diagram for an embodiment of the invention.
- the library of the invention 15 can be preloaded and sits at the bottom of all other library functions 14, Fig.l. It is designed to detect and intercept all system calls generated from appUcations 10, Fig. 1 and any of the other libraries 14, Fig. 1 (together sometimes referred to herein generally as system programs) to the OS 17, Fig. 1.
- system programs generated from appUcations 10, Fig. 1 and any of the other libraries 14, Fig. 1 (together sometimes referred to herein generally as system programs) to the OS 17, Fig. 1.
- the preload Ubrary 15, Fig. 1 can be designed to recognize the semantics of system calls for any OS. When the preload Ubrary detects and intercepts a system call to the OS at 100, it determines the nature of the syste ccm caU.
- the preload library determines whether the particular file referenced has been transformed in accordance with the library's transform at 116 (i.e. whether it is a transform system file). If it has been so transformed, the Ubrary builds a meta-data structure at 118 for that file, much like the OS does in response to system calls, which controls ensuing system calls to that file's descriptor.
- the preload library processes all subsequent system calls to that file, including reading transformed data, inverting or reversing the transform on the data and providing the processed data to the application or Ubrary that requested it, performing the transform on data to be written back to disk and providing the transformed data back to the OS to carry out the physical write process.
- Ubrary passes call commands to the OS at 122 that the OS needs to build its own internal structure such that the any processing performed by the preload library remains transparent to the OS as weU as the apphcation or library that initiated the call.
- Processing then returns at 108 to block 100 to look for and intercept further system calls from applications or other Ubraries at 100.
- the system caU is passed directly to the OS at 124 without further processing by the preload Ubrary, and processing returns at 108.
- the library instantiates the file at 106 and then determines at 114 whether the files is one which it is to transform This decision is based on parametric information provided to the library when it is loaded and permits a user to cause the library to process only those files that a user desires to be transformed. If the file is one designated to be processed by the preload library (i.e. a transform system file), it builds its meta-data structure to govern further processing of the file at 118 and processing continues as previously described. If it is not, prcessing continues at 124 and the system call is passed directly through to the preload library (i.e. a transform system file).
- the transformation process can be turned off by the user iff desired for all files or for particular types of files, for example if the transform does not provide performance enhancement on that type of file.
- An embodiment of the invention determines at 110 if the caU is to a file that has already been opened and that it has been designated as one to be transformed by the Ubrary. This can be answered in the affirmative if it has already been opened and a meta-data structure previously has been created by the library at 118. If true, the call is processed by the library at 112 (including for example, reading transformed data and then performing the inverse transform on the data before supplying it to the requesting apphcation or Ubrary, or tiarisforming data from the application and then sending it to the OS to be written to slow memory). If it is determined at 110 that the system caU does not reference a file that has been identified to the preload library as one to be transformed , then the system call is passed directly to the OS at 114 and processing returns at 108 to intercepting the next caU at 100.
- the library can be appUed generally to any data files that have been transformed and for which improved random access to the transformed data is desired.
- the preload Ubrary may be employed where compression is the transform imposed on the data
- the data is segmented and compressed (i.e. transformed) on a segment-by-segment basis to enhance random access to the compressed data
- a compression transform is performed at block 112 of Fig. 2 whenever the compression transform is enabled for the file being written.
- the original data is partitioned into n segments of size S each This is a parameter that may be tuned by the user through interaction with the preload library.
- the last segment in the file possibly may be smaller of course.
- An embodiment of a format for the files transformed using such a compression algorithm is iUustrated in Fig. 3.
- a file 200 compressed by the Ubrary can be implemented in two sections. The first section includes the compressed data for each segment of the untransformed data file.
- the second section of the compressed data file 200 is meta-data that includes a 28 map that identifies the relationship between each compressed data segment and each pre- compressed data segment
- a segment may have a size of 1000 bytes (with a certain address range associated therewith), and each compressed segment (referred to herein as a chunk) may range between 360 and 440 bytes, for example.
- the preload library must be able to know how the address ranges of the chunks correspond to the address ranges of the pre-compressed segments, as the applications/Ubraries, oblivious to the compression, will request bytes based on the pre-compressed addresses.
- each bag further includes a gap 26a, 26b through 26n, which is simply unused contiguous memory that is there in case the chunk actuaUy grows larger as a result of modifications to its corresponding segment
- the size of the bag which includes the chunk 22 and the gap 26 wiU be determined by the original size C of the chunk (that is the size of the chunk 22 for each segment when the compressed file 200 is initially created and processed at block 106 of Fig. 2) and a bag factor/ > 1.
- each bag can have a size of / * C bytes.
- these parar eters can be adjusted for different types of files through the meta data of each file so that the transformation can be performed differently for different files stored in the same system. This is an advantage that is not easily accomphshed using an OS file system
- the gap 26a, 26b through 26n provides slack for the chunk to grow which may occur when amended data is written back to a particular compressed segment. This overcomes the need to re-layout the entire compressed file to accommodate the growth of a chunk because they are not tightly packed.
- the gap 26a, 26b through 26n is only a smaU percentage of what memory space is saved through compression
- the bag is now too large for its original aUocation of space and may be appended at the end of the compressed data section of the compressed file 200-
- the bag is also aUocated a smaU amount of space for chunk specific mete-data 24a, 24b through 24n.
- the meta-data section of the compressed (transformed) file 200 can be stored immediately foUowing the last gap 26n of the last bag 20n.
- the metadata can start with a chunk map 28, which is an array containing for each bag 20 the offset 32 into the compressed file at which the bag 20 begins, the size 34 of the chunk 22 within it, the size 36 of any chunk-specific compression meta-data 24, and the size 38 of the bag 20 to which the meta-data is mapped.
- a variable- length segment describing any compressor-specific meta-data 40 for example, if a Lempel-Ziv algorithm is being employed, what level is being used).
- a compressed (transformed) file 200 is opened (the process represented by blocks 102, 116, 118, 122, FIG.2) the meta-data is read.
- the trailer 30 is of a fixed size, so it is read first.
- Each compressor program has a method that includes a startup routine, which is caUed to read its meta-data 40 (e.g., the compression level for Lempel-Ziv based compressors like zlib), which precedes the trailer 30.
- the chunk map 28 is read, using the uncompressed file size 42 and segment size 44 to deter ⁇ iine its length.
- the meta-data remains entirely in memory while the file 200 is open.
- Blocks and chunks are cached, in separate caches each with an LRU replacement strategy; the per-file cache sizes are also library start-up parameters.
- the foregoing format as applied to compression can be adapted to other types of transforms that may require random access to the transformed data, and for which segmenting and fransforming the segments may prove useful in providing such random access.
- the format may provide performance benefits concerning the possibihty that the transformed chunks may grow or shrink and thus prove useful in accommodating this expansion and contraction without need to place chunks out-of-order or to have to rearrange the entire transformed file each time it is written to. Encryption is another example of such a transformation.
- open() first determines if the requested file is compressed.
- a file may be deemed compressed if all of the foUowing are true: (1) it is long enough to contain a trailer 30; (2) the trailer checksum 48 validates; (3) the segment size 44 is positive; (4) the compressor identifier
- test (8) can be skipped.
- any combination of the foregoing tests may be used to determine if the file has been transformed by compression, but the more that are used the more likely the determination wiU be correct. If a file is deemed compressed, an internal structure is initialized, which controls ensuing system calls on the file descriptor identifying the file just opened. A start-up parameter can be implemented to determine whether newly created files are to be compressed, or even which types.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP04754916A EP1702276A4 (en) | 2004-01-10 | 2004-06-08 | Preload library for transparent file transformation |
CA002542162A CA2542162A1 (en) | 2004-01-10 | 2004-06-08 | Preload library for transparent file transformation |
IL174897A IL174897A0 (en) | 2004-01-10 | 2006-04-10 | Preload library for transparent file transformation |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/754,994 US7536418B2 (en) | 2003-01-10 | 2004-01-10 | Preload library for transparent file transformation |
US10/754,994 | 2004-01-10 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005071574A1 true WO2005071574A1 (en) | 2005-08-04 |
Family
ID=36585963
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2004/018478 WO2005071574A1 (en) | 2004-01-10 | 2004-06-08 | Preload library for transparent file transformation |
Country Status (5)
Country | Link |
---|---|
US (2) | US7536418B2 (en) |
EP (1) | EP1702276A4 (en) |
CA (1) | CA2542162A1 (en) |
IL (1) | IL174897A0 (en) |
WO (1) | WO2005071574A1 (en) |
Families Citing this family (34)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7483532B2 (en) * | 2003-07-03 | 2009-01-27 | Microsoft Corporation | RTP payload format |
US7424482B2 (en) * | 2004-04-26 | 2008-09-09 | Storwize Inc. | Method and system for compression of data for block mode access storage |
WO2005103878A2 (en) * | 2004-04-26 | 2005-11-03 | Storewiz, Inc. | Method and system for compression of files for storage and operation on compressed files |
US8327050B2 (en) * | 2005-04-21 | 2012-12-04 | International Business Machines Corporation | Systems and methods for compressing files for storage and operation on compressed files |
US7684566B2 (en) | 2005-05-27 | 2010-03-23 | Microsoft Corporation | Encryption scheme for streamed multimedia content protected by rights management system |
US8521752B2 (en) | 2005-06-03 | 2013-08-27 | Osr Open Systems Resources, Inc. | Systems and methods for arbitrary data transformations |
EP1891787B1 (en) * | 2005-06-15 | 2010-03-24 | Solarflare Communications Incorporated | Data processing system |
US7983301B2 (en) * | 2005-06-24 | 2011-07-19 | O2Micro International, Ltd. | Method for extended transmission capabilities of short message service |
US20070005625A1 (en) * | 2005-07-01 | 2007-01-04 | Nec Laboratories America, Inc. | Storage architecture for embedded systems |
US7769880B2 (en) * | 2005-07-07 | 2010-08-03 | Microsoft Corporation | Carrying protected content using a control protocol for streaming and a transport protocol |
US7634816B2 (en) * | 2005-08-11 | 2009-12-15 | Microsoft Corporation | Revocation information management |
US8321690B2 (en) * | 2005-08-11 | 2012-11-27 | Microsoft Corporation | Protecting digital media of various content types |
US7720096B2 (en) * | 2005-10-13 | 2010-05-18 | Microsoft Corporation | RTP payload format for VC-1 |
CN101346883A (en) * | 2005-10-26 | 2009-01-14 | 斯多维兹有限公司 | Method and system for compression of data for block mode access storage |
US8832043B2 (en) | 2006-05-31 | 2014-09-09 | International Business Machines Corporation | Method and system for transformation of logical data objects for storage |
US8769311B2 (en) | 2006-05-31 | 2014-07-01 | International Business Machines Corporation | Systems and methods for transformation of logical data objects for storage |
US7512748B1 (en) | 2006-08-17 | 2009-03-31 | Osr Open Systems Resources, Inc. | Managing lock rankings |
US8539228B1 (en) | 2006-08-24 | 2013-09-17 | Osr Open Systems Resources, Inc. | Managing access to a resource |
US8082260B2 (en) * | 2007-01-31 | 2011-12-20 | International Business Machines Corporation | Handling content of a read-only file in a computer's file system |
US8024433B2 (en) * | 2007-04-24 | 2011-09-20 | Osr Open Systems Resources, Inc. | Managing application resources |
KR20090017170A (en) * | 2007-08-14 | 2009-02-18 | 삼성전자주식회사 | Method and apparatus for managing media file |
US7949693B1 (en) * | 2007-08-23 | 2011-05-24 | Osr Open Systems Resources, Inc. | Log-structured host data storage |
US7962452B2 (en) | 2007-12-28 | 2011-06-14 | International Business Machines Corporation | Data deduplication by separating data from meta data |
US8918374B1 (en) * | 2009-02-13 | 2014-12-23 | At&T Intellectual Property I, L.P. | Compression of relational table data files |
US7987162B2 (en) * | 2009-03-06 | 2011-07-26 | Bluearc Uk Limited | Data compression in a file storage system |
EP2460104A4 (en) * | 2009-07-27 | 2016-10-05 | Ibm | Method and system for transformation of logical data objects for storage |
US20110302224A1 (en) * | 2010-06-08 | 2011-12-08 | Rahav Yairi | Data storage device with preloaded content |
US8903874B2 (en) | 2011-11-03 | 2014-12-02 | Osr Open Systems Resources, Inc. | File system directory attribute correction |
US9558198B2 (en) * | 2012-03-28 | 2017-01-31 | Google Inc. | File map compression using run length encoding for active blocks |
US9830329B2 (en) | 2014-01-15 | 2017-11-28 | W. Anthony Mason | Methods and systems for data storage |
US11100108B2 (en) * | 2017-04-12 | 2021-08-24 | International Business Machines Corporation | Inflationary segment approach to temporal data partitioning for optimized model scoring |
CN108810011A (en) * | 2018-06-29 | 2018-11-13 | 南京南瑞继保电气有限公司 | A kind of universal network secure accessing sound zone system and message processing method suitable for power private network |
US11947686B2 (en) * | 2022-07-14 | 2024-04-02 | William D. Schwaderer | Dynamically encrypting and decrypting application data using dynamically linked interposer modules |
CN117632278A (en) * | 2022-08-29 | 2024-03-01 | 神基科技股份有限公司 | Sharing method of environmental parameters of application program and system with multiple electronic devices |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6064739A (en) * | 1996-09-30 | 2000-05-16 | Intel Corporation | System and method for copy-protecting distributed video content |
US20030128759A1 (en) * | 1999-04-17 | 2003-07-10 | Pulsent Corporation | Segment-based encoding system including segment-specific metadata |
US6665784B2 (en) * | 1999-09-03 | 2003-12-16 | Roxio, Inc. | Method for writing and reading data to and from a compact disc media |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5884093A (en) * | 1994-09-02 | 1999-03-16 | Rock Solid Systems, Inc. | Hard disk cache for CD-ROM and other slow access time devices |
US5623701A (en) * | 1995-06-06 | 1997-04-22 | International Business Machines Corporation | Data compression method and structure for a direct access storage device |
US6092163A (en) * | 1998-12-04 | 2000-07-18 | W. Quinn Associates, Inc. | Pageable filter driver for prospective implementation of disk space quotas |
US6405284B1 (en) * | 1998-10-23 | 2002-06-11 | Oracle Corporation | Distributing data across multiple data storage devices in a data storage system |
US6393517B1 (en) * | 1999-08-31 | 2002-05-21 | Sony Corporation | SCSI port filter driver for enhanced audio data |
JP4300669B2 (en) * | 2000-02-29 | 2009-07-22 | ソニー株式会社 | Recording method and apparatus, and recording medium |
US6571362B1 (en) * | 2000-06-26 | 2003-05-27 | Storage Technology Corporation | Method and system of reformatting data blocks for storage as larger size data blocks |
US7055038B2 (en) * | 2001-05-07 | 2006-05-30 | Ati International Srl | Method and apparatus for maintaining secure and nonsecure data in a shared memory system |
US6910116B2 (en) * | 2002-05-23 | 2005-06-21 | Microsoft Corporation | Game disk layout |
US6996695B2 (en) * | 2002-07-17 | 2006-02-07 | Masse Wayne P | Method, system, and storage medium for optimizing disk space and information access |
US6970969B2 (en) * | 2002-08-29 | 2005-11-29 | Micron Technology, Inc. | Multiple segment data object management |
US7370240B2 (en) * | 2004-04-29 | 2008-05-06 | International Business Machines Corporation | Method and apparatus for preserving trace data in a logical partitioned data processing system |
-
2004
- 2004-01-10 US US10/754,994 patent/US7536418B2/en active Active
- 2004-06-08 WO PCT/US2004/018478 patent/WO2005071574A1/en active Application Filing
- 2004-06-08 EP EP04754916A patent/EP1702276A4/en not_active Withdrawn
- 2004-06-08 CA CA002542162A patent/CA2542162A1/en not_active Abandoned
-
2006
- 2006-04-10 IL IL174897A patent/IL174897A0/en unknown
-
2009
- 2009-02-25 US US12/380,268 patent/US8065348B1/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6064739A (en) * | 1996-09-30 | 2000-05-16 | Intel Corporation | System and method for copy-protecting distributed video content |
US20030128759A1 (en) * | 1999-04-17 | 2003-07-10 | Pulsent Corporation | Segment-based encoding system including segment-specific metadata |
US6665784B2 (en) * | 1999-09-03 | 2003-12-16 | Roxio, Inc. | Method for writing and reading data to and from a compact disc media |
Also Published As
Publication number | Publication date |
---|---|
US8065348B1 (en) | 2011-11-22 |
EP1702276A4 (en) | 2007-03-14 |
EP1702276A1 (en) | 2006-09-20 |
IL174897A0 (en) | 2006-08-20 |
US7536418B2 (en) | 2009-05-19 |
US20060015535A1 (en) | 2006-01-19 |
CA2542162A1 (en) | 2005-08-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7536418B2 (en) | Preload library for transparent file transformation | |
US9846700B2 (en) | Compression and deduplication layered driver | |
US7818532B2 (en) | Method and system for creating and restoring an image file | |
JP4755642B2 (en) | Method and system for file compression and operation of compressed files for storage | |
US8327050B2 (en) | Systems and methods for compressing files for storage and operation on compressed files | |
US20120089579A1 (en) | Compression pipeline for storing data in a storage cloud | |
US20120089775A1 (en) | Method and apparatus for selecting references to use in data compression | |
US7334099B2 (en) | Method and system for managing image files | |
US20060230014A1 (en) | Method and system for compression of files for storage and operation on compressed files | |
US7200603B1 (en) | In a data storage server, for each 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 | |
US8095678B2 (en) | Data processing | |
JP2007188485A (en) | Method, system and product of managing archive file system, (management of archive file system) | |
US20080005524A1 (en) | Data processing | |
US20140129529A1 (en) | Storing Data Files in a File System | |
US8886656B2 (en) | Data processing | |
US8290993B2 (en) | Data processing | |
ZA200608760B (en) | Method and system for compression of files for storage and operation on compressed files |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2542162 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 174897 Country of ref document: IL |
|
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004754916 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2481/CHENP/2006 Country of ref document: IN |
|
WWP | Wipo information: published in national office |
Ref document number: 2004754916 Country of ref document: EP |