Abstract: Provided in the present invention are a K-Truss graph-based storage system cache prefetching method, a system, and a medium, where method steps of the present invention include: when a data request stream in a system arrives, an access mode of the data request stream is determined; if said mode is a sequence mode, then n sequence blocks after a data block corresponding to the data request stream are prefetched and serve as prefetch data; otherwise, the data block corresponding to the data request stream serves as a query vertex to query a K-Truss graph, a truss structure matching the query vertex is obtained, and data of a data block from within the truss structure is obtained and serves as prefetch data; the K-Truss graph is updated according to the data block corresponding to the data request stream; and lastly a prefetch data block is prefetched into a main memory.

Abstract: Techniques for providing suggested content is described. For example, a social networking system may receive, from an account of a social networking system, an indication of a selection of a first content item. The social networking system may determine that the first content item is associated with a first topic and may receive a request from the account to access a second content item associated with the first topic. The social networking system may then cause presentation of the second content item and may determine that the request meets or exceeds a threshold number of requests for content items associated with the first topic. Based on determining that the request meets or exceeds the threshold, the social networking system may cause presentation of a suggested content item associated with a second topic.

Abstract: A directory management method and system for a file system based on Cuckoo hash are provided, including the steps of reading metadata of a sub-directory or a sub-file, used as a target file, in a directory: receiving a request for reading the target file in the directory; for the target file, determining an ith candidate data block, in a hash table of the directory according to a hash calculation result obtained by performing hash calculation on a filename filename of the target file according to an ith hash function of Cuckoo hash iteratively; if the filename filename of the target file exists in the ith candidate data block, reading metadata of the target file and returning the metadata, and ending the process; otherwise, continuing to iterate until the iteration ends and returning a message that the target file does not exist.

Abstract: Disclosed are a genome assembly method, a genome assembly apparatus, a device and a storage medium. The method includes: obtaining a gene short sequence, and determining a first segmentation value; segmenting the gene short sequence based on the first segmentation value to obtain each gene subsequence; globally sorting each gene subsequence based on a preset grouped parallel sorting by regular sampling to obtain each sorted gene subsequence; traversing the distributed gene map in parallel to obtain each continuous gene sequence, and filling and assembling each continuous gene sequence to obtain each target continuous gene sequence; and determining a second segmentation value, and in response to that the second segmentation value is greater than or equal to a preset maximum segmentation threshold, assembling each target continuous gene sequence to obtain a genome assembly result.

Abstract: A low-latency file system file address space management method and system, and a medium. The method of the present invention comprises: generating a superblock and a block group allocation table from an address space of a storage device, wherein the superblock stores file system information and the allocation situation of block groups on a liner address space of the storage device, and the block group allocation table is used for marking the allocation situation of data blocks in the corresponding block group; when a file is created, dynamically creating or selecting a corresponding block group according to the size of a specified data block and allocating the data block; and writing file data into the allocated data block, and updating the block group allocation table and information of the superblock.

Abstract: A metadata management method, system and medium are provided. All directories and files in a file system are organized in a tree structure, and all directories and subfiles under a single directory are saved as a whole on a continuous address space of an underlying storage device in the order of creation in sequence. When metadata is updated, update operations on all subdirectories/subfiles under a directory are appended to the tail of the directory in the form of log in order, so that each metadata operation triggers only one IO request. In the process of metadata retrieval, parsing a subdirectory under a parent director requires reading all data on the continuous address space corresponding to the parent directory, and then searching for a match by means of multiple acceleration methods.

Abstract: Provided in the present invention are a K-Truss graph-based storage system cache prefetching method, a system, and a medium, where method steps of the present invention include: when a data request stream in a system arrives, an access mode of the data request stream is determined; if said mode is a sequence mode, then n sequence blocks after a data block corresponding to the data request stream are prefetched and serve as prefetch data; otherwise, the data block corresponding to the data request stream serves as a query vertex to query a K-Truss graph, a truss structure matching the query vertex is obtained, and data of a data block from within the truss structure is obtained and serves as prefetch data; the K-Truss graph is updated according to the data block corresponding to the data request stream; and lastly a prefetch data block is prefetched into a main memory.

