13 results about "Hard link" patented technology

The invention relates to a method, a device and a computer program product for deduplication. The method includes obtaining a plurality of mirror image files, wherein each of the plurality of mirror image files includes at least one layer. The method further includes generating a directory by de-duplicating the plurality of layers of the plurality of mirror image files. The method also includes redirecting the plurality of de-duplicated mirror image files to a directory using a hard link. The method further includes packaging the plurality of redirected mirror image files and directories into a target package. By means of the method, duplicate removal can be conducted on the multiple mirror image files with the layer as the unit, and the flexibility of downloading part of the mirror image files in the multiple mirror image files can be guaranteed.

The invention relates to the technical field of program updating, and discloses a method for updating an application program, which comprises the following steps: creating a temporary backup directory and a decompression directory; processing an original file of the application program and a to-be-installed new-version patch file by utilizing a hard link technology; wherein the new version patch file comprises a plurality of patch formats; the original file of the application program is replaced with the new version patch file through atomization operation, so that application program updating is achieved. According to the method, rapid backup and recovery are realized through a hard link technology, and the updating time is greatly shortened. The atomization operation guarantees the completeness and consistency of the updating process, and avoids the problems caused by partial updating residues. Therefore, the application program updating efficiency is improved, the application program updating stability and safety are enhanced, and better use experience is provided for users. The invention further discloses a device for updating the application program and electronic equipment.

The invention relates to the technical field of computer software, in particular to a course resource increment downloading method and system based on Unity AssetBundle, and the method comprises the steps: constructing, analyzing and referencing dependency through a resource packet topology to generate AssetBundle with a version identifier; the increment configuration file manages and associates a course ID and an AssetBundle path and marks a necessary / increment resource type; a scene triggers and downloads a response course selection layer / chapter entering layer / experiment interaction layer behavior, a necessary resource bundle is forcibly updated, and an incremental resource bundle is triggered by a user as required by providing UGUI interface elements; according to block difference updating, a resource packet is divided into 512 KB blocks to verify differences, and only server-side identification blocks are downloaded; the resource isolated storage creates a sandbox directory and generates a disk hard link. The hierarchical loading efficiency is substantially improved, the incremental transmission flow is declined, the multi-course conflict is thoroughly eradicated, and the storage reuse rate is multiplied in magnitude.

The application relates to an application processing method and device, electronic equipment, a storage medium and a program product, and belongs to the technical field of computers. The method comprises the following steps: in response to an application installation operation, obtaining a first dynamic link library in an installation package of an application to be installed and an installation path of the first dynamic link library under an application directory of the application to be installed; querying whether information of the first dynamic link library exists in a dynamic link library information table; if the information of the first dynamic link library exists in the dynamic link library information table, establishing a hard link from the installation path to a storage path of the first dynamic link library for the first dynamic link library; if the information of the first dynamic link library does not exist in the dynamic link library information table, copying the first dynamic link library to the installation path, and adding a mapping relationship between the first dynamic link library and the storage path in the dynamic link library information table. The application can reduce the memory and storage space.

This invention discloses a semantic tracing and lazy reclamation method for orphan files in a distributed file system, belonging to the field of distributed file system technology. This method persists directory entry change operations through full-link logging and establishes an independent operation log index for each inode. It monitors changes in the inode hard link count in real time, marks files to be classified as orphan files when the hard link count reaches zero, and triggers the semantic tracing process. It traces back the file's entire lifecycle relationships to complete the classification, matches the corresponding hierarchical reclamation strategy based on the classification results, and generates a read-only snapshot before releasing space when the reclamation trigger conditions are met. This method can accurately distinguish different types of orphan files, reduce resource consumption during the reclamation process, avoid accidental deletion of business data, balance storage space reclamation efficiency and data security, and improve the operational stability of the distributed file system.

The application provides an automatic driving software upgrading method and device, a storage medium and a computer device. The method comprises the following steps: obtaining metadata of target version software according to version information of the target version software; obtaining version records of local version software according to version information of the local version software; determining to-be-downloaded files and to-be-copied files based on the metadata and the version records; creating a new storage directory under a system partition; creating a hard link from an original storage directory of each to-be-copied file to the new storage directory according to a file name, a file fingerprint and a relative path of each to-be-copied file; creating a download link according to a file name, a file fingerprint and a storage path of each to-be-downloaded file; and downloading the corresponding to-be-downloaded file to the new storage directory based on the download link of each to-be-downloaded file. The application can save the storage space of the system, save the network resources and computing resources required for downloading, and improve the efficiency of software upgrading of the system partition.

The present disclosure relates to de-duplication. An example method includes acquiring mirror files, wherein each mirror file in the mirror files includes at least one layer. The method further includes generating a directory by de-duplicating layers of the mirror files. The method further includes redirecting the de-duplicated mirror files to the directory by using hard links. The method further includes packaging the redirected mirror files and the directory into a target package. Beneficially, the mirror files can be de-duplicated in a unit of layer, and the flexibility in downloading a part of the mirror files can further be ensured.

