Low-code data backup method and device, equipment and storage medium

Abstract

The invention provides a low-code data backup method and device, equipment and a storage medium. The method comprises the following steps: acquiring page data in an editing state, and performing page snapshot storage on the page data in the editing state according to a preset duration interval; according to a preset page record storage rule, the page record information is written into different backup queues, and the backup queues have different storage time intervals and operation frequency intervals; and in response to a release request of the page data in the editing state, generating page data in a development state, performing version information marking on the page data in the development state, and storing the page data in the development state according to a sequence of version information. According to the method, on the basis of limiting the storage capacity of the equipment, the snapshot information in the low-code data storage process can be uniformly sampled and collected, the collected data covers the operation record information in different time lengths, dynamic backup is supported, and the working area can be recovered to the collected snapshot data node in the low-code development process.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a low-code data backup method, device, equipment and storage medium. Background Art

[0002] The low-code page development platform enables non-front-end technical personnel to quickly master the ability of front-end page development and break free from the constraints of their front-end specific language limitations. Non-front-end technical personnel can drag out a front-end page through a simple graphical drag-and-drop method. They only need to configure a specific back-end data source interface and write a small amount of event logic to complete the front-end and back-end data interaction involved in page events. For newly created low-code pages, they can be accessed through rendering without the need to re-publish the front-end.

[0003] During the low-code page development process, low-code related page description products will be generated. This type of page description product data needs to be parsed by the low-code engine and then rendered into the corresponding page. This type of page description product data will first be saved in the front-end browser during the development process, and only when the background save operation is triggered will it be written to the server background database and overwrite the previous content. In the existing low-code technology, the browser cache is used to record the data in the low-code development process, and the browser cache history is used to roll back and restore to the data state before a certain time node. In a single-machine and fixed browser development environment, this method of using the browser cache can perform normal operation rollback, but because the records during the editing operation are not written to the database, once the machine or browser is restarted, the operation record status in the middle will be lost. The new data generated by each operation cannot be incrementally saved. If only the full amount is saved, there will be problems such as large device storage space occupation and high data redundancy. Summary of the invention

[0004] The present application provides a low-code data backup method, device, equipment and storage medium to solve the technical problems that during the existing low-code data backup, the low-code related page description product data is easily lost and the new data generated by the operation cannot be reasonably saved.

[0005] In a first aspect, the present application provides a low-code data backup method, comprising:

[0006] Acquire the page data in the editing state, save the page snapshot of the page data in the editing state at a preset time interval, and obtain page record information with a timestamp;

[0007] According to a preset page record storage rule, the page record information is written into different backup queues, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval;

[0008] In response to a request to publish the edited page data, the development state page data is generated, the development state page data is marked with version information, and the development state page data is saved in the order of the version information.

[0009] Optionally, in the above method, writing the page record information into different backup queues according to a preset page record storage rule includes:

[0010] Sort the backup queues in descending order according to the save time interval;

[0011] Determining whether the page record information meets the saving time interval requirement and the operation number interval of the first-ranked backup queue according to the timestamp of the page record information;

[0012] If yes, write the page record information into the first-ranked backup queue;

[0013] If not, each backup queue is traversed according to the sorting order, and the page record information is written into the backup queue that meets the preservation time interval requirement.

[0014] Optionally, the method as described above, after traversing each backup queue according to the sorting order, further includes:

[0015] If the page record information does not exist in a backup queue that meets the time interval requirements and the operation number interval, the page record information is discarded.

[0016] Optionally, in the method as described above, the backup queue includes a long-term backup queue, a mid-term backup queue and a short-term backup queue, the long-term backup queue has a first time interval for saving, the mid-term backup queue has a second time interval for saving, and the short-term backup queue has a third time interval for saving, and the page record information is written into different backup queues according to a preset page record storage rule, including:

[0017] Calculate a first time interval between the page record information and the previous page record information in the long-term backup queue according to the timestamp of the page record information, and determine whether the first time interval is not less than the first duration;

