Methods and systems for storing data include compressing data inflated from a first compression format into a second format using a processor and verifying contents of the data concurrently with compressing the data. compression is aborted responsive to a failure of the content verification, but an output of the compression is stored to a tape drive until the compression is aborted. The tape drive is rolled back to a file start position after the compression is aborted and compression of any remaining uncompressed data is skipped after the compression is aborted. The data is stored to the tape drive after rolling the tape drive back.
|
1. A method for storing data, comprising:
compressing data inflated from a first compression format into a second format using a processor;
verifying contents of the data concurrently with compressing the data;
aborting compression responsive to a failure of the content verification;
storing an output of the compression to a tape drive until the compression is aborted;
rolling the tape drive back to a file start position after the compression is aborted;
skipping compression of any remaining uncompressed data after the compression is aborted; and
storing the data to the tape drive after rolling the tape drive back.
8. A system for storing data, comprising:
a compression module comprising a processor configured to create blocks from data inflated from a first compression format for a second compression format that is different from the first compression format and to compress the blocks in the second format;
a verification module configured to verify contents of the blocks concurrently with compression of the blocks, wherein the compression module is further configured to abort compression responsive to a failure of content verification; and
a tape drive configured to store an output of the compression until compression is aborted, to roll back to a file start position after the compression is aborted, skip compression of any remaining uncompressed blocks after the compression is aborted, and to store the received data after rolling back.
16. A non-transitory computer readable storage medium comprising a computer readable program for storing data, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
compressing data inflated from a first compression format into a second compression format that is different from the first compression format using a processor;
verifying contents of the data concurrently with compressing the data;
aborting compression responsive to a failure f the content verification;
storing an output of the compression to a tape drive until the compression is aborted;
rolling the tape drive back to a file start position after the compression is aborted;
skipping compression of any remaining uncompressed blocks after the compression is aborted; and
storing the received data to the tape drive after rolling the tape drive back.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
9. The system of
10. The system of
11. The system of
12. The system of
13. The system of
17. The non-transitory computer readable storage medium of
18. The lion-transitory computer readable storage medium of
19. The non-transitory computer readable storage medium of
20. The non-transitory computer readable storage medium of
|
|||||||||||||||||||||||||||||
The present invention relates to genetic sequencing and, more particularly, to storage techniques for large volumes of genome data.
Historically, genetic sequencing was a slow process that generated genome data at a rate that could be easily accommodated by existing storage technologies. Next generation sequencing technologies, however, produce genome data much more rapidly, and the rate of data production is increasing at a rate that outstrips storage capacity technology advances. For example, the European Bioinformatics Institute estimates that their storage capacity needs double year-to-year. The capacity of storage technologies, meanwhile, increases roughly in accordance with Moore's law, doubling every eighteen months.
In the early stages of generating genomic data, data is often produced in a human-readable (e.g., ASCII) format called SAM. However, SAM is very inefficient and produces files that are terabytes in size. These SAM files are often converted to BAM, which is a binary form and is typically compressed. A compressed BAM file is a sequence of compressed BAM blocks, with uncompressed BAM blocks each having about 64 kb of data. However, in the face of the tremendous rate at which genomic data is generated, even BAM files are growing unsuitable for storage.
Superior data management techniques are therefore needed. If disks are not large enough to store all of the available data, an additional cost is incurred by file management in determining which files should be deleted and which should be preserved.
Tape storage is frequently used for archiving genome data. Standard tape devices often implement hardware data compression and can perform real-time compression of archived data. However, data compression by tape devices is not effective for genome data that has already been compressed using, e.g., BAM compression.
A method for storing data includes compressing data inflated from a first compression format into a second format using a processor and verifying contents of the data concurrently with compressing the data. Compression is aborted responsive to a failure of the content verification, but an output of the compression is stored to a tape drive until the compression is aborted. The tape drive is rolled back to a file start position after the compression is aborted and compression of any remaining uncompressed data is skipped after the compression is aborted. The data is stored to the tape drive after rolling the tape drive back.
A system for storing data includes a compression module having a processor configured to create blocks from data inflated from a first compression format for a second compression format that is different from the first compression format and to compress the blocks in the second format. The system also includes a verification module configured to verify contents of the blocks concurrently with compression of the blocks, wherein the compression module is further configured to abort compression responsive to a failure of content verification. The tape drive of the system is configured to store an output of the compression until compression is aborted, to roll back to a file start position after the compression is aborted, skip compression of any remaining uncompressed blocks after the compression is aborted, and to store the received data after rolling back.
A non-transitory computer readable storage medium includes a computer readable program for storing data, that when executed on a computer causes the computer to perform the steps of: compressing data inflated from a first compression format into a second compression format that is different from the first compression format using a processor, verifying contents of the data concurrently with compressing the data, and aborting compression responsive to a failure of the content verification. When executed on a computer, the computer readable program of the computer readable storage medium also causes the computer to perform the steps of: storing an output of the compression to a tape drive until the compression is aborted, rolling the tape drive back to a file start position after the compression is aborted, skipping compression of any remaining uncompressed blocks after the compression is aborted and storing the received data to the tape drive after rolling the tape drive back.
These and other features and advantages will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.
The disclosure will provide details in the following description of preferred embodiments with reference to the following figures wherein:
Embodiments of the present invention take files that are already compressed under, e.g., BAM compression, and transparently convert them to a more efficient compression format before archival. In one particular embodiment, the files are converted to the CRAM compression format, which produces significantly better compression ratios for genome data than BAM compression. Pipeline stages are created for type identification, compression, and verification related to the target compression format that exploit parallelism in the file structure to accelerate the processes, ensuring file validity.
Referring now to the drawings in which like numerals represent the same or similar elements and initially to
Block 106 takes the inflated data and uses it to create blocks in the target compression format. In one particular embodiment, CRAM compression is used as the target compression format. This may be performed by collecting data blocks of a same type into a CRAM block. Block 108 verifies the blocks' contents in the background by, e.g., checking whether the contents of the CRAM blocks are the same as the contents of the inflated data.
Concurrently with the verification of block 108, block 110 performs lossless compression of the blocks in, e.g., CRAM format, with a specific compression algorithm being selected depending on the type of each block. Block 112 then transfers the compressed blocks to a storage device. The storage device may be, e.g., a tape storage device. Block 112 completes archiving the input file and records a file archive completion as CRAM.
At several points in this process, a step may fail. For example, the input file might not have the expected source compression format headers in block 102, the inflation of data in block 104 may fail, or the creation of blocks in the target compression format may fail either during creation in block 106 or during verification in block 108. In each of these cases, assuming a tape drive is used for storage, processing goes to block 114. At block 114, the tape position is rolled back to a point before the file backup began. Block 116 then skips any remaining compression steps and block 112 stores, instead of a recompressed file, the original input file. Thus if recompression fails at any point, the information is stored in its source format.
Notably, verification of the blocks created in 106 is performed alongside compression of the blocks in 110. The data format is converted for compression speculatively, without foreknowledge of the underlying data, by performing the data integrity check of block 108 in the background. There is the possibility that only the end user knows the format of the data in the system and there is further the possibility that the data does not always comply with the format specifications. With conventional approaches, data integrity is checked first to determine whether a given data block is in the desired format, before processing the data. However, pre-verification takes a significant amount of time before the conversion may be performed and might not be completed within a target period. Instead, the present embodiments perform data format conversion in block 110 right away, without waiting for verification in block 108 to complete. If the data verification in block 108 finds that the current data cannot be compressed, then the ongoing compression of block 110 is canceled.
Although BAM and CRAM compression formats are discussed herein for the purpose of illustration, it should be recognized that any appropriate compression format(s) may be used in their stead. BAM is a very common format for storing genome data, while CRAM produces file sizes that are generally smaller than those produced by the popular BAM compression format.
The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
Reference in the specification to “one embodiment” or “an embodiment” of the present principles, as well as other variations thereof, means that a particular feature, structure, characteristic, and so forth described in connection with the embodiment is included in at least one embodiment of the present principles. Thus, the appearances of the phrase “in one embodiment” or “in an embodiment”, as well any other variations, appearing in various places throughout the specification are not necessarily all referring to the same embodiment.
It is to be appreciated that the use of any of the following “/”, “and/or”, and “at least one of”, for example, in the cases of “A/B”, “A and/or B” and “at least one of A and B”, is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of both options (A and B). As a further example, in the cases of “A, B, and/or C” and “at least one of A, B, and C”, such phrasing is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of the third listed option (C) only, or the selection of the first and the second listed options (A and B) only, or the selection of the first and third listed options (A and C) only, or the selection of the second and third listed options (B and C) only, or the selection of all three options (A and B and C). This may be extended, as readily apparent by one of ordinary skill in this and related arts, for as many items listed.
Referring now to
Referring now to
A decompress module 308 accepts input data in a first compression format and decompresses/inflates the data using the processor 302. A compress module 310 then re-compresses the data in a second compression format using the processor 302. A verification module 312 performs verification of the data format concurrently with the operation of the compression module 310 to ensure that the data being processed is of the expected format. If the operation of any of the decompress module 308, the compress module 310, or the verification module 312 fails, the storage device 306 rolls back to a starting position and records the original data. Otherwise, the storage device 306 stores the re-compressed data in the second compression format.
Having described preferred embodiments of a system and method for increasing storage capacity and data transfer speed in genome data backup (which are intended to be illustrative and not limiting), it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments disclosed which are within the scope of the invention as outlined by the appended claims. Having thus described aspects of the invention, with the details and particularity required by the patent laws, what is claimed and desired protected by Letters Patent is set forth in the appended claims.
| Patent | Priority | Assignee | Title |
| Patent | Priority | Assignee | Title |
| 7260642, | Feb 25 2003 | ICP Electronics Inc. | Method and system for real-time monitoring image transmission |
| 20100074543, | |||
| 20140214780, | |||
| JP10215228, | |||
| JP2002164796, | |||
| JP2003188735, | |||
| JP2012094141, | |||
| JP2013239162, | |||
| JP5225308, | |||
| JP7322076, | |||
| JP8116274, | |||
| WO2007026484, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Jun 18 2015 | OGASAWARA, TAKESHI | International Business Machines Corporation | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 049778 | /0839 | |
| Jul 17 2019 | International Business Machines Corporation | (assignment on the face of the patent) | / |
| Date | Maintenance Fee Events |
| Jul 17 2019 | BIG: Entity status set to Undiscounted (note the period is included in the code). |
| Date | Maintenance Schedule |
| May 25 2024 | 4 years fee payment window open |
| Nov 25 2024 | 6 months grace period start (w surcharge) |
| May 25 2025 | patent expiry (for year 4) |
| May 25 2027 | 2 years to revive unintentionally abandoned end. (for year 4) |
| May 25 2028 | 8 years fee payment window open |
| Nov 25 2028 | 6 months grace period start (w surcharge) |
| May 25 2029 | patent expiry (for year 8) |
| May 25 2031 | 2 years to revive unintentionally abandoned end. (for year 8) |
| May 25 2032 | 12 years fee payment window open |
| Nov 25 2032 | 6 months grace period start (w surcharge) |
| May 25 2033 | patent expiry (for year 12) |
| May 25 2035 | 2 years to revive unintentionally abandoned end. (for year 12) |