G06F16/1744

Gene sequencing data compression preprocessing, compression and decompression method, system, and computer-readable medium

The present invention discloses a gene sequencing data compression preprocessing, compression and decompression method, a system, and a computer-readable medium. The preprocessing method implementation steps include: obtaining reference genome data; obtaining a mapping relationship between a short string K-mer and a prediction character c to obtain a prediction data model P1 containing any short string K-mer in the positive strand and negative strand of a reference genome and the prediction character c in a corresponding adjacent bit. The compression and decompression methods relate to performing compression/decompression on the basis of the prediction data model P1. The system is a computer system including a program for executing the previous method. The computer-readable medium includes a computer program for executing the previous method. The present invention can be oriented towards lossless gene sequencing data compression, provides fully effective information for a high-performance lossless compression and decompression algorithm for gene sequencing data.

Encoding / Decoding System and Method
20230214353 · 2023-07-06 ·

A computer-implemented method, computer program product and computing system for: processing an unencoded data file to identify a plurality of file segments, wherein the unencoded data file is a dataset for use with a blockchain process; mapping each of the plurality of file segments to a portion of a dictionary file to generate a plurality of mappings that each include a starting location and a length, thus generating a related encoded data file based, at least in part, upon the plurality of mappings; receiving a request to manipulate the unencoded data file from the blockchain process; and processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

High performance space efficient distributed storage
11550755 · 2023-01-10 · ·

High performance space efficient distributed storage is disclosed. For example, a distributed storage volume (DSV) is deployed on a plurality of hosts, with a first host storing a local cache, and a storage controller executing on a processor of the first host receives a request to store a first file. The first file is stored to the local cache. The DSV is queried to determine whether a second file that is a copy of the first file is stored in the DSV. In response to determining that the DSV lacks the second file, the first file is transferred from the local cache to the DSV and then replicated to a second host of the plurality of hosts. In response to determining that the second file resides in the DSV, a reference to the second file is stored in the DSV and then replicated to the second host.

Unique ID generation for sensors

Systems, methods, and computer-readable media are provided for generating a unique ID for a sensor in a network. Once the sensor is installed on a component of the network, the sensor can send attributes of the sensor to a control server of the network. The attributes of the sensor can include at least one unique identifier of the sensor or the host component of the sensor. The control server can determine a hash value using a one-way hash function and a secret key, send the hash value to the sensor, and designate the hash value as a sensor ID of the sensor. In response to receiving the sensor ID, the sensor can incorporate the sensor ID in subsequent communication messages. Other components of the network can verify the validity of the sensor using a hash of the at least one unique identifier of the sensor and the secret key.

Cooperative access method, system, and architecture of external storage

The present disclosure provides a cooperative access method, system, and architecture of an external storage. The method includes: pre-storing image compression configuration information and image decompression configuration information corresponding to an access address of a read and write operation of an image processing device; compressing an image data and storing the compressed data to an external storage based on an access address of a write operation of an image processing device and the image compression configuration information; decompressing the compressed data and sending the decompressed data to the image processing device based on an access address of a read operation of the image processing device and the image decompression configuration information, which compresses the image data and stores it in the external storage, decompresses compressed data and returns it to the image processing device, thereby reducing the space requirements for external storage, which improves the overall system performance.

Security for data at rest in a remote network management platform

An embodiment may involve persistent storage including a parent filesystem and a pre-configured amount of free space within the parent filesystem that is dedicated for shared use. The embodiment may also involve one or more processors configured to, for each of a plurality of child filesystems: create a sparse file with an apparent size equivalent to the pre-configured amount of free space; create a virtual mapped device associated with the sparse file; establish one or more cryptographic keys for the virtual mapped device; create an encrypted virtual filesystem for the virtual mapped device and within the sparse file, wherein the encrypted virtual filesystem uses the cryptographic keys for application-transparent encryption and decryption of data stored by way of the encrypted virtual filesystem; and mount the encrypted virtual filesystem within the parent filesystem as one of the child filesystems.

HYBRID INTERMEDIATE STREAM FORMAT
20230004533 · 2023-01-05 ·

Systems and methods providing a hybrid intermediate stream format are provided. The method includes compressing a vertex into a first data block via a first compression method, compressing the vertex into a second data block via a second compression method, determining a smaller file of the first data block and the second data block, finalizing compression of the vertex via a compression method, selected from the first compression method and the second compression method, corresponding to the determined smaller file of the first data block and the second data block, and transferring the compressed vertex.

SYSTEM FOR ELECTRONIC DATA COMPRESSION BY AUTOMATED TIME-DEPENDENT COMPRESSION ALGORITHM
20230006691 · 2023-01-05 · ·

A system is provided for electronic data compression by automated time-dependent compression algorithm. In particular, the system may track instances in which a particular dataset is used, copied, or accessed over time. For certain datasets (e.g., datasets that have not been accessed for a threshold amount of time), the system may use a time-based compression algorithm that progressively removes the least significant bits of such datasets as time passes. The compression of the datasets may continue until the system detects that further compression would cause the dataset to be unreadable or unrecoverable. In this way, the system may minimize the computing resources allocated to storing datasets that are not frequently accessed.

Method and system for content agnostic file indexing

A computer-implemented method for content-agnostic referencing of a binary data file, the method comprising: determining a length of the binary data file, the length comprising the number of bits of the binary data file; for the determined length, generating all permutations of data of the determined length; locating an index within the generated permutations, wherein the index is the starting position of the binary data file within the generated permutations; and using the length and the index to indicate the binary data file.

System, method, and computer program product for generating a file structure

Computer-implemented methods may include receiving first report template data. The first report template data may include a first version identifier identifying a first version of a report schema associated with a first report template. The first version of the report schema may be determined to be subsequent to a current version of the report schema based on the first version identifier. First sample export object data associated with the first version of the report schema may be retrieved. First sample file structure data associated with a file structure of the first version of the report schema may be determined based on the first sample export object data. A first file structure may be generated based on the first sample file structure data. The first file structure may be populated with a plurality of report templates including the first report template. Systems and computer program products are also provided.