[0018] If yes, write the page record information into the long-term backup queue;

[0019] If not, calculating a second time interval between the page record information and the previous page record information in the mid-term backup queue, and determining whether the second time interval is not less than the second duration;

[0020] If yes, write the page record information into the mid-term backup queue;

[0021] If not, calculating a third time interval between the page record information and the previous page record information in the short-term backup queue, and determining whether the third time interval is not less than the third duration;

[0022] If yes, write the page record information into the short-term backup queue;

[0023] If not, the page record information is discarded.

[0024] Optionally, the method as described above, after marking the version information of the page data in the development state, further comprises:

[0025] Performing functional testing on the page data in the development state;

[0026] Synchronize the development-state page data that has passed the functional test to the production environment to generate production-state page data;

[0027] The development state page data that fails the functional test is returned to the editing state.

[0028] Optionally, the method as described above, after synchronizing the page data of the development state that has passed the test to the production environment to generate the page data of the production state, further includes:

[0029] Performing acceptance testing on the production page data;

[0030] Confirm the production-state page data that has passed the acceptance test as the published data;

[0031] The production state page data that fails the acceptance test is returned to the development state, and rolled back to the previous version of the production state page data.

[0032] Optionally, the method as described above, before generating the page data in the development state, further includes:

[0033] Performing a publishing test on the page data in the editing state;

[0034] The edited page data that has passed the publishing test is confirmed as the published page data.

[0035] In a second aspect, the present application provides a low-code data backup device, including:

[0036] A temporary page data recording module is used to obtain the page data in the editing state, save the page snapshot of the page data in the editing state at a preset time interval, and obtain page record information with a timestamp;

[0037] A temporary page backup module, used to write the page record information into different backup queues according to a preset page record storage rule, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval;

[0038] The publishing page backup module is used to respond to the publishing request of the editing state page data, generate the development state page data, mark the version information of the development state page data, and save the development state page data in the order of the version information.

[0039] In a third aspect, the present application provides an electronic device comprising a memory, a processor, and computer-executable instructions stored in the memory and executable on the processor, wherein when the processor executes the computer-executable instructions, the low-code data backup method described in any one of the first aspects above is implemented.

[0040] In a fourth aspect, the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the low-code data backup method described in any one of the first aspects above.

[0041] In the fifth aspect, the present application provides a computer program product. When the computer program product is running on a terminal device, the terminal device enables the terminal device to execute the low-code data backup method described in any one of the first aspects above.

[0042] The low-code data backup method, device, equipment and storage medium provided in the present application obtain the page data in the editing state, save the page snapshot of the page data in the editing state at a preset time interval, and obtain page record information with a timestamp; according to the preset page record storage rules, the page record information is written into different backup queues, and the backup queues include more than two, each backup queue has a different save time interval and operation number interval; in response to the publishing request of the page data in the editing state, the page data in the development state is generated, the page data in the development state is marked with version information, and the page data in the development state is saved in the order of the version information, and the snapshot information in the low-code data saving process can be uniformly sampled and collected on the basis of limited device storage capacity, and the collected data can cover operation record information within different time lengths, and support dynamic backup, so that the workspace can be restored to the collected snapshot data node during the low-code development process. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0044] Figure 1 A schematic diagram of an application scenario of the low-code data backup method provided in an embodiment of the present application;

[0045] Figure 2 The process of the low-code data backup method provided in the embodiment of the present application Figure 1 ;

[0046] Figure 3 The process of the low-code data backup method provided in the embodiment of the present application Figure 2 ;

[0047] Figure 4 A schematic diagram of a low-code data backup device provided in an embodiment of the present application;

[0048] Figure 5 A schematic diagram of the structure of an electronic device suitable for a low-code data backup method provided in an embodiment of the present application.

