Data repeated storage solving method and device, equipment, medium and product
By generating task unique codes to identify and avoid duplicate data in the database, it solves the problem of data duplication and redundancy in business systems under high concurrency, and achieves uniqueness and efficient processing of data.
Patent Information
- Application Number
- CN202411361537.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-27
- Publication Date
- 2025-01-21
AI Technical Summary
Due to the many users, many processes and high concurrency, the business system cannot identify duplicate data through the database self-increasing sequence, resulting in duplicate redundant data in the process processing process.
Determine whether the same task request exists in the database by generating a task unique code. If it exists, it will feedback that the target task is being processed. Otherwise, the task code will be generated and stored in the database to ensure data uniqueness.
Effectively avoid the processing data requested by the same task in the database, solve the problem of repeated data storage, and improve the uniqueness and processing efficiency of the data.
Smart Images
Figure CN119336738A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of communication business process management, and in particular to a method, device, equipment, medium and product for solving the problem of duplicate data storage. Background Art
[0002] With the growing development of the communications industry, huge amounts of data, complex work processes, and brain-burning logical data require a set of efficient and accurate business processes for accounting and recording. At the same time, various business processes have also been extended, such as fault handling, complaint handling, security task handling, daily workflows, pay-per-time fees, maintenance fees, expense accounting processes, etc. The business process involves the linkage of various positions, and the data of each department must be accurate in order to obtain the final accurate records and efficient accounting.
[0003] Currently, various business processes are developed through process engines, and the unified means of the existing process engines to the outside world is to provide external request interfaces. Due to the large number of users and processes, the business system has a high concurrency per second. High concurrency will add multiple identical data to the database. The business system cannot identify duplicate data through the database auto-increment sequence, resulting in duplicate and redundant data in the process processing link. Summary of the invention
[0004] The present application provides a method, device, equipment, medium and product for duplicate data storage, which solves the problem that due to the large number of users and processes, the business system has a high concurrency per second. The high concurrency will add multiple identical data to the database, and the business system cannot identify the duplicate data through the database auto-increment sequence, resulting in duplicate and redundant data in the process processing link.
[0005] This application provides a solution to duplicate data storage, including: In response to a task request initiated by a user at the front desk of the business system for a target task of any business process, a task unique code is generated according to the task request; Determine whether the same task unique code exists in the database of the business system; if so, provide feedback to the user that the target task is being processed; otherwise, generate a task code for the target task based on the task unique code and store the task unique code in the database; A labeling operation is performed on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, the link processing data of the target task is stored in the database.
[0006] As an embodiment, the task request includes user information, a user private key, a task number of the target task, and a task request time. Correspondingly, generating a task unique code according to the task request includes: Generate a source code according to the user information, the task number and the task request time; Generate a coding key according to the user private key; The original code is encoded according to the encoding key to obtain the task unique code.
[0007] As an embodiment, the user information includes user account information. Correspondingly, generating the source code according to the user information, the task number and the task request time includes: The character string obtained by concatenating the user account information, the task code and the task request time is used as the original code.
[0008] As an embodiment, encoding the original code according to the encoding key to obtain the task unique code includes: The original code is sorted and encoded according to each key digit of the encoding key to obtain the task unique code.
[0009] As an embodiment, the task request further includes browser information of a user initiating the request and user access version information, and the step of generating the task code of the target task according to the task unique code includes: Generate a request code according to the browser information, the user information and the browser version information; The task code is obtained according to the request code, the task unique code and the random number.
[0010] As an embodiment, after performing a tagging operation on the target task according to the task code so that the business system calls a process engine to process the target task, and storing the link processing data of the target task in the database after the process engine successfully processes the target task, it also includes: A de-labeling operation is performed on the target task.
[0011] The present application also provides a device for resolving data duplication storage, comprising: A first generating module, for responding to a task request initiated by a user at the front desk of the business system for a target task of any business process, and generating a task unique code according to the task request; The second generating module is used to determine whether the same task unique code exists in the database of the business system. If so, feedback is given to the user that the target task is being processed. Otherwise, a task code of the target task is generated according to the task unique code and the task unique code is stored in the database. The storage module is used to perform a labeling operation on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, the link processing data of the target task is stored in the database.
[0012] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, any of the above-mentioned data duplication storage solutions is implemented.
[0013] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements any of the above-mentioned data duplication storage solutions.
[0014] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, any of the above-mentioned data duplicate storage solutions is implemented.
[0015] The data duplication storage solution method, device, equipment, medium and product provided by the present application respond to a task request initiated by a user at the foreground of the business system for a target task of any business process, generate a task unique code according to the task request; determine whether the same task unique code exists in the database of the business system, and if so, feedback to the user that the target task is being processed, otherwise, generate a task code for the target task according to the task unique code and store the task unique code in the database; perform a labeling operation on the target task according to the task code so that the business system calls the process engine to process the target task, and store the link processing data of the target task in the database after the process engine successfully processes it. The present application generates a task unique code through a task request to determine whether the same task request exists in the database, confirm the uniqueness of the task request, avoid processing data of the same task request in the database, and solve the problem of duplicate data storage. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] In order to more clearly illustrate the technical solutions in the present application or the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0017] Figure 1 It is a processing flow diagram of the existing business process.
[0018] Figure 2This is one of the flow charts of the data duplication storage solution provided by this application.
[0019] Figure 3 This is a schematic diagram of the generation process of the unique task code provided by this application.
[0020] Figure 4 It is a schematic diagram of the source code encoding process provided by this application.
[0021] Figure 5 This is a schematic diagram of the task code generation process provided by this application.
[0022] Figure 6 This is the second flow chart of the data duplication storage solution provided by this application.
[0023] Figure 7 This is the third flow chart of the data duplication storage solution provided by this application.
[0024] Figure 8 It is a structural schematic diagram of the data duplication storage solution provided by the present application.
[0025] Fig. 9 It is a structural schematic diagram of the electronic device provided by this application. DETAILED DESCRIPTION
[0026] In order to make the purpose, technical solutions and advantages of this application clearer, the technical solutions in this application will be clearly and completely described below in conjunction with the drawings in this application. Obviously, the described embodiments are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0027] It should be noted that all actions of acquiring signals, information or data in this application are carried out in compliance with the relevant data protection laws and policies of the country where they are located, and with the authorization given by the owner of the corresponding device.
[0028] In order to ensure the daily operation of the communications industry in a medium-sized province, it needs about 40,000 to 60,000 employees. The daily processing of similar process tasks is about 80,000 to 100,000 tasks, each process link has 400,000 to 600,000 items, and a single concurrent task is about 300, which places great demands on concurrency and system response.
[0029] At present, the most commonly used process engines are Puyuan BPS, open source activiti, Oracle's websphereprocess Server, etc. The unified means of the process engine to the outside world is to provide an external request interface. For high-concurrency processing business processes, the business system needs to be called to process them by itself. Different business systems handle concurrency differently, which cannot achieve efficient and unified processing, and the results are also uneven.
[0030] Figure 1 It is a processing flow diagram of the existing business process, such as Figure 1 As shown, the processing flow of the existing business process includes the following steps.
[0031] Step 1: User processes the task: manually fill in the processing link data and submit the task. The business system automatically submits the task after detecting the processing data based on intelligent conditions. After the task is processed based on intelligent means, the user manually submits the task.
[0032] Step 2: Background processing: After receiving the task submitted by the foreground, the background calls the process engine interface to process the process.
[0033] Step 3: Data storage and feedback: If the process engine successfully processes, the processing link data will be stored in the database, and the user will be prompted with the successful processing result; if the process engine fails to process, the user will be prompted with the failed processing result.
[0034] Since there are many people processing business processes, it is possible that multiple people will call the external request interface of the process engine to process the process or perform task quality inspection at the same time. If multiple people call the external request interface to process the same process or perform task quality inspection at the same time, multiple identical data will be added to the database. The front-end service of the business process cannot identify duplicate data through the database auto-increment sequence, resulting in duplicate and redundant data in the process processing link.
[0035] To solve the above technical defects, this application monitors the tasks submitted by the front desk according to the common processing characteristics of the business process, adds a unique label to each request task, ensures the uniqueness of the data corresponding to the request task, and thus avoids duplicate data storage.
[0036] The data duplication storage solution, device, equipment, medium and product provided by the present application are described in detail below in conjunction with the accompanying drawings.
[0037] Figure 2 This is one of the flow charts of the data duplication storage solution provided by this application, such as Figure 2 As shown, the present application provides a solution to duplicate data storage, which is implemented based on a business system and includes steps S100 to S300.
[0038] Step S100, in response to a task request initiated by a user at the front desk of a business system for a target task of any business process, a task unique code is generated according to the task request.
[0039] The business system refers to the system used for business processes such as fault handling, complaint handling, security task handling, daily workflow, pay-per-time, maintenance fees, and expense accounting. The business system front desk refers to the front end of the business system. For example, users (employees) can initiate fault handling task requests in the front end interface of the business system. Task requests include information in preset fields and can be encapsulated in JSON, XML, and other formats and sent to the business system backend.
[0040] It should be noted that the task unique codes corresponding to the same task request are the same.
[0041] Step S200, determine whether there is the same task unique code in the database of the business system, if so, feedback to the user that the target task is being processed and do not repeat the process, otherwise, generate the task code of the target task according to the task unique code and store the task unique code in the database. Optionally, the database is a redis database.
[0042] Step S300, perform a tagging operation on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, store the link processing data of the target task in the database. After the tagging operation is successful, the process engine task processing and business processing operations are performed.
[0043] It can be understood that the present application generates a unique task code through a task request to determine whether there is an identical task request in the database, thereby avoiding processing data of the identical task request in the database and solving the problem of duplicate data storage.
[0044] Figure 3 This is a schematic diagram of the generation process of the unique task code provided by this application, such as Figure 3 As shown, based on the above embodiment, as an optional embodiment, the task request includes user information, user private key, task number of the target task and task request time. Correspondingly, generating a task unique code according to the task request includes the following steps.
[0045] Step S110, generating the original code according to the user information, the task number and the task request time. The user information includes the user account information, which refers to the account information of the target task owner, which can be understood as the employee who handles the target task. The user private key refers to the unique key (at least 8 digits) corresponding to the target task set by each user, and the user private key is used to encode and encrypt the original code. The task number refers to the unique number of the target task in the current processing link, and the task request time refers to the time when the task request is initiated.
[0046] Optionally, generating the original code according to the user information, the task number and the task request time includes: using a string obtained by concatenating the user account information, the task code and the task request time as the original code.
[0047] Suppose the user information of user Zhang San includes zhangsan, the task number is 12, the task request time is XX0813, XX refers to 20XX, and the original code can be expressed as zhangsan12XX0813.
[0048] Step S120, generating a coding key according to the user private key. Specifically, the coding key can be generated according to the user private key and the user information, for example, extracting a certain letter from the pinyin of the name in the user information and converting it into a decimal number, and using the decimal number and the number obtained by adding / subtracting the user private key as the coding key, or generating the coding key after performing an addition / subtraction operation on the number of strokes of the Chinese name in the user information and the user private key.
[0049] Suppose the user's private key is 12345678, the number of strokes of the user Zhang San's surname is 7, and the number of strokes of the last character in his name is 3, the encoding key is calculated as 12345678+7+3=12345688.
[0050] Step S130, encoding the original code according to the encoding key to obtain the task unique code.
[0051] Figure 4 This is a schematic diagram of the original code encoding process provided by this application, such as Figure 4 As shown, optionally, encoding the original code according to the encoding key to obtain the task unique code includes: sorting and encoding the original code according to each key digit of the encoding key to obtain the task unique code.
[0052] The specific rules of sorting and coding refer to that the codes are first bubble sorted from left to right according to the calculated number of keys and placed behind the corresponding number of digits. If the number of digits is insufficient, a random digit is selected from the 26 letters and ranked first. The obtained number is sorted again from right to left, and finally a new set of data is obtained, which is the unique code of the task.
[0053] For the "1" in the ten millionth digit of the coding key 12345688, which is the eighth digit, the value is 1. Then put the n in the eighth digit of the original code from left to right after the first digit of the original code, and get the first evolved intermediate code znhangsa12XX0813. Continuing with the "2" in the millionth digit of the coding key 12345688, which is the seventh digit, the value is 2. Put the s in the seventh digit of the intermediate code znhangsa12XX0813 from left to right after the second digit of the original code, and get the second evolved intermediate code znahangs12XX0813. And so on, evolve from right to left once, and the final task unique code is nhangsa3z12XX081.
[0054] It can be understood that the present application generates a unique task code through user information, user private key, the task number of the target task and the task request time, thereby improving the correlation between the target task and the processing personnel.
[0055] Figure 5 This is a schematic diagram of the task code generation process provided by this application, such as Figure 5 As shown, based on the above embodiment, as an optional embodiment, the task request also includes browser information of the user initiating the request and user access version information, and the task code of the target task is generated according to the task unique code, including the following steps.
[0056] Step S210, generating a request code according to the browser information, the user information and the browser version information. The request code is composed of the browser information, the current user information and the user access version information encrypted or directly concatenated during the access request.
[0057] Step S220, the task code is obtained according to the request code, the task unique code and the random number. The random number is a random code generated by random 3 digits of numbers, letters, special symbols plus year, month and day, and the value is generated after encryption by a private key. The task code can be obtained by splicing the request code, the task unique code and the random number.
[0058] Based on the above embodiment, as an optional embodiment, after performing a labeling operation on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, storing the link processing data of the target task in the database, it also includes: performing a de-labeling operation on the target task.
[0059] Figure 6 This is the second flow chart of the data duplication storage solution provided by this application. Figure 6 As shown, all work order task processing will go through the following steps: customer bill of lading, background business logic processing, calling the process engine to process the workflow, returning the results based on the process engine processing, saving the business and process data to the database for recording, and feeding back the processing results to the customer.
[0060] According to the commonality of process processing, this application automatically monitors task requests before submitting them to the process engine. The task code generator is used to generate task codes, and the task manager is used to tag tasks. After the tag addition operation is successful, the engine task processing and business processing operations are performed. After the operation is completed, the task tag removal operation is automatically performed, and the processing results are returned to the user for display.
[0061] Figure 7 This is the third flow chart of the data duplication storage solution provided by this application. Figure 7 As shown, the present application can be integrated into the business process. When there are multiple concurrent requests for a single task, since the first request task is labeled, when other requests occur, it will be prompted that it has been protected by a unique label, thereby protecting the first request task processing process. After waiting for the entire first processing process to be completed, the task label status is released and the next task is processed. All links are automatically operated in this way, ultimately protecting the completeness and uniqueness of the data.
[0062] In summary, this application effectively solves the problem of storage duplication and redundant data when processing large concurrent process tasks. By using the commonality of the process, the processing tasks are uniformly labeled and managed in a standardized manner; complex processes and business processing are exclusive, and ultimately data processing is independent. The data verification workload of maintenance personnel is greatly reduced, so that data can be unique, and ultimately the data confusion caused by duplicate data is solved, thereby improving user satisfaction. Development is simplified and functions are efficient.
[0063] The data duplicate storage solution device provided in the present application is described below. The data duplicate storage solution device described below and the data duplicate storage solution method described above can be referenced to each other.
[0064] Figure 8is a timing diagram of the data duplication storage solution device provided by the present application, such as Figure 8 As shown, the present application also provides a device for solving data duplication storage, including the following modules.
[0065] The first generating module 810 is used to respond to a task request initiated by a user at the front desk of the business system for a target task of any business process, and generate a task unique code according to the task request; The second generating module 820 is used to determine whether the same task unique code exists in the database of the business system. If so, feedback is given to the user that the target task is being processed. Otherwise, a task code of the target task is generated according to the task unique code and the task unique code is stored in the database. The storage module 830 is used to perform a labeling operation on the target task according to the task code so that the business system calls the process engine to process the target task, and stores the link processing data of the target task in the database after the process engine successfully processes it.
[0066] As an embodiment, the task request includes user information, a user private key, a task number of the target task, and a task request time. Correspondingly, the first generating module 810 is further used to: Generate a source code according to the user information, the task number and the task request time; Generate a coding key according to the user private key; The original code is encoded according to the encoding key to obtain the task unique code.
[0067] As an embodiment, the user information includes user account information. Accordingly, the first generating module 810 is further used to: The character string obtained by concatenating the user account information, the task code and the task request time is used as the original code.
[0068] As an embodiment, the first generating module 810 is further configured to: The original code is sorted and encoded according to each key digit of the encoding key to obtain the task unique code.
[0069] As an embodiment, the task request further includes browser information of the user initiating the request and user access version information, and the second generating module 820 is further used to: Generate a request code according to the browser information, the user information and the browser version information; The task code is obtained according to the request code, the task unique code and the random number.
[0070] As an embodiment, it also includes: The de-labeling module is used to perform a de-labeling operation on the target task.
[0071] It should be noted that the data duplication storage solution device provided in the present application can execute the data duplication storage solution method described in any of the above embodiments during specific operation, and has the technical effect corresponding to the method, which will not be elaborated in this embodiment.
[0072] Fig. 9 An example of a physical structure diagram of an electronic device is shown in FIG. Fig. 9 As shown, the electronic device may include: a processor 910, a communication interface 920, a memory 930 and a communication bus 940, wherein the processor 910, the communication interface 920 and the memory 930 communicate with each other through the communication bus 940. The processor 910 may call the logic instructions in the memory 930 to execute a solution to duplicate data storage, the method comprising: in response to a task request initiated by a user at the front desk of the business system for a target task of any business process, generating a task unique code according to the task request; determining whether there is the same task unique code in the database of the business system, if so, feeding back to the user that the target task is being processed, otherwise, generating a task code for the target task according to the task unique code and storing the task unique code in the database; performing a tagging operation on the target task according to the task code so that the business system calls the process engine to process the target task, and storing the link processing data of the target task in the database after the process engine successfully processes.
[0073] In addition, the logic instructions in the above-mentioned memory 930 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.
[0074] On the other hand, the present application also provides a computer program product, which includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the data duplication storage solution provided by the above-mentioned methods, and the method includes: responding to a task request initiated by a user at the front desk of a business system for a target task of any business process, generating a task unique code according to the task request; determining whether the same task unique code exists in the database of the business system, and if so, providing feedback to the user that the target task is being processed, otherwise, generating a task code for the target task according to the task unique code and storing the task unique code in the database; performing a labeling operation on the target task according to the task code so that the business system calls a process engine to process the target task, and storing the link processing data of the target task in the database after the process engine successfully processes it.
[0075] On the other hand, the present application also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the data duplication storage solution provided by the above-mentioned methods, the method comprising: responding to a task request initiated by a user at the front desk of a business system for a target task of any business process, generating a task unique code according to the task request; determining whether the same task unique code exists in the database of the business system, and if so, providing feedback to the user that the target task is being processed, otherwise, generating a task code for the target task according to the task unique code and storing the task unique code in the database; performing a labeling operation on the target task according to the task code so that the business system calls a process engine to process the target task, and storing the link processing data of the target task in the database after the process engine successfully processes it.
[0076] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.
[0077] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0078] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit it. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.
Claims
1. A method for solving data duplication storage problem, characterized in that: include: In response to a task request initiated by a user at the front desk of the business system for a target task of any business process, a task unique code is generated according to the task request; Determine whether the same task unique code exists in the database of the business system; if so, provide feedback to the user that the target task is being processed; otherwise, generate a task code for the target task based on the task unique code and store the task unique code in the database; A labeling operation is performed on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, the link processing data of the target task is stored in the database.
2. The data duplication storage solution according to claim 1, characterized in that: The task request includes user information, a user private key, a task number of the target task, and a task request time. Correspondingly, generating a task unique code according to the task request includes: Generate a source code according to the user information, the task number and the task request time; Generate a coding key according to the user private key; The original code is encoded according to the encoding key to obtain the task unique code.
3. The data duplication storage solution according to claim 2, characterized in that: The user information includes user account information. Correspondingly, the generating of the source code according to the user information, the task number and the task request time includes: The character string obtained by concatenating the user account information, the task code and the task request time is used as the original code.
4. The data duplication storage solution according to claim 2 or 3, characterized in that: The encoding of the original code according to the encoding key to obtain the task unique code includes: The original code is sorted and encoded according to each key digit of the encoding key to obtain the task unique code.
5. The method for solving the data duplication storage problem according to claim 2 or 3, characterized in that: The task request also includes browser information of the user initiating the request and user access version information. The generating of the task code of the target task according to the task unique code includes: Generate a request code according to the browser information, the user information and the browser version information; The task code is obtained according to the request code, the task unique code and the random number.
6. The data duplication storage solution according to claim 1, characterized in that: After performing a tagging operation on the target task according to the task code so that the business system calls the process engine to process the target task, and storing the link processing data of the target task in the database after the process engine successfully processes the target task, the process further includes: A de-labeling operation is performed on the target task.
7. A device for solving data duplication storage, characterized in that: include: A first generating module, for responding to a task request initiated by a user at the front desk of the business system for a target task of any business process, and generating a task unique code according to the task request; The second generating module is used to determine whether the same task unique code exists in the database of the business system. If so, feedback is given to the user that the target task is being processed. Otherwise, a task code of the target task is generated according to the task unique code and the task unique code is stored in the database. The storage module is used to perform a labeling operation on the target task according to the task code so that the business system calls the process engine to process the target task, and after the process engine successfully processes the target task, the link processing data of the target task is stored in the database.
8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the data duplication storage solution according to any one of claims 1 to 6 is implemented.
9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the data duplication storage solution according to any one of claims 1 to 6 is implemented.
10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the data duplication storage solution according to any one of claims 1 to 6 is implemented.