Abstract: A low-latency file system file address space management method and system, and a medium. The method of the present invention comprises: generating a superblock and a block group allocation table from an address space of a storage device, wherein the superblock stores file system information and the allocation situation of block groups on a liner address space of the storage device, and the block group allocation table is used for marking the allocation situation of data blocks in the corresponding block group; when a file is created, dynamically creating or selecting a corresponding block group according to the size of a specified data block and allocating the data block; and writing file data into the allocated data block, and updating the block group allocation table and information of the superblock.

Abstract: A small-file storage optimization system based on a virtual file system in a KUBERNETES user-mode application which is applied to a target file system includes a network file system including a network file system server and a network file system client, a user-mode application mounted on a shared directory exposed by the network file system server through the network file system client, and a virtual file system including a virtual file system client and a virtual file system server. A file block creating and formatting module in the virtual file system server creates a virtual file block for storing small files on one or more object storage target devices of the target file system, and the virtual file block is mounted on the shared directory exposed by the network file system server.

Abstract: A distributed metadata management consistency assurance method, device, system and application are provided. A consistent node is deployed in a metadata cluster, the client sends a metadata update request to the consistent node, and the consistent node returns a metadata update success message to the client, sequentially records the metadata update request, marks old metadata as invalidated, and deletes the invalidation mark after asynchronous data synchronization with the metadata server. The client sends a metadata read operation to the metadata server. If an object of the metadata read operation is marked as invalidated, read data that has not yet completed asynchronous data synchronization is returned via the consistent node; otherwise, the read data is directly returned via the metadata server where the metadata is located. The disclosure can ensure consistency of distributed metadata management, and improve metadata access performance as far as possible while ensuring the consistency of metadata update.

Abstract: A metadata management method, system and medium are provided. All directories and files in a file system are organized in a tree structure, and all directories and subfiles under a single directory are saved as a whole on a continuous address space of an underlying storage device in the order of creation in sequence. When metadata is updated, update operations on all subdirectories/subfiles under a directory are appended to the tail of the directory in the form of log in order, so that each metadata operation triggers only one IO request. In the process of metadata retrieval, parsing a subdirectory under a parent director requires reading all data on the continuous address space corresponding to the parent directory, and then searching for a match by means of multiple acceleration methods.

Abstract: A small-file storage optimization system based on a virtual file system in a KUBERNETES user-mode application which is applied to a target file system includes a network file system including a network file system server and a network file system client, a user-mode application mounted on a shared directory exposed by the network file system server through the network file system client, and a virtual file system including a virtual file system client and a virtual file system server.

Abstract: The present invention relates to fields of clinical application of nerve defect repair and the medical three-dimensional (3D) printing technology, and provides an integrated visualization method for three-dimensional (3D) reconstruction of internal structure of human peripheral nerves. The method comprises the following steps: obtaining human peripheral nerves, preparing nerve specimens ex vivo by staining with an iodine preparation in combination with a freeze-drying method; scanning the pretreated peripheral nerves using Micro CT to acquire lossless two-dimensional images, and performing binarization processing to the two-dimensional images, then conducting image segmentation based on textural features to acquire images of nerve fascicles; finally, reconstructing the segmented images into a visualization model by using a supercomputer.

Abstract: The present invention relates to fields of clinical application of nerve defect repair and the medical three-dimensional (3D) printing technology, and provides an integrated visualization method for three-dimensional (3D) reconstruction of internal structure of human peripheral nerves. The method comprises the following steps: obtaining human peripheral nerves, preparing nerve specimens ex vivo by staining with an iodine preparation in combination with a freeze-drying method; scanning the pretreated peripheral nerves using Micro CT to acquire lossless two-dimensional images, and performing binarization processing to the two-dimensional images, then conducting image segmentation based on textural features to acquire images of nerve fascicles; finally, reconstructing the segmented images into a visualization model by using a supercomputer.