[0049] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0050] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0051] In related technologies, browser cache is mainly used to record data during the low-code development process. However, since the records during the editing operation are not written to the database, once the machine or browser is restarted, the operation record status in the middle will be lost. The new data generated by each operation cannot be saved incrementally. If only the full amount is saved, there will be problems such as large device storage space occupation and high data redundancy.

[0052] In response to the above technical problems, the embodiments of the present application aim to propose a low-code data backup method, device, equipment and storage medium. The core concept of the method is: on the basis of limiting the storage capacity of the equipment, uniformly sample and collect and back up snapshot information in the process of low-code data preservation. The collected data can cover the operation record information within different time intervals, and support dynamic adjustment of the backup queue, so that the workspace can be restored to the collected snapshot data node during the low-code development process.

[0053] In order to better understand the solution of the embodiment of the present application, an application scenario involved in the embodiment of the present application is first introduced below.

[0054] See also Figure 1 , Figure 1 A schematic diagram of an application scenario of the low-code data backup method provided in an embodiment of the present application, such as Figure 1 As shown in the figure, low-code page development includes development environment and production environment. First, low-code developers develop low-code pages in the development environment. After the development is completed, the data is synchronized to the production environment. In the development environment, low-code page data includes editing state and publishing state. When low-code developers edit the page, the page is in the editing state. The data generated when editing and saving the page is page snapshot data. This type of data records the temporary states of the page. After the page editing is completed, the page needs to be published and tested. At this time, the page is in the publishing state. After the publishing is completed, the page will generate page data corresponding to a version. The page data corresponding to this version can be used for functional testing and integration testing in the development environment. After the publishing and testing are completed, the page data can be prepared to complete the synchronization work from the development environment to the production environment. When the synchronization work is completed, the page data is in the production state. When the production state page passes the acceptance in the production environment, the corresponding production version information will be generated. The production state data is the real user-oriented page data and is the formally used data. The production state page data cannot be changed directly. It can only be modified and published from the development environment, and then synchronized to the production environment to generate a new production state version. This data status agreement and flow method ensures the stability of low-code page data usage.

[0055] As for the snapshot data of the edited page, it is necessary to back up the data in the limited data storage capacity in combination with the time period information developed by the user. Specifically, it supports data backup according to three strategies: short-term, medium-term, and long-term. That is to say, three queues, long-term, medium-term, and short-term, are used to store low-code page data saved at different time intervals. The size, collection time interval, and collection operation number interval of the three queues are all dynamically configurable. For the published page data, it is stored according to different version information.

[0056] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0057] Figure 2 The process of the low-code data backup method provided in the embodiment of the present application Figure 1 .like Figure 2 As shown, the method of this embodiment includes:

[0058] S201: Acquire page data in an editing state, save page snapshots of the page data in the editing state at preset time intervals, and obtain page record information with a timestamp.

[0059] The executing entity of the embodiment of the present application can be a server, or it can be a low-code data backup system in the server, wherein the low-code data backup system can be implemented through software.

[0060] It is understandable that the editing state refers to the state in which the page is under development and modification. In this state, developers can edit and adjust the content, layout, style and function of the page. In the low-code platform, when a user edits a page, the system will obtain the current page data in real time, including layout, content, style and function configuration, etc., and trigger the page snapshot save operation according to the preset time interval (for example, every 5 minutes), that is, save the current page data as a snapshot and attach a timestamp to record the time point of saving.

[0061] S202: writing the page record information into different backup queues according to a preset page record storage rule, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval.

[0062] In this step, the page record storage rules can be defined in advance according to the needs, the preservation time intervals and strategies of different queues can be determined, and then the generated page record information can be distributed to different backup queues according to the storage rules. It can be understood that each backup queue saves snapshots at different time intervals to ensure data diversity and redundancy.

[0063] S203: In response to the publishing request of the edited page data, generate the development page data, mark the development page data with version information, and save the development page data in the order of version information.

