Techniques and apparatuses to decompress data that has been stack compressed is described. Stack compression refers to compression of data in one or more dimensions. For uncompressed data blocks that are very sparse, i.e., data blocks that contain many zeros, stack compression can be effective. In stack compression, uncompressed data block is compressed into compressed data block by removing one or more zero words from the uncompressed data block. A map metadata that maps the zero words of the uncompressed data block is generated during compression. With the use of the map metadata, the compressed data block can be decompressed to restore the uncompressed data block.

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.

A binary-coded structure document, (e.g., in an EXI format which is based on a structure document designed in a text-based description language, such as XML), is provided with a binary-coded index document, which is based on a structural part of the structure document. A storage representation of the binary-coded index document is stored in a working storage unit of the device, and the binary-coded structure document is stored in a background storage unit assigned to the device. A processing operation or a request by at least one processing process is carried out by accessing the storage representation of the binary-coded index document via an object interface, and in certain examples, fragments of the binary-coded structure document are loaded into the working storage unit by the object interface. By carrying out processing operations on the binary-coded index document, faster request operations are facilitated in that specific requests may already be processed using the index document BCI without the involvement of the binary-coded structure document.

An accelerator device determines a compression format based on a header of a structured data element to be decompressed. The accelerator device may configure the accelerator device based on the compression format. The accelerator device may decompress a data block of the structured data element based on the configuration.

A system for compressing Controller Area Network (CAN) messages, the system comprising a processing resource configured to: obtain a CAN messages sequence including a plurality of CAN messages intercepted at a given order by at least one device adapted to monitor messages transmitted via communication channel(s) of a vehicle; group the CAN messages of the CAN messages sequence into MID groups, by a CAN MID field of the CAN messages; for each given MID group of the MID groups split the CAN messages of the MID group into field groups, wherein each field group comprises a respective field of a plurality of fields of the CAN messages of the MID group; employ at least one compression scheme on at least one of the field groups; generate a data structure comprising the field groups; and compress the data structure using a lossless compression algorithm, giving rise to a compressed data structure.

Systems and methods for lossless compression of tabular numeric data are provided. The system can include one or more data compression servers executing data compression system code to compress the tabular numeric data, a storage database to store the compressed tabular numeric data, and one or more data decompression servers to decompress the tabular numeric data for use. The one or more data compression servers, the storage database, and the one or more data decompression servers can communicate via a communication network. The system can receive the uncompressed tabular numeric data from one or more data generation systems, processes the uncompressed tabular numeric data with the data compression system code, and generate a compressed table of numeric information, which can be stored in the database, or later decompressed by the one or more data decompression servers.

Techniques described herein may be utilized to serialise and de-serialise arithmetic circuits that are utilized in the execution of computer programs. The arithmetic circuit may be utilized to build a Quadratic Arithmetic Problem (QAP) that is compiled into a set of cryptographic routines for a client and a prover. The client and prover may utilize a protocol to delegate execution of a program to the prover in a manner that allows the client to efficiently verify the prover correctly executed the program. The arithmetic circuit may comprise a set of symbols (e.g., arithmetic gates and values) that is compressed to produce a serialised circuit comprising a set of codes, wherein the set of symbols is derivable from the set of codes in a lossless manner. Serialisation and de-serialisation techniques may be utilized by nodes of a blockchain network.

A flight chart conversion system is disclosed. A host computing device is configured to: convert flight chart file(s) to SVG flight chart file(s) defined in XML; preprocess each of the SVG flight chart file(s) by removing filled shapes overlapping navigational paths, detecting font characters, and replacing the font characters with font character references; convert the SVG flight chart file(s) to flight chart(s) defined in set(s) of aircraft display hardware directives; compress each of the flight chart(s) and the respective metadata; and combine the flight chart(s) and the respective metadata into a flight chart database.

A method for compressing RDF tuples. The method including obtaining RDF tuples, obtaining a dictionary of indices, encoding for each RDF tuple the indices attributed to the subject and the object, grouping RDF tuples sharing the same predicate and for each group sorting the RDF tuples by considering the encoding of the subject and the object, and for each group of sorted RDF tuples, serializing the index of the shared predicate, serializing the encoding of the subject and the object of a first RDF tuple, and for each RDF tuple of the group of sorted RDF tuples subsequent to the first RDF tuple of the group, computing a difference between the encoding of the subject and the object of a current RDF tuple and the encoding of the subject and the object of a previous RDF tuple, and serializing the computed difference in a form of a variable-length integer.

An extensible markup language schema definition (XSD) may be received. The XSD may include multiple elements, each having a complex type definition and an empty content model. A singleton empty content grammar may be generated. The singleton empty content grammar may be shared among the multiple elements. Multiple grammars may be generated based on the XSD. The multiple grammars may be associated with encoding and decoding extensible markup language (XML) documents based on the XSD to and from efficient XML interchange (EXI) streams. Each of the multiple grammars may correspond to an element of the multiple elements. Each of the multiple grammars may include the singleton empty content grammar. A device configured to encode or decode the XML documents to or from the EXI streams commits fewer resources than the device would commit if each of the multiple grammars included a separate content grammar rather than the singleton content grammar.