Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. The compression matrix may also serve as a warm start if additional compression is desired. Compression may be performed in stages, where an initial compression matrix is generated in a first stage using larger letter sizes for alignment and then a second compression stage is performed using smaller letter sizes. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Methods and devices for coding point clouds using direct coding mode to code coordinates of a point within a sub-volume associated with a current node instead of a pattern of occupancy for child nodes. When direct coding is applied to two or more points in the sub-volume, the points are ordered based on one of their respective coordinate values in binary and pairwise coding of those coordinate values is carried out on a bit-by-bit basis starting from the most significant bit position. For example, the coordinate values relate to a direction in the Cartesian coordinate system, the location of the first point is represented by an x-direction coordinate value, a y-direction coordinate value and a z-direction coordinate value. The pairwise coding includes coding whether the bits are the same and, if so, coding the bit value.

A server device is disclosed, which includes a communicator comprising communication circuitry configured to perform communication with the user terminal device, a plurality of encoders configured to perform encoding in parallel, and a processor configured to sequentially allocate frames generated in real time to a plurality of encoders and to control the communicator so that a plurality of encoded frames output in parallel from a plurality of encoders are individually streamed to a user terminal device.

Technology is disclosed herein for compressing, encoding, and otherwise reducing the size of resource files. In at least one implementation, similarity compression is employed to reduce the size of a resource file. In another implementation, map-less encoding is employed to reduce the number of bytes used to represent a resource string. Bit-level compression is employed in another implementation to reduce the quantity of bits used to encode each character in a string. In addition, implementations are disclosed related to technology for naming strings and accelerated string location and retrieval.

Data transmission from a bottom hole assembly (BHA) includes obtaining a scan from multiple scans forming a downhole data log of a borehole within a subterranean formation. The scan includes a sequence of data items from a sensor in the BHA located in the borehole. Each data item corresponds to an azimuth angle of the sensor. Further, compressed scan data is generated from the sequence of data items on a per-scan basis, and transmitted, using a pre-determined borehole telemetry, to a surface unit.

Aspects presented herein relate to methods and devices for data processing including an apparatus, e.g., a CPU. The apparatus may obtain an indication of a set of data subunits corresponding to at least one data unit. The apparatus may also arrange data for the set of data subunits into a first data order for the set of data subunits. Further, the apparatus may perform at least one of an encoding process or a decoding process on the data for each data subunit of the set of data subunits. The apparatus may also rearrange the data for the set of data subunits into the first data order for a first data subunit in the set of data subunits and into a second data order for at least one second data subunit in the set of data subunits, where the first data order is different from the second data order.

A method for compressing columnar data may include generating, for a data column included in a data chunk, a dictionary enumerating, in a sorted order, a first set of unique values included in the first data column. A compression technique for generated a compressed representation of the data column having a fewest quantity of bytes may be identified based at least on the dictionary. The compression technique including a dictionary compression applying the dictionary and/or another compression technique. A compressed data chunk may be generated by applying the compression technique to compress the data column included in the data chunk. The compressed data chunk may be stored at a database in a variable-size persistent page whose size is allocated based on the size of the compressed representation of the data column. Related systems and articles of manufacture are also provided.

A method, computer program, and computer system is provided for compressing a neural network model. One or more indices corresponding to a multi-dimensional tensor associated with a neural network are reordered. A set of weight coefficients associated with the one or more reordered indices is unified. A model of the neural network is compressed based on the unified set of weight coefficients.

Disclosed herein are systems and methods for compressing structured or semi-structured data in a horizontal manner achieving compression ratios similar to vertical compression. Collections include structured or semi-structured data include a number of fields and are described using a schema. Fields include information having semantic similarity and are compressed using methods suitable for compressing the type of data. Data of a collection is compressed after fragmentation or may be normalized prior to compression. Data with semantic similarity is compressed using token tables and/or n-gram tables, where higher weighted, consisting of the product of frequency and length, occurring values may be stored in the lower numbered indices of the data table. Records include record descriptor bytes, field descriptor bytes, zero or more array descriptor bytes, zero or more object descriptor bytes, or bytes representing the data associated with the record. Data is indexed or compressed by a suitable module.

The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.