[0064] In this step, after the user completes page editing in the low-code platform, he / she submits a publishing request, indicating that the page is ready for publishing. Version information is added to the development page data, including version number, publishing time, publisher, etc. The development page data is saved in the order of version information to ensure the orderliness of version management.

[0065] The low-code data backup method provided in this embodiment obtains the page data in the editing state, saves the page snapshots of the page data in the editing state at preset time intervals, and obtains page record information with a timestamp; according to the preset page record storage rules, the page record information is written into different backup queues, and the backup queues include more than two, each backup queue has a different save time interval and operation number interval; in response to the publishing request of the page data in the editing state, the page data in the development state is generated, the page data in the development state is marked with version information, and the page data in the development state is saved in the order of the version information. On the basis of limiting the storage capacity of the device, the snapshot information in the process of low-code data preservation can be uniformly sampled and collected. The collected data can cover the operation record information within different time lengths, and dynamic backup is supported, so that the workspace can be restored to the collected snapshot data node during the low-code development process.

[0066] The following is a detailed introduction to the technical solution of the above-mentioned low-code data backup method.

[0067] In one possible implementation, the low-code data backup method provided in this embodiment writes page record information into different backup queues according to the requirements of the preservation time intervals of different backup queues.

[0068] Specifically, according to the preset page record storage rules, the page record information is written into different backup queues, including: sorting the backup queues from large to small according to the preservation time interval; judging whether the page record information meets the preservation time interval requirement and the operation number interval of the first-ranked backup queue according to the timestamp of the page record information; if so, writing the page record information into the first-ranked backup queue; if not, traversing each backup queue according to the sorting order, and writing the page record information into the backup queue that meets the preservation time interval requirement.

[0069] It is understandable that the complexity of the products in the low-code development process makes it impossible to incrementally save the new data generated by each operation. When saving the full amount, there are problems such as large device storage space occupation and high data redundancy. Therefore, in order to back up low-code page data based on limited device storage capacity, this embodiment backs up page record information through different backup queues. The queue length, storage time interval, and operation number interval of each backup queue are dynamically configurable.

[0070] In this embodiment, each backup queue has a preset saving time interval, which indicates the frequency of saving snapshots in the queue. All backup queues are sorted from large to small according to the saving time interval, ensuring that the queues with longer saving time intervals are checked first. For example, the saving time interval in backup queue A is to save a snapshot every 24 hours, backup queue B is to save a snapshot every 12 hours, and backup queue C is to save a snapshot every 1 hour. Then the arrangement order (that is, the traversal order) is: backup queue A - backup queue B - backup queue C.

[0071] According to the arrangement order, check whether the timestamp of the page record information meets the preservation time interval requirements and operation number interval of each backup queue, and determine whether to write the page record information into the backup queue.

[0072] Furthermore, after traversing each backup queue according to the sorting order, the method further includes: if the page record information does not have a backup queue that meets the time interval requirement, discarding the page record information.

[0073] It is understandable that the backup queue determines which data is valuable based on the time interval and the number of operations. Discarding data that does not meet these conditions can ensure that the backed-up data is the latest and most useful. Data that does not meet the time interval and the number of operations interval requirements may be redundant. Retaining this data has no practical significance and will increase the complexity of data processing. In addition, the storage space of the backup queue is limited. If all page record information is retained, it may lead to a waste or overload of storage resources. By discarding page record information that does not meet the conditions, unnecessary data storage and processing can be reduced, and the overall efficiency of the system can be improved.

[0074] Specifically, the backup queue may include a long-term backup queue, a mid-term backup queue and a short-term backup queue. The long-term backup queue has a first storage time interval, the mid-term backup queue has a second storage time interval, and the short-term backup queue has a third storage time interval. Figure 3 The process of the low-code data backup method provided in the embodiment of the present application Figure 2 ,like Figure 3 The step of writing the page record information into different backup queues according to the preset page record storage rule may include:

[0075] S301: Calculate a first time interval between the page record information and the previous page record information in the long-term backup queue according to the timestamp of the page record information, and determine whether the first time interval is not less than the first duration;

[0076] S302: If yes, write the page record information into the long-term backup queue;

[0077] S303: If not, calculate a second time interval between the page record information and the previous page record information in the mid-term backup queue, and determine whether the second time interval is not less than the second duration;

[0078] S304: If yes, write the page record information into the mid-term backup queue;

[0079] S305: If not, calculate a third time interval between the page record information and the previous page record information in the short-term backup queue, and determine whether the third time interval is not less than the third duration;

[0080] S306: If yes, write the page record information into the short-term backup queue;

[0081] S307: If not, discard the page record information.

[0082] In this embodiment, the default value of the long-term queue size is 3, the default value of the collection time interval is 12 hours, and the default value of the collection page saving operation interval is 400 times. Considering the actual situation of low-code page development, the general development time of a day's development work is within 12 hours. The default value of the collection time interval is 12 hours and the queue length is 3, which means that the low-code page data of the past 3 days can be sampled and saved. The default value of the collection operation interval is 400 times, which means that a snapshot of the low-code page data in the long-term queue is saved after 400 low-code page operations. The default value of the medium-term queue size is 3, the default value of the collection time interval is 1 hour, and the default value of the collection operation interval is 100 times; the medium-term queue can sample and save page data within the past 3 hours, and can ensure that the page data in the medium term is saved in the case of continuous operation. The default value of the short-term queue size is 4, the default value of the collection time interval is 10 minutes, and the default value of the collection operation interval is 10 times. The short-term queue can save page data within the past 40 minutes. Combined with the medium-term queue with a time interval of 1 hour, it can actually cover the page sampling data every 10 minutes within the past 1 hour.

[0083] According to the above settings, the page sampling data in the long, medium and short term can be evenly covered, providing users with more options for operating data recovery.

[0084] In addition, this embodiment further provides a judgment logic algorithm for writing page record information into each queue:

[0085] t(x,q)=T c -T hqe >C t &&T c -T qe >C t

[0086] n(x,q)=Id x -Id hqe >C n &&Id x -Id qe >C n

[0087] f(x,q)=S q <C s ||t(x,q)||n(x,q)

[0088] Among them, t(x, q) is the time judgment function of whether page record x can be written into queue q, T c is the current time, T hqe is the write time of the tail record of the previous queue of queue q. If q is a medium-time queue, then the previous queue of q is a long-time queue. If q is a short-time queue, then the previous queue of q is the union of the long-time queue and the medium-time queue. C t The collection interval configured for the q queue, T qe The write time of the tail record of the current q queue. The record x can be written to the q queue in the time dimension only when the creation time interval between the current time and the tail record of the q queue and the parent queue of the q queue is greater than the collection time interval configured for the queue.

[0089] n(x, q) is the function for judging the number of operations of whether page record x can be written into queue q, Id x The number of operation records for page x, indicating the nth operation of page x. hqe C is the number of operation records recorded at the end of the queue of the previous level of queue q. n The collection operation interval configured for queue q, Id qe The number of operations recorded at the end of the current q queue. Only when the interval between the number of operations of page record x and the number of operations between the q queue and the parent queue of the q queue is greater than the interval of the number of collections configured for the queue, can the record x be written to the q queue in terms of the number dimension.

[0090] f(x, q) is the judgment function of whether page record x can be written into queue q, where S q is the actual size of queue q, C s The configured size of queue q. When queue q is not full, or record x meets the time judgment function logic of queue q, or record x meets the operation count judgment function logic of queue q, record x can be written into queue q.