This invention relates to the field of distributed file system technology, and discloses a method, apparatus, computer device, and storage medium for selecting new source files. Upon receiving a deletion operation instruction, the invention determines the target file to be deleted based on the instruction. When the target file to be deleted is a source file, the first inode number of the source file is obtained from its directory entries. Based on the first inode number, the first metadata of the source file is obtained. Hard link data for at least one hard link file corresponding to the source file is obtained from the first metadata. Based on each hard link data, the directory entry corresponding to each hard link file is determined. Based on the target entry of each hard link file, it is determined whether there are any hard link files not currently used by the client. When at least one hard link file not currently used by the client exists, a new source file can be selected using different methods. This invention can avoid the problem of business processing failures caused by the inability to select a new source file.

The embodiment of the invention provides a file cloning method and device of a distributed file system and a storage medium. In the file cloning method, a client obtains fragment identifiers of a plurality of source file fragments corresponding to a source file from a source management node, and generates respective fragment identifiers of a plurality of target file fragments according to the fragment identifiers of the plurality of source file fragments. Based on the fragment identifier of the source file fragment and the fragment identifier of the destination file fragment, the client may send a hard link establishment request to the storage cluster. The storage cluster can establish a corresponding relationship between the fragment identifier of the target file fragment and the data block according to the corresponding relationship between the source file fragment and the data block. And the destination management node can create a destination file under the request of the client, establish an association relationship between the destination file and the respective fragment identifiers of the plurality of destination file fragments, and publish the destination file. Furthermore, the cloning of the source file is realized without copying and migrating the data block, and the complexity of file cloning is reduced.

An implementation method and system compatible with file hard link and S3 shallow copy based on distributed key-value pairs, taking file metadata key-value pairs as the metadata storage body of files or directories, the key of which is composed of file system ID, parent directory ID and file or directory name, and the value contains metadata information; a reverse index file handle key-value pair is introduced as a unique invariant identifier, the key of which is composed of file system ID, initial parent directory ID, initial file or directory name N characters and file ID, and the value contains current file metadata key and reference count. When creating and deleting files or directories, they are probably in the same key-value pair node with high probability, supporting one-phase commit to improve performance; at the same time, hard link and S3 shallow copy are implemented, both of which create independent file metadata key-value pairs and reverse index file handle key-value pairs, the file metadata value of which records the reverse index file handle key of the target file, and updates the reference count of the reverse index file handle value of the target file, taking into account performance and compatibility.

The application relates to a metadata sharing method and system for a deletion marker in a union file system, and belongs to the technical field of computers. The method solves the problem of inode resource consumption and inode resource exhaustion risk in the prior art. The method comprises the following steps: initiating a file deletion operation, checking whether a deletion marker file template exists, returning a directory entry of the deletion marker file template if the deletion marker file template exists, creating a temporary deletion marker file, pointing an inode pointer field in a directory entry of the temporary deletion marker file to an inode pointer of the deletion marker file template, establishing a temporary hard link of the temporary deletion marker file to the deletion marker file template, making the temporary deletion marker file inherit the inode of the deletion marker file template, and atomically renaming the temporary deletion marker file to a file name to be deleted and storing the file name to an upper directory of the union file system. The application reduces inode consumption and avoids inode resource exhaustion risk.

The present disclosure provides a processing method and device of an index node, equipment and a storage medium, the method comprising: in response to a preset hard link creation request for a first file, creating a hard link for the first file, and obtaining index node identification information of the first file from a metadata information table of the first file, migrating an index node corresponding to the index node identification information in the metadata information table of the first file to a reverse lookup table, wherein the index node in the reverse lookup table is used to respond to a file access request for the first file. It can be seen that, by migrating the index node corresponding to the index node identification information in the metadata information table of the first file to the reverse lookup table, when a file access request for the first file is received, the index node obtained from the reverse lookup table can be directly accessed, so that the storage location information of the first file carried by the index node is used to access the first file, thereby improving the file access efficiency.

This application provides a data processing method, a block server, a storage medium, and a program product. The method relates to the field of distributed storage and includes: in response to a hard link request for a first data block, obtaining the identification information of the first data block and the identification information of a first linked data block to be linked to the first data block; if the first data block is determined to be a source data block, then, based on the identification information of the first linked data block and the first data block itself, adding a link mapping relationship from the first linked data block to the first data block to a link mapping relationship table; updating the number of links in the metadata of the first data block, where the number of links represents the number of linked data blocks linked to the first data block, thereby implementing a hard link from the first linked data block to the first data block, and thus realizing block-level hardlink functionality.