File processing method and system, storage medium and electronic equipment
By using Redis locks to lock the keys in the key-value store of the enterprise's online document processing system, the problems of duplication and inconsistency in archived document data were solved, the atomicity and consistency of archived document data were achieved, and the system's document archiving capabilities were improved.
Patent Information
- Application Number
- CN202511724252.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-23
- Publication Date
- 2026-02-17
AI Technical Summary
In an enterprise's online document processing system, when multiple document administrators simultaneously perform archiving operations on the same document, data duplication and inconsistency are likely to occur.
The Redis locking mechanism is used to lock the keys in the key-value store and set the lock expiration time to ensure that the file information splicing and archiving operations are completed before the lock is released or expires. Redis locks are used to replace traditional database transaction locks or file locks to achieve concurrency control.
It solves the problems of duplication and inconsistency in archived data, ensures the atomicity and consistency of archived data, avoids performance degradation in high-concurrency scenarios and the risk of single point of failure in centralized lock services, and improves the system's archived capabilities.
Smart Images
Figure CN121542220A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of data processing technology, and more specifically, to a method, system, storage medium, and electronic device for file processing. Background Technology
[0002] The organizational structure of a certain company's online archive processing system consists of headquarters, provincial, municipal, and county-level agencies. Each agency needs to archive the archives it generates, which involves operations such as affixing an archive stamp and boxing.
[0003] In this online archive processing system, when multiple archivists from a certain organization simultaneously perform archiving operations on the same archive, there may be issues of duplicate or inconsistent archived data.
[0004] Therefore, how to solve the problem of duplicate and inconsistent archival data in archival scenarios is an urgent problem that this application needs to solve. Summary of the Invention
[0005] In view of this, this application discloses a method, system, storage medium and electronic device for processing archives, which aims to solve the problem of duplication and inconsistency of archived data in online archive processing systems.
[0006] To achieve the above objectives, the disclosed technical solution is as follows:
[0007] The first aspect of this application discloses a method for processing documents, the method comprising:
[0008] Get the latest file information for the files to be processed;
[0009] If the latest file information has not been updated, the key in the latest file information is concatenated according to the preset concatenation structure;
[0010] Lock the key in the key-value store Redis and set an expiration time for the lock;
[0011] If the lock is not released or the lock expires, obtain the box information under the preset splicing structure;
[0012] The archive stamp information is determined based on the box information;
[0013] The archive stamp information is affixed to the file to be processed, and the file is placed in the position corresponding to the box number to complete the file archiving operation.
[0014] Preferably, if the latest file information has not been updated, the key in the latest file information is concatenated according to a preset concatenation structure, including:
[0015] If the latest archive information has not been updated, obtain the archival number that has been assigned to the archival group;
[0016] The key in the latest archive information is concatenated based on the record number.
[0017] Preferably, if the lock is not released or within the lock's expiration period, obtaining the box information under the preset splicing structure includes:
[0018] If the lock is not released or the lock expires, obtain the annual information and retention period of the file to be processed;
[0019] The box information under the archival data is obtained based on the annual information and the storage period.
[0020] Preferably, determining the archiving stamp information based on the box information includes:
[0021] Calculate the box number and item number based on the box information;
[0022] Assemble the archive stamp information based on the box number and the item number.
[0023] Preferred options also include:
[0024] If the latest archive information is being updated, the update operation is prohibited, and the archiving operation should continue based on the latest archive information.
[0025] Preferably, after affixing the archiving stamp information to the file to be processed and placing the file into the position corresponding to the box number to complete the file archiving operation, the method further includes:
[0026] Release the lock for the corresponding key in the key-value store.
[0027] A second aspect of this application discloses a document processing system, the system comprising:
[0028] The first acquisition unit is used to acquire the latest file information of the file to be processed.
[0029] The splicing unit is used to splice the keys in the latest file information according to a preset splicing structure if the latest file information has not been updated.
[0030] A locking setting unit is used to lock the key in the key-value store Redis and set the lock expiration time;
[0031] The second acquisition unit is used to acquire the box information under the preset splicing structure if the lock is not released or within the lock's expiration time.
[0032] The determining unit is used to determine the archive stamp information based on the box information;
[0033] The archiving unit is used to affix the archiving stamp information to the file to be processed and put the file into the position corresponding to the box number to complete the file archiving operation.
[0034] Preferably, the splicing unit includes:
[0035] The allocation module is used to obtain the archival number that has been allocated to the archival group if the latest archive information has not been updated.
[0036] The splicing module is used to splice the keys in the latest archive information according to the archival group number.
[0037] A third aspect of this application discloses a storage medium including storage instructions, wherein, when the instructions are executed, the device on which the storage medium is located is controlled to perform the file processing method as described in any one of the first aspects.
[0038] The fourth aspect of this application discloses an electronic device including a memory and one or more instructions, wherein one or more instructions are stored in the memory and configured to be executed by one or more processors using the file processing method as described in any of the first aspects.
[0039] As can be seen from the above technical solution, this application discloses a method, system, storage medium, and electronic device for archiving. It obtains the latest archival information of the archive to be processed. If the latest archival information has not been updated, it concatenates the keys in the latest archival information according to a preset concatenation structure, locks the keys in the key-value store, and sets a lock expiration time. If the lock is not released or expires within the lock's expiration time, it obtains the box information under the preset concatenation structure, determines the archiving stamp information based on the box information, affixes the archiving stamp information to the archive to be processed, and places the archive into the position corresponding to the box number to complete the archiving operation. Through this solution, locking the keys in the key-value store Redis and using Redis locks to achieve concurrent control of the archiving operation solves the problem of duplicate and inconsistent archival data in online archival processing systems, thereby ensuring the atomicity and consistency of archival data. Furthermore, using Redis locks to replace traditional database transaction locks or file locks avoids performance degradation in high-concurrency scenarios, eliminates the single point of failure risk of centralized lock services, and improves the system's archiving capabilities. Attached Figure Description
[0040] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.
[0041] Figure 1 This is a schematic flowchart of a file processing method disclosed in an embodiment of this application;
[0042] Figure 2 This is a schematic diagram illustrating the process of concatenating keys in the latest file information as disclosed in an embodiment of this application;
[0043] Figure 3 This is a schematic diagram illustrating the process of locking a key and setting a lock expiration time in the key-value store Redis as disclosed in an embodiment of this application;
[0044] Figure 4 This is a schematic diagram of the structure of a file processing system disclosed in an embodiment of this application;
[0045] Figure 5 This is a schematic diagram of the structure of the electronic device disclosed in the embodiments of this application. Detailed Implementation
[0046] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.
[0047] In this application, the terms "comprising," "including," or any other variations thereof are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.
[0048] As can be seen from the background technology, in an online archive processing system, when multiple archivists of an organization simultaneously perform archiving operations on the same archive, there may be problems of duplicate and inconsistent archived data.
[0049] To address the aforementioned issues, this application discloses a file processing method. The method involves obtaining the latest file information of the file to be processed. If the latest file information has not been updated, the key in the latest file information is concatenated according to a preset concatenation structure. The key is locked in the key-value store, and a lock expiration time is set. If the lock is not released or expires within the lock's expiration time, the box information under the preset concatenation structure is obtained. Based on the box information, the archiving stamp information is determined, the archive stamp information is affixed to the file to be processed, and the file is placed into the position corresponding to the box number to complete the file archiving operation. This scheme locks the key in the key-value store Redis, achieving concurrent control of the file archiving operation. This solves the problem of duplicate and inconsistent archived data in online file processing systems, thereby ensuring the atomicity and consistency of archived data. Furthermore, using Redis locks instead of traditional database transaction locks or file locks avoids performance degradation in high-concurrency scenarios and eliminates the single point of failure risk of centralized lock services, improving the system's file archiving capabilities. Specific implementation methods are described in detail in the following embodiments.
[0050] It should be noted that the document processing method, system, storage medium and electronic device provided in this application can be used in the fields of data processing, document management and other technical fields. The above is only an example and does not limit the application field of the document processing method, system, storage medium and electronic device provided in this application.
[0051] refer to Figure 1 The image shows a file processing method disclosed in an embodiment of this application. The file processing method mainly includes the following steps:
[0052] S101: Obtain the latest file information for the file to be processed.
[0053] Among them, files pending processing refer to files that have not yet been archived.
[0054] Archives refer to original records of various forms that have preservation value, formed during various social activities.
[0055] Archival information includes, but is not limited to, information such as year and retention period.
[0056] To determine whether the latest archival information has been updated, specific information such as the year and date of the archival information can be used.
[0057] S102: If the latest file information has not been updated, the keys in the latest file information are concatenated according to the preset concatenation structure.
[0058] The preset concatenation structure includes, but is not limited to, redisson_key_archive number. In this application, the preset concatenation structure takes precedence over redisson_key_archive number.
[0059] An archival collection refers to an organic whole of archives formed by an independent institution, organization, or individual in social activities.
[0060] Specifically, if the latest file information has not been updated, the process involves concatenating the keys in the latest file information according to the preset concatenation structure, such as... Figure 2 As shown, the main steps include the following:
[0061] S201: If the latest archive information has not been updated, obtain the archival number that has been assigned to the archival group, and get the redisson_key_archival number.
[0062] S202: Concatenate the keys in the latest archive information based on redisson_key_archive number.
[0063] In this embodiment, the archival group number refers to the code assigned to each archival group. Archival group numbers can use a combination of numbers and letters, with a clear structure and adhering to the principle of uniqueness, enabling rapid location and retrieval. For example, in a database, the archival record of a specific archival group can be directly located using the archival group number, improving the efficiency of text retrieval. Archival group numbers are usually relatively short, saving storage space compared to long text fields. For example, using a numeric primary key can reduce data redundancy and improve storage efficiency. Furthermore, the archival group number has unique characteristics, avoiding duplicate errors when manually numbering, and automatically verifying data integrity through the database primary key mechanism reduces the probability of conflicts.
[0064] If the latest archive information is being updated, the update operation is prohibited. Continue to archive based on the latest archive information.
[0065] When the latest archive information is being updated, the system automatically locks the original data and prohibits the update operation to ensure data consistency and prevent data from being repeatedly modified, thus avoiding confusion. Automatically locking the old version when information is detected to be being updated reduces the risk of human error and ensures the integrity of the archive content.
[0066] S103: Lock the key in the key-value store Redis and set the lock expiration time.
[0067] Specifically, in the key-value store Redis, the process of locking the key and setting the lock expiration time is as follows: Figure 3 As shown.
[0068] S301: After concatenating the keys in the latest archive information, lock the key in the key-value store Redis.
[0069] S302: When locking a key in the key-value store Redis, set a lock expiration time. Before the key lock is released or expires, archiving operations on other files under this collection are not allowed.
[0070] The lock expiration time can be set according to the actual situation; this application does not impose specific limitations.
[0071] Redis is an open-source, high-performance key-value store system, commonly used as a database, cache, and message broker. It is frequently used in scenarios such as caching, message queues, and distributed locks.
[0072] By setting a lock expiration time, even in the event of network anomalies or other abnormal situations, the lock can be automatically released after the timeout, allowing other nodes to re-apply for the lock, effectively preventing deadlock issues.
[0073] In this embodiment, the lock expiration time uses an automatic expiration mechanism. This mechanism reduces the complexity of manually releasing locks and minimizes resource consumption issues caused by forgetting to release locks or failing to release them. Furthermore, Redis's expiration policy automatically cleans up invalid locks, reducing memory usage and preventing resource leaks caused by unreleased locks.
[0074] S104: If the lock is not released or the lock expires, obtain the box information under the preset splicing structure.
[0075] In S104, if the lock is not released or the lock expires, obtain the annual information and retention period of the file to be processed, and obtain the box information under the archival group based on the annual information and retention period.
[0076] The box information includes the number of boxes and virtual file boxes.
[0077] The number of boxes refers to each file in a box being considered a single item, and each file has a unique item number.
[0078] A virtual file box is a container specifically designed for storing files, documents, and data. In online file processing systems, this virtual container is used for file storage.
[0079] The box information under the collection is obtained based on the year information and retention period of the archive to be processed, and the box number and item number are automatically calculated based on the box information under the collection. For example, if there is no box information under the year and retention period, the first box is automatically created with box number 1, and the archive is assigned item number 1.
[0080] If there are already boxes for the current year and retention period and the latest box is not full, the box number remains unchanged, the item number is automatically incremented by 1, and the item number is assigned to the file.
[0081] If there is already a box for the current year and retention period, but the latest box is full, a new box will be created automatically, i.e., box number +1, and the file will be assigned the item number 1.
[0082] S105: Determine the archive stamp information based on the box information.
[0083] In S105, the box number and part number are calculated based on the box information, and the archiving stamp information is assembled based on the box number and part number.
[0084] S106: Affix the archiving stamp to the file to be processed and place the file into the position corresponding to the box number to complete the file archiving operation.
[0085] By using Redis locks to implement concurrent control of archive archiving operations, the problem of duplicate and inconsistent archive data in online archive processing systems is solved, thereby ensuring the atomicity and consistency of archive data.
[0086] Archiving stamp information refers to the stamp affixed to archived documents to identify relevant information about the archived documents. The structure includes the archiving group, department, year, retention period, box number, and item number.
[0087] After affixing the archiving stamp to the file to be processed and placing the file into the position corresponding to the box number to complete the file archiving operation, the lock of the corresponding key is released in the key-value store Redis.
[0088] With a pre-defined lock timeout mechanism, Redis automatically releases the lock when the client holding the lock is unable to release it due to a failure, preventing deadlocks. This lock release mechanism, combined with the atomicity of distributed locks, ensures mutual exclusion of data modifications, avoiding concurrent modification conflicts.
[0089] This application aims to solve the problem of duplicate processing of archived data in online archival processing systems, ensuring the atomicity and consistency of archived data, and providing technical support for online archival management. This application solves the problem of duplicate processing of archived data in online archival processing systems by using Redis locks, ensuring the atomicity and consistency of archived data. Furthermore, it introduces Redis locks into the field of archival management, using Redis locks to replace traditional database transaction locks or file locks, avoiding performance degradation in high-concurrency scenarios, eliminating the single point of failure risk of centralized lock services, and improving the system's archival capabilities.
[0090] This application utilizes Redis locks to implement concurrency control for archive archiving operations, resolving the issue of duplicate processing of archived data in online archive processing systems and ensuring the atomicity and consistency of archived data. In the field of archive management, it abandons the traditional approach of relying on database transaction locks or file locks for concurrency control, avoiding the performance degradation that database locks may cause in high-concurrency scenarios and the single point of failure risk of centralized lock services. By leveraging the resource control capabilities of Redis locks in high-concurrency scenarios, it enhances the system's archive archiving capabilities.
[0091] In this embodiment, the latest file information of the file to be processed is obtained. If the latest file information has not been updated, the key in the latest file information is concatenated according to a preset concatenation structure. The key is locked in the key-value store, and a lock expiration time is set. If the lock is not released or within the lock expiration time, the box information under the preset concatenation structure is obtained. The archiving stamp information is determined according to the box information, the archiving stamp information is affixed to the file to be processed, and the file is placed in the position corresponding to the box number to complete the file archiving operation. Through the above scheme, the key is locked in the key-value store Redis. The concurrency control of the file archiving operation is realized through Redis locks, which solves the problem of duplication and inconsistency of file archiving data in the online file processing system, thereby ensuring the atomicity and consistency of file archiving data. In addition, using Redis locks to replace traditional database transaction locks or file locks avoids the performance degradation problem in high-concurrency scenarios, while eliminating the single point of failure risk of centralized lock services and improving the system's file archiving capabilities.
[0092] Based on the above embodiments Figure 1 The present application discloses a method for processing archives, and also provides an archive processing system in its embodiments, such as... Figure 4 As shown, the document processing system includes:
[0093] The first acquisition unit 401 is used to acquire the latest file information of the file to be processed;
[0094] The splicing unit 402 is used to splice the keys in the latest file information according to the preset splicing structure if the latest file information has not been updated.
[0095] Setting unit 403 is used to lock a key in the key-value store Redis and set the lock expiration time;
[0096] The second acquisition unit 404 is used to acquire box information under the preset splicing structure if the lock is not released or within the lock's expiration time.
[0097] Unit 405 is used to determine the archive stamp information based on the box information;
[0098] The archiving unit 406 is used to affix an archiving stamp to the archives to be processed and to place the archives into the position corresponding to the box number to complete the archive archiving operation.
[0099] Furthermore, the splicing unit 402 includes:
[0100] The allocation module is used to retrieve the archival group number that has been assigned to the archival group if the latest archive information has not been updated.
[0101] The splicing module is used to splice the keys in the latest archive information based on the record number.
[0102] Furthermore, the second acquisition unit 404 includes:
[0103] The first acquisition module is used to acquire the annual information and retention period of the file to be processed if the lock is not released or if the lock has expired.
[0104] The second acquisition module is used to obtain box information under the archival collection based on annual information and retention period.
[0105] Furthermore, the defining unit 405 includes:
[0106] The calculation module is used to calculate the box number and part number based on the box information;
[0107] The assembly module is used to assemble archive stamp information based on the box number and part number.
[0108] Furthermore, the record processing system also includes:
[0109] The mutual exclusion unit is used to prevent the update operation if the latest file information is being updated, while the archiving unit continues to perform archiving operations based on the latest file information.
[0110] Furthermore, the record processing system also includes:
[0111] The release unit is used to release the lock of the corresponding key in the key-value store.
[0112] In this embodiment, the latest file information of the file to be processed is obtained. If the latest file information has not been updated, the key in the latest file information is concatenated according to a preset concatenation structure. The key is locked in the key-value store, and a lock expiration time is set. If the lock is not released or within the lock expiration time, the box information under the preset concatenation structure is obtained. The archiving stamp information is determined according to the box information, the archiving stamp information is affixed to the file to be processed, and the file is placed in the position corresponding to the box number to complete the file archiving operation. Through the above scheme, the key is locked in the key-value store Redis. The concurrency control of the file archiving operation is realized through Redis locks, which solves the problem of duplication and inconsistency of file archiving data in the online file processing system, thereby ensuring the atomicity and consistency of file archiving data. In addition, using Redis locks to replace traditional database transaction locks or file locks avoids the performance degradation problem in high-concurrency scenarios, while eliminating the single point of failure risk of centralized lock services and improving the system's file archiving capabilities.
[0113] This application embodiment also provides a storage medium, the storage medium including storage instructions, wherein, when the instructions are executed, the device where the storage medium is located is controlled to perform the file processing method as described above, including:
[0114] Get the latest file information for the files to be processed;
[0115] If the latest file information has not been updated, the keys in the latest file information are concatenated according to the preset concatenation structure;
[0116] In the key-value store Redis, lock the key and set the lock expiration time;
[0117] If the lock is not released or the lock expires, obtain the box information under the preset splicing structure;
[0118] Determine the archive stamp information based on the box information;
[0119] The archived documents are stamped with the aforementioned archiving stamp information and then placed into the location corresponding to the specified box number to complete the archive archiving operation.
[0120] If the latest file information has not been updated, the keys in the latest file information are concatenated according to the preset concatenation structure, including:
[0121] If the latest archive information has not been updated, obtain the archival number that has been assigned to the archival group;
[0122] The key in the latest archive information is concatenated based on the record number.
[0123] If the lock is not released or the lock expires, obtain the box information under the preset splicing structure, including:
[0124] If the lock is not released or the lock expires, obtain the annual information and retention period of the file to be processed;
[0125] The box information under the archival data is obtained based on the annual information and the storage period.
[0126] The archive stamp information is determined based on the box information, including:
[0127] Calculate the box number and item number based on the box information;
[0128] Assemble the archive stamp information based on the box number and part number.
[0129] If the latest archive information is being updated, the update operation is prohibited. Continue to archive based on the latest archive information.
[0130] After affixing the archiving stamp to the file to be processed and placing the file into the position corresponding to the box number to complete the file archiving operation, the process also includes:
[0131] Release the lock for the corresponding key in the key-value store.
[0132] This application also provides an electronic device, the structural schematic diagram of which is shown below. Figure 5 As shown, it specifically includes a memory 501 and one or more instructions 502, wherein one or more instructions 502 are stored in the memory 501 and configured to be executed by one or more processors 503 to perform the above-described file processing method.
[0133] For the foregoing method embodiments, in order to simplify the description, they are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, because according to this application, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to this application.
[0134] It should be noted that the various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For system-type embodiments, since they are basically similar to method embodiments, the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.
[0135] The steps in the methods of the various embodiments of this application can be adjusted, combined, or deleted according to actual needs.
[0136] Finally, it should be noted that in this paper, relational terms such as first and second are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations.
[0137] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
[0138] The above description is only a preferred embodiment of this application. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of this application, and these improvements and modifications should also be considered within the scope of protection of this application.
Claims
1. An archival processing method characterized by, The method comprises: acquiring the latest archive information of an archive to be processed; if the latest archive information is not updated, splicing the key in the latest archive information according to a preset splicing structure; locking the key in a key-value storage redis and setting a lock expiration time; if the lock is not released or within the lock expiration time, acquiring the box information under the preset splicing structure; determining the archiving chapter information according to the box information; stamping the archiving chapter information on the archive to be processed and storing the archive in the position corresponding to the box number to complete the archive archiving operation.
2. The method of claim 1, wherein, If the latest archive information is not updated, the splicing of the key in the latest archive information according to the preset splicing structure comprises: if the latest archive information is not updated, acquiring the fond number that has been allocated to the fond; splicing the key in the latest archive information according to the fond number.
3. The method of claim 2, wherein, If the lock is not released or within the lock expiration time, the acquisition of the box information under the preset splicing structure comprises: if the lock is not released or within the lock expiration time, acquiring the annual information and the storage period of the archive to be processed; acquiring the box information under the fond according to the annual information and the storage period.
4. The method of claim 1, wherein, The determination of the archiving chapter information according to the box information comprises: calculating the box number and the piece number according to the box information; assembling the archiving chapter information according to the box number and the piece number.
5. The method of claim 1, wherein, Further comprising: if the latest archive information is being updated, prohibiting the update operation and continuing the archiving operation according to the latest archive information.
6. The method of claim 1, wherein, After the stamping of the archiving chapter information on the archive to be processed and the storing of the archive in the position corresponding to the box number to complete the archive archiving operation, further comprising: releasing the lock of the corresponding key in the key-value storage.
7. An archival processing system characterized by, The system comprises: a first acquisition unit configured to acquire the latest archive information of an archive to be processed; a splicing unit configured to splice the key in the latest archive information according to a preset splicing structure if the latest archive information is not updated; a locking and setting unit configured to lock the key in a key-value storage redis and set a lock expiration time; a second acquisition unit configured to acquire the box information under the preset splicing structure if the lock is not released or within the lock expiration time; a determination unit configured to determine the archiving chapter information according to the box information; an archiving unit configured to stamp the archiving chapter information on the archive to be processed and store the archive in the position corresponding to the box number to complete the archive archiving operation.
8. The system of claim 7, wherein, The splicing unit comprises: an allocation module configured to acquire the fond number that has been allocated to the fond if the latest archive information is not updated; a splicing module configured to splice the key in the latest archive information according to the fond number.
9. A storage medium, characterized by The storage medium comprises stored instructions, wherein the instructions, when executed, control the device where the storage medium is located to perform the archive processing method according to any one of claims 1 to 6.
10. An electronic device, comprising: The storage medium comprises a memory and one or more instructions, wherein the one or more instructions are stored in the memory and are configured to be executed by one or more processors to perform the archive processing method according to any one of claims 1 to 6.