[0091] In this embodiment, when a page is saved, the new page content needs to overwrite the old page content, and the replaced old page content needs to be written into the queue through the above-mentioned queue writing judgment logic. First, the long-term queue writing judgment is performed. If the replaced old page record can be written into the long-term queue, it is directly written into the long-term queue, and no longer written into the medium-term queue and the short-term queue; if the long-term queue cannot be written, it continues to determine whether it can be written into the medium-term queue. If it can be written into the medium-term queue, it will no longer be written into the short-term queue; if it cannot be written into the medium-term queue, it continues to determine whether it can be written into the short-term queue. If it can be written into the short-term queue, it will be written into the short-term queue. If not, this page record is discarded and not saved as a snapshot.

[0092] In a possible implementation, the low-code data backup method provided in this embodiment, after marking the development state page data with version information, further includes: performing functional testing on the development state page data; synchronizing the development state page data that passes the functional test to the production environment to generate production state page data; and returning the development state page data that fails the functional test to the editing state.

[0093] It is understandable that the page data in the development state after version information marking can be handed over to testers for functional testing and integration testing. If the released page version fails the test, the tester can record the corresponding problem record and hand it over to the developer for modification and repeat the process of editing + saving + testing + publishing + post-publishing testing; if the released page version passes the test, the page data will be synchronized to the production environment.

[0094] In one possible implementation, the low-code data backup method provided in this embodiment, after synchronizing the development-state page data that has passed the test to the production environment to generate the production-state page data, also includes: performing an acceptance test on the production-state page data; confirming the production-state page data that has passed the acceptance test as published data; returning the production-state page data that has not passed the acceptance test to the development state, and rolling back to the previous version of the production-state page data.

[0095] It is understandable that after the production-state page data is generated, it needs to be approved and released in the production environment, and the release acceptance test in the production environment needs to be carried out. If the acceptance fails, the production-state version can be rolled back to the previous page version. If the production-state page version passes the acceptance, the page version in the production state can be officially accessed and used by users.

[0096] In a possible implementation, the low-code data backup method provided in this embodiment further includes: performing a release test on the editing state page data before generating the development state page data; and confirming the editing state page data that passes the release test as the release state page data.

[0097] It is understandable that after editing a page, the developer needs to save the page. At this time, the page can still be modified and is in a temporary state. After that, the page data is released for testing. Only after the release test passes can it be confirmed as a released state. At this time, the page data is locked.

[0098] According to the above embodiment, by introducing three low-code data states of editing, publishing, and production, introducing snapshot saving methods for editing and version saving methods for publishing, the multi-dimensionality of data backup in the low-code development process is ensured. The stability of low-code data is ensured by isolating the low-code data publishing process between the development environment and the production environment.

[0099] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present application.

[0100] It should be further noted that, although the various steps in the flowchart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowchart may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0101] Figure 4 Schematic diagram of a low-code data backup device provided in an embodiment of the present application. Figure 4 As shown, the low-code data backup device includes:

[0102] The temporary page data recording module 41 is used to obtain the page data in the editing state, save the page snapshot of the page data in the editing state at a preset time interval, and obtain the page record information with a timestamp;

[0103] A temporary page backup module 42, used to write the page record information into different backup queues according to a preset page record storage rule, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval;

[0104] The publishing page backup module 43 is used to generate development state page data in response to a publishing request of the editing state page data, mark the development state page data with version information, and save the development state page data in the order of version information.

[0105] In a possible design, the temporary page backup module 42 is specifically used for:

[0106] Sort the backup queues in descending order according to the save time interval;

[0107] Determining whether the page record information meets the saving time interval requirement and the operation number interval of the first-ranked backup queue according to the timestamp of the page record information;

[0108] If yes, write the page record information into the first-ranked backup queue;

[0109] If not, each backup queue is traversed according to the sorting order, and the page record information is written into the backup queue that meets the preservation time interval requirement.

[0110] In a possible design, the temporary page backup module 42 is further specifically used for:

[0111] If the page record information does not exist in a backup queue that meets the time interval requirements and the operation number interval, the page record information is discarded.

