With graph compression, there is a need to significantly reduce the size of the graph information/data for routing determinations. The disclosed graph compression allow for more efficient and less resource-intensive routing determinations while maintain complete graph fidelity.

A method, an electronic device, and a computer program product for managing a file system are provided. For example, the method comprises causing multiple data blocks to be written to a storage space of the file system, the size of each of the multiple data blocks being not lower than a threshold size, and creating at least one space fragment in the storage space, the size of each of the at least one space fragment not exceeding the threshold size. Therefore, this solution can quickly and efficiently age a file system.

Embodiments of the invention make consumer application adoption more efficient by giving suppliers access to the desired target audience by displaying the applications to the right audience. Suppliers can provide criteria for the kinds of users they are looking to target using constraints. Embodiments of the invention enable viewers that match the constraints to see the service. The user gets to see an automatically generated application set, that is instantly available, with a high probability of containing the application the user is likely to seek. Identity and Payment support are built into the platform, such that the user no longer needs to register with each application or set up payment with each application. In addition, the platform reduces bandwidth consumption, storage front print, and power consumption of the user device by choosing when and which modules to download to the user device.

Technology is disclosed for selectively compressing data based on similarity of pages within the data that is to be compressed. At least one corresponding hash value is generated for each one of multiple candidate pages to be compressed. In response to the hash values generated for the candidate pages, the technology selects a set of similar candidate pages from the candidate pages. The set of similar candidate pages are a subset of the candidate pages that includes less than all the candidate pages. The set of similar candidate pages are compressed as a single unit, separately from one or more other ones of the candidate pages that were not selected to be included in the set of similar candidate pages.

The disclosed technology relates to a system configured to receive operations data from a content management system, wherein the operations data comprises a log of operations, execute the log of operations, and update, based on execution of the log of operations, a remote tree representing a server state for content items stored on the content management system.

The storage device includes a first memory, a process device that stores data in the first memory and reads the data from the first memory, and an accelerator that includes a second memory different from the first memory. The accelerator stores compressed data stored in one or more storage drives storing data, in the second memory, decompresses the compressed data stored in the second memory to generate plaintext data, extracts data designated in the process device from the plaintext data, and transmits the extracted designated data to the first memory.

A first name of a first prime data element may be used to traverse a sequence of edges in a tree data structure to navigate to a leaf node which corresponds to a set of prime data elements, where each edge in the sequence of edges may correspond to a successive portion of the first name. The leaf node may store navigation lookahead fields, where each navigation lookahead field may store one or more further successive portions of a name of a corresponding prime data element in the set of prime data elements. The navigation lookahead fields may be used to determine where to insert the first prime data element in the leaf node. An entry in the leaf node may be allocated to store information related to the first prime data element.

The disclosure herein describes writing data to a log-structured merge (LSM) tree file system on an object storage platform. Write data instructions indicating data for writing to the LSM tree file system are received. Based on the received instructions, the data is written to the first data cache. Based on an instruction to transfer data in the live data cache to the LSM tree file system, the first data cache is converted to a stable cache. A second data cache configured as a live data cache is then generated based on cloning the first data cache. The data in the first data cache is then written to the LSM tree file system. Use of a stable cache and a cloned live data cache enables parallel writing data to the file system by the stable cache and handling write data instructions by the live data cache.

A hardware-implemented file reader includes an interface, multiple hardware-implemented column readers and a hardware-implemented record reconstructor. The interface is configured to access a file including multiple records. The records store values in accordance with a nested structure that supports optional values and repeated values. The file is stored in a columnar format having multiple columns, each column storing (i) compressed values and (ii) corresponding compressed structure information that associates the values in the column to the nested structure of the records. Each column reader is configured to be assigned to a respective selected column, and to read and decompress both the values and the structure information from at least a portion of the selected column. The record reconstructor is configured to reconstruct one or more of the records from at least portions of the columns that are read by the column readers, and to output the reconstructed records.

A technique of partitioning compressed data includes splitting the compressed data into multiple portions. The technique further includes storing a decompression state in association with a current portion, wherein the decompression state is based on data of a previous portion and enables decompression of the current portion independently of other portions.