[0112] In a possible design, the backup queue includes a long-term backup queue, a mid-term backup queue and a short-term backup queue, the long-term backup queue has a first time interval, the mid-term backup queue has a second time interval, and the short-term backup queue has a third time interval. The temporary page backup module 42 is specifically used for:

[0113] Calculate a first time interval between the page record information and the previous page record information in the long-term backup queue according to the timestamp of the page record information, and determine whether the first time interval is not less than the first duration;

[0114] If yes, write the page record information into the long-term backup queue;

[0115] If not, calculating a second time interval between the page record information and the previous page record information in the mid-term backup queue, and determining whether the second time interval is not less than the second duration;

[0116] If yes, write the page record information into the mid-term backup queue;

[0117] If not, calculating a third time interval between the page record information and the previous page record information in the short-term backup queue, and determining whether the third time interval is not less than the third duration;

[0118] If yes, write the page record information into the short-term backup queue;

[0119] If not, the page record information is discarded.

[0120] In a possible design, the publishing page backup module 43 is further specifically used for:

[0121] Performing functional testing on the page data in the development state;

[0122] Synchronize the development-state page data that has passed the functional test to the production environment to generate production-state page data;

[0123] The development state page data that fails the functional test is returned to the editing state.

[0124] In a possible design, the low-code data backup device further includes a production state page recovery module 44, and the production state page recovery module 44 is specifically used to:

[0125] Performing acceptance testing on the production page data;

[0126] Confirm the production-state page data that has passed the acceptance test as the published data;

[0127] The production state page data that fails the acceptance test is returned to the development state, and rolled back to the previous version of the production state page data.

[0128] In a possible design, the temporary page data recording module 41 is further specifically used for:

[0129] Performing a publishing test on the page data in the editing state;

[0130] The edited page data that has passed the publishing test is confirmed as the published page data.

[0131] It should be understood that the above-mentioned device embodiments are only illustrative, and the device of the present application can also be implemented in other ways. For example, the division of units / modules in the above-mentioned embodiments is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units, modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed.

[0132] In addition, unless otherwise specified, each functional unit / module in each embodiment of the present application may be integrated into one unit / module, each unit / module may exist physically separately, or two or more units / modules may be integrated together. The above-mentioned integrated unit / module may be implemented in the form of hardware or in the form of a software program module.

[0133] Figure 5 A schematic diagram of the structure of an electronic device applicable to a low-code data backup method provided in an embodiment of the present application. Figure 5 As shown, the electronic device of this embodiment includes: at least one processor 50 ( Figure 5 Only one is shown in the figure) a processor, a memory 51, and a computer program stored in the memory 51 and executable on at least one processor 50, and when the processor 50 executes the computer program, the steps in any of the above-mentioned method embodiments are implemented.

[0134] The electronic device may include, but is not limited to, a processor 50 and a memory 51. Those skilled in the art will appreciate that Figure 5 These are merely examples of electronic devices and do not constitute a limitation on the electronic devices. The electronic devices may include more or fewer components than those shown in the figure, or a combination of certain components, or different components. For example, the electronic devices may also include input and output devices, network access devices, etc.

[0135] The processor 50 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0136] The specific implementation process of the processor 501 can be found in the above method embodiment, and its implementation principle and technical effect are similar, so this embodiment will not be repeated here.

[0137] In some embodiments, the memory 51 may be an internal storage unit of the electronic device, such as the memory of the electronic device. In other embodiments, the memory 51 may also be an external storage device of the electronic device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the electronic device. Further, the memory 51 may also include both an internal storage unit of the electronic device and an external storage device. The memory 51 is used to store an operating system, an application program, a boot loader (BootLoader), data, and other programs, such as the program code of a computer program. The memory 51 may also be used to temporarily store data that has been output or is to be output.

[0138] The embodiment of the present application further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.

[0139] The computer-readable storage medium mentioned above can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk. The readable storage medium can be any available medium that can be accessed by a general or special-purpose computer.

[0140] An exemplary readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can be located in an application specific integrated circuit (Application Specific Integrated Circuits, referred to as ASIC). Of course, the processor and the readable storage medium can also exist as discrete components in the above-mentioned electronic device.

[0141] Those skilled in the art can understand that all or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the steps of the above-mentioned method embodiments are executed; and the aforementioned storage medium includes: ROM, RAM, disk or optical disk and other media that can store program codes.

[0142] In the above embodiments, the description of each embodiment has its own emphasis. For the part not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0143] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.

[0144] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A low-code data backup method, characterized in that: include: Acquire the page data in the editing state, save the page snapshots of the page data in the editing state at preset time intervals, and obtain page record information with timestamps; According to a preset page record storage rule, the page record information is written into different backup queues, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval; In response to a request to publish the edited page data, the development state page data is generated, the development state page data is marked with version information, and the development state page data is saved in the order of the version information.

2. The method according to claim 1, characterized in that The step of writing the page record information into different backup queues according to a preset page record storage rule includes: Sort the backup queues in descending order according to the save time interval; Determining whether the page record information meets the saving time interval requirement and the operation number interval of the first-ranked backup queue according to the timestamp of the page record information; If yes, write the page record information into the first-ranked backup queue; If not, each backup queue is traversed according to the sorting order, and the page record information is written into the backup queue that meets the preservation time interval requirement.

3. The method according to claim 2, characterized in that After traversing each backup queue according to the sorting order, the method further includes: If the page record information does not exist in a backup queue that meets the time interval requirements and the operation number interval, the page record information is discarded.

4. The method according to claim 1, characterized in that: The backup queue includes a long-term backup queue, a mid-term backup queue and a short-term backup queue, the long-term backup queue has a first time interval, the mid-term backup queue has a second time interval, and the short-term backup queue has a third time interval, and the page record information is written into different backup queues according to a preset page record storage rule, including: Calculate a first time interval between the page record information and the previous page record information in the long-term backup queue according to the timestamp of the page record information, and determine whether the first time interval is not less than the first duration; If yes, write the page record information into the long-term backup queue; If not, calculating a second time interval between the page record information and the previous page record information in the mid-term backup queue, and determining whether the second time interval is not less than the second duration; If yes, write the page record information into the mid-term backup queue; If not, calculating a third time interval between the page record information and the previous page record information in the short-term backup queue, and determining whether the third time interval is not less than the third duration; If yes, write the page record information into the short-term backup queue; If not, the page record information is discarded.

5. The method according to claim 1, characterized in that After marking the version information of the page data in the development state, the method further includes: Performing functional testing on the page data in the development state; Synchronize the development-state page data that has passed the functional test to the production environment to generate production-state page data; The development state page data that fails the functional test is returned to the editing state.

6. The method according to claim 5, characterized in that After synchronizing the page data of the development state that has passed the test to the production environment to generate the page data of the production state, the method further includes: Performing acceptance testing on the production page data; Confirm the production-state page data that has passed the acceptance test as the published data; The production state page data that fails the acceptance test is returned to the development state, and rolled back to the previous version of the production state page data.

7. The method according to claim 1, characterized in that Before generating the page data in the development state, the method further includes: Performing a publishing test on the page data in the editing state; The edited page data that has passed the publishing test is confirmed as the published page data.

8. A low-code data backup device, characterized in that: include: A temporary page data recording module is used to obtain the page data in the editing state, save the page snapshot of the page data in the editing state at a preset time interval, and obtain page record information with a timestamp; A temporary page backup module, used to write the page record information into different backup queues according to a preset page record storage rule, wherein the backup queues include more than two, and each backup queue has a different saving time interval and operation number interval; The publishing page backup module is used to respond to the publishing request of the editing state page data, generate the development state page data, mark the version information of the development state page data, and save the development state page data in the order of the version information.

9. An electronic device, characterized in that: include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 7 when executed by a processor.

Images