CN113760871B - Template synchronization method and device - Google Patents
Template synchronization method and device Download PDFInfo
- Publication number
- CN113760871B CN113760871B CN202010827913.6A CN202010827913A CN113760871B CN 113760871 B CN113760871 B CN 113760871B CN 202010827913 A CN202010827913 A CN 202010827913A CN 113760871 B CN113760871 B CN 113760871B
- Authority
- CN
- China
- Prior art keywords
- template
- mark
- template information
- message
- object list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 94
- 230000027455 binding Effects 0.000 claims abstract description 51
- 238000009739 binding Methods 0.000 claims abstract description 51
- 230000001360 synchronised effect Effects 0.000 claims abstract description 42
- 238000012545 processing Methods 0.000 claims abstract description 23
- 238000012217 deletion Methods 0.000 claims description 21
- 230000037430 deletion Effects 0.000 claims description 21
- 238000012986 modification Methods 0.000 claims description 15
- 230000004048 modification Effects 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004321 preservation Methods 0.000 claims description 7
- 230000007246 mechanism Effects 0.000 claims description 6
- 238000002715 modification method Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 230000032683 aging Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000007792 addition Methods 0.000 description 3
- 238000012937 correction Methods 0.000 description 3
- 238000011143 downstream manufacturing Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Quality & Reliability (AREA)
- Computing Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a template synchronization method and device, and relates to the technical field of computers. One embodiment of the method comprises the following steps: receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set; based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server. According to the embodiment, the personalized operation flow is extracted in a callback mode, the template mode service is externally energized in an extension package mode, and rapid addition configuration is carried out in a component mode.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for synchronizing templates.
Background
Template patterns are very widespread in internet applications, such as commodity-bound aging templates, merchant-bound shipping fee templates, and the like. The mode page needs to set up a template first, and then select an associated object, such as commodity, merchant or region. When the template is stored, the template is stored firstly, and then the binding relation between each object and the template is stored, so that the commodity page is conveniently displayed, and the commodity, the merchant or the region is used as the dimension for inquiring when the settlement page is charged.
At present, the preservation modes are divided into two types:
1. and (3) synchronous establishment: namely, receiving a request submitted by the front end, after creating a template and generating a template ID, storing the relation between an object to be bound and the template ID, and after the storage is finished, feeding back an execution result.
2. Asynchronous establishment: the method comprises the steps of receiving a request submitted by a front end, creating a template, feeding back the template to the front end, wherein the template relationship is in synchronization, asynchronously storing the binding relationship between an object and a template ID, and notifying the front end of updating state after the storage is completed.
In carrying out the present invention, the inventors have found that at least the following problems exist in the prior art:
1. under the condition that the number of objects to be bound is large, the synchronous mode is easy to cause the phenomenon of blocking overtime, and the system performance and stability are deteriorated along with the increase of the number of objects, so that the response time length is prolonged.
2. The asynchronous mode needs to be developed aiming at a specific scene, and has poor reusability; the binding relationship is easy to fail, failure compensation is difficult to control, the execution progress cannot be obtained efficiently, and the user perception degree is poor; the retry times are difficult to obtain or special logic is needed to count the database, so that the system performance loss is large, and the retry can be performed through the MQ, but the retry can not be realized quickly; when the template relationship needs to be updated, the relationship (update), the unbinding relationship (addition) and the deleted relationship (deletion) which are already bound need to be specially processed, and the processing logic is complex.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for synchronizing templates, which at least can solve the problem in the prior art that the stored templates and the binding relationship are not ideal.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a template synchronization method, including:
receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server.
Optionally, the operation type is creation;
the operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
Calling a template creation method, generating a template based on the template information, storing the template information into a database, and taking a storage number as an identification of the template;
and taking a set formed by the objects in the object list as a set of objects to be newly built, and adding a new mark to each object in the set.
Optionally, the operation type is deletion, the template information includes a template identifier, and the object list is empty;
the operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
calling a template deleting method, and inquiring the history template information synchronized with the template and the bound history object list in a database based on the template identification;
deleting the history template information, taking a set formed by the objects in the history object list as an object set to be deleted, and adding a deletion mark to each object in the set.
Optionally, the operation type is modification, and the template information includes a template identifier;
the operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
Calling a template modification method, inquiring history template information synchronized with a template and a bound history object list in a database based on the template identification, and replacing the history template information with the template information;
taking the intersection of the history object list and the object list as an object set to be updated, and adding an update mark to each object in the set;
taking a set formed by objects which belong to the object list and do not belong to the history object list as a set of objects to be newly built, and adding a new mark to each object in the set;
and taking a set formed by the objects which belong to the history object list and do not belong to the object list as an object set to be deleted, and adding a deletion mark to each object in the set.
Optionally, the step of synchronizing the binding relationship between the object and the template at the server includes:
when the server monitors message touch, acquiring an operation mark, an object identifier and template information in the message, and determining an object corresponding to the object identifier;
and calling an interface corresponding to the operation mark to execute the operation of creating, deleting or modifying the binding relation of the object aiming at the template in a database.
Optionally, after adding the operation marker to each object in the set, the method further includes: storing the identification and retry times of each object in the set into a hash table; wherein, the retry number in the primary preservation is 0;
before the calling the interface corresponding to the operation mark, the method further comprises the following steps: inquiring the retry times corresponding to the object identifier in the hash table, and ending the execution logic of the message if the retry times are greater than or equal to a preset retry times threshold;
the calling the interface corresponding to the operation mark further comprises:
if the call is successful, deleting the data corresponding to the object identifier in the hash table; or (b)
If the call fails, adding 1 to the retry times and updating the retry times to the hash table, and throwing out the exception so as to push the message again through a message retry mechanism.
Optionally, the joining further includes a service type;
the calling the operation method corresponding to the operation type comprises the following steps: calling an operation method corresponding to the service type and the operation type;
the calling the interface corresponding to the operation mark comprises the following steps: and calling an interface corresponding to the service type and the operation mark.
Optionally, before the calling the operation method corresponding to the operation type, the method further includes:
when the operation type is deleting or modifying, judging whether the template identifier is in a locking state currently by adopting a distributed locking method, and if the template identifier is not locked, locking the template identifier;
the step of querying the database for the synchronized historical template information and the bound historical object list of the template based on the template identification further comprises the following steps:
and if the inquiry of the history object list fails, releasing the locking state of the template identifier.
Optionally, the method further comprises: determining the total data amount in the hash table, acquiring the current residual data amount, calculating the duty ratio of the residual data amount in the total data amount, and taking the duty ratio as the current execution progress; wherein, the data in the hash table corresponds to a template information, an object identifier and an operation mark;
and if the residual data quantity is zero, determining that the synchronous binding relationship is over, and releasing the locking state of the template identifier.
To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a template synchronization apparatus including:
the request receiving module is used for receiving a synchronous template request transmitted by a client and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
The operation marking module is used for calling an operation device corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
and the relation synchronizing module is used for generating a message based on the template information, the identification and the operation mark of each object in the set and transmitting the message to the server in a message queue form so as to synchronize the binding relation between the object and the template at the server.
Optionally, the operation type is creation;
the operation marking module is used for:
calling a template creating device, generating a template based on the template information, storing the template information into a database, and taking a storage number as an identification of the template;
and taking a set formed by the objects in the object list as a set of objects to be newly built, and adding a new mark to each object in the set.
Optionally, the operation type is deletion, the template information includes a template identifier, and the object list is empty;
the operation marking module is used for:
invoking a template deleting device, and inquiring the history template information synchronized with the template and the bound history object list in a database based on the template identification;
Deleting the history template information, taking a set formed by the objects in the history object list as an object set to be deleted, and adding a deletion mark to each object in the set.
Optionally, the operation type is modification, and the template information includes a template identifier;
the operation marking module is used for:
invoking a template modifying device, inquiring history template information synchronized with a template and a bound history object list in a database based on the template identification, and replacing the history template information with the template information;
taking the intersection of the history object list and the object list as an object set to be updated, and adding an update mark to each object in the set;
taking a set formed by objects which belong to the object list and do not belong to the history object list as a set of objects to be newly built, and adding a new mark to each object in the set;
and taking a set formed by the objects which belong to the history object list and do not belong to the object list as an object set to be deleted, and adding a deletion mark to each object in the set.
Optionally, the relationship synchronization module is configured to:
when the server monitors message touch, acquiring an operation mark, an object identifier and template information in the message, and determining an object corresponding to the object identifier;
And calling an interface corresponding to the operation mark to execute the operation of creating, deleting or modifying the binding relation of the object aiming at the template in a database.
Optionally, the device further comprises a storage module, which is used for storing the identification and retry times of each object in the set into a hash table; wherein, the retry number in the primary preservation is 0;
the judging module is used for inquiring the retry times corresponding to the object identifier in the hash table, and ending the execution logic of the message if the retry times are greater than or equal to a preset retry times threshold value;
the relationship synchronization module is further configured to:
if the call is successful, deleting the data corresponding to the object identifier in the hash table; or (b)
If the call fails, adding 10 to the retry times and updating the retry times to the hash table, and throwing out the exception so as to push the message again through a message retry mechanism.
Optionally, the joining further includes a service type;
the operation marking module is used for calling an operation device corresponding to the service type and the operation type;
and the relation synchronization module is used for calling an interface corresponding to the service type and the operation mark.
Optionally, the device further comprises a locking module for:
when the operation type is deleting or modifying, a distributed lock device is adopted to judge whether the template identifier is in a locking state currently, and if the template identifier is not locked, locking operation is carried out on the template identifier;
and an unlocking module for:
and if the inquiry of the history object list fails, releasing the locking state of the template identifier.
Optionally, the method further comprises a progress calculation module for:
determining the total data amount in the hash table, acquiring the current residual data amount, calculating the duty ratio of the residual data amount in the total data amount, and taking the duty ratio as the current execution progress; wherein, the data in the hash table corresponds to a template information, an object identifier and an operation mark;
and if the residual data quantity is zero, determining that the synchronous binding relationship is over, and releasing the locking state of the template identifier.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a template synchronization electronic device.
The electronic equipment of the embodiment of the invention comprises: one or more processors; and a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement any of the template synchronization methods described above.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a computer-readable medium having stored thereon a computer program which, when executed by a processor, implements any one of the above-described template synchronization methods.
According to the solution provided by the present invention, one embodiment of the above invention has the following advantages or beneficial effects: the method comprises a template processing stage and a template binding relation preservation stage, supports simultaneous access of a distributed system and various services, draws off personalized operation flows in a callback mode, externally energizes the template mode service in an extension package mode, and rapidly adds and configures in a component mode, wherein a user only needs to pay attention to the addition, deletion, correction and simple configuration of self service data.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic flow diagram of a template synchronization method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an object set processing flow with newly created operation types according to an embodiment of the present invention;
FIG. 3 is a schematic flow diagram of an object set process with a delete type of operation according to an embodiment of the invention;
FIG. 4 is a schematic flow chart of an operation type for newly created object set processing according to an embodiment of the present invention;
FIG. 5 is a flow diagram of an alternative template synchronization method according to an embodiment of the invention;
FIG. 6 is a flow diagram of another alternative template synchronization method according to an embodiment of the invention;
FIG. 7 is a schematic diagram of the main modules of a template synchronization apparatus according to an embodiment of the present invention;
FIG. 8 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 9 is a schematic diagram of a computer system suitable for use in implementing a mobile device or server of an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be noted that the template mode is a relatively common scenario, and may be used in many fields, such as mail/sms templates, freight templates, service fee templates, aging templates, etc., and the present invention does not limit the field of use of the template.
Referring to fig. 1, a main flowchart of a template synchronization method provided by an embodiment of the present invention is shown, including the following steps:
s101: receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
s102: invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
s103: based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server.
In the above embodiment, for steps S101 and S102, the server provides the template operation interface, and the client implements the corresponding method in the interface, including adding, deleting and modifying the template and adding, deleting and modifying the binding relationship.
The client splices and provides the parameters according to the service requirement, including template information, an object list and an operation type; the operation types are divided into creation (creation of templates and binding relationships), modification (modification of templates and binding relationships), and deletion (deletion of templates and binding relationships).
The following is described separately for different operation types:
1) For the creation type, the entry includes template information, an object list, and an operation type, and the template ID is not included in the template information, as shown in fig. 2.
And calling a template creation method of a template adding, deleting and modifying interface, and generating a new template based on the template information. When the template information is synchronously stored in the database after the template is created, the storage number (which may be a serial number or a number generated based on a certain rule) is used as the template ID, or the ID may be generated and transmitted in the service, and the mode is not limited.
Since the template is newly created, that is, represents that the corresponding binding relationship also needs to be newly created, specifically, a set formed by the objects in the object list is taken as a set of objects to be newly created, and a new mark is added to each object in the set.
2) For the delete type, the entry includes template information (including the template ID) and the operation type, at which point the object list is empty, as shown in fig. 3.
And calling a template deleting method of adding, deleting and modifying the checking interface of the template, and inquiring the synchronized template information and the bound history object list in the database based on the template ID in the template information.
Because the operation type is deletion, the history template information can be directly deleted. However, the binding relationship needs downstream processing of the service system, so that only a set formed by the objects in the history object list is used as a set of objects to be deleted, a deletion mark is added to each object in the set, and then the binding relationship is processed by the downstream processing.
3) For the modification type, the inclusion includes template information (including template ID), object list, and operation type, as shown in fig. 4.
And calling a template modification method of a template adding, deleting and modifying interface, and inquiring the synchronized template information and the bound history object list in a database based on the template ID in the template information. Because the operation type is modified, the history template information can be deleted directly, and new template information can be stored again.
The difference between the new incoming object list (set A) and the historical object list (set B) is compared, A is the object set to be updated, B-A is the object set to be deleted, A-B is the object set to be newly built, and the method of calculating difference sets, intersections and the like by using ase:Sub>A Guavase:Sub>A set algorithm can be quickly realized.
In order to facilitate rapid processing of binding relations by a server side under a subsequent service system, different operation marks, such as an update mark, a delete mark and a new mark, are set for different sets according to the scheme, and are specifically added to objects in the sets. These three types of operation markers are of interest to the business system to determine which bindings need to be created, which need to be deleted, and which need to be modified.
It should be noted that, when the number and variety of the templates in the service system are more, the templates can be classified according to the service types and corresponding interfaces of adding, deleting, modifying and binding relationship of the templates can be set. For example, for the new creation of an aging template, a create template method under aging service is invoked.
For step S103, a message is generated for an object according to the operation mark, the ID of each object and the template information, and finally the message is sent to the service system in MQ form. The MQ is encapsulation of the jar packet flow step, and notifies the downstream of the service system to perform synchronization of the binding relationship, see in particular the description of fig. 5 later.
According to the method provided by the embodiment, the distributed system and the simultaneous access of multiple services are supported, the personalized operation flow is extracted in a callback mode, the template mode service is externally energized in an extension packet (jar packet and the like), the quick addition configuration is carried out in a component mode, and a user only needs to pay attention to the addition, deletion, correction and simple configuration of own service data.
Referring to fig. 5, an alternative template synchronization method according to an embodiment of the present invention is shown, which includes the following steps:
s501: receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
s502: when the operation type is deleting or modifying, judging whether a template identifier in the template information is in a locking state currently by adopting a distributed locking method, and if the template identifier is not locked, locking the template identifier;
s503: invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
s504: based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server.
In the above embodiment, for steps S501, S503 and S504, reference may be made to steps S101 to S103 shown in fig. 1 and descriptions shown in fig. 2 to 4, and the description thereof will not be repeated here.
In the above embodiment, for step S502, using the Redis as an example, before invoking the operation method, the setNx method of the Redis is adopted, the service type (for example shixiao, yunfei, etc.) and the template ID are used as keys, and the number of objects to be processed is a value, such as the total number of commodities of the time-efficient template to be bound, the total number of merchants or shops of the shipping template to be bound. The setNx method used here has two roles:
1. the number of objects to be processed is stored for different template IDs for subsequent progress calculation.
2. The use of setNx atomic properties avoids the case of multiple people manipulating the same template: the setNx only returns 1 to the first request, locks the template ID, and the other is 0, which indicates that the template and the binding relation flow are not finished, and the feedback result cannot be repeatedly executed. For example, two persons operating one template at the same time will inform the second person that the operation is repeated.
In the case where the operation type is newly created, the template ID is not generated, and thus the operation is directly performed without locking or unlocking. And for the case where the operation type is modification or deletion, the template ID is locked. The subsequent unlocking is divided into two cases:
1) The historical object list is deleted when the query in the database fails, and failure reasons, such as some anomalies, data assembly failures, data query failures and other various reasons which occur when the client side realizes the interface service, are fed back to throw anomalies so as to inform a user of the storage or modification failures.
2) And after the synchronous binding relationship of the server is finished, the locking state of the template ID is released.
Specifically, for example, an X system is set as a service system (may be a distributed system, including a plurality of service ends such as a, b, and c), and a jar packet is accessed and a template adding, deleting, checking interface and a binding relation adding, deleting, checking interface are implemented. Here, description will be made taking the template as an aging template and the operation type as a modification as an example:
1. the merchant modifies the information in the aging template at the client interface, selects the SKUs to be bound (assuming that the original template binds 100 SKUs, the merchant deletes 10 old SKUs and adds 20 new SKUs, and generates 110 SKUs in total for the object list to be bound), and clicks the submit button.
2. The method comprises the steps that an a server side in an X system receives a synchronous template request submitted by a merchant, acquires a parameter in the request, comprises a method for modifying a template in a jar package, wherein the operation type of the parameter comprises modification, an object list to be bound, template information (comprising a template ID) and a service type shixiao:
1) Because the operation type is modified (not created), judging whether the template ID is in a locking state currently by utilizing a setNx method of Redis, and if not, executing locking operation on the template ID;
2) A template modification method is called, historical template information corresponding to a template ID in a database is replaced by the submitted template information, and after modification is successful, a history object list (one SKU corresponds to binding relation data) which is bound in the database before inquiring the template based on the template ID is 100 SKUs in total;
3) Comparing the historical object list (100 SKUs) with the new object list submitted by the merchant (110 SKUs), three sets are calculated, namely: the method comprises the steps of deleting a SKU set (10 SKUs deleted by a merchant), newly-built SKU sets (20 SKUs newly added by the merchant) and unchanged SKU sets (90 SKUs, which are independently decided to be modified or not to be changed by a business system), respectively adding a deletion mark, a new mark and an update mark, and finally, each SKU has a respective operation mark (adding/deleting/changing);
4) The total number of SKUs in the three SKU sets is 120, the data in the three SKU sets are respectively taken out, and assembly parameters (template information (including template ID), SKU identification, operation marks and the like) are sent to MQ (respectively sent, total of 120 messages) and randomly fall on the a, b and c … servers.
The MQ sends, which is essentially that the X system sends to the X system for consumption, in this way, the template synchronization and the binding relationship synchronization are decoupled, and then the processing pressure is shared by the processing capacity of the cluster, so that the processing efficiency is improved.
According to the method provided by the embodiment, the Redis is used for locking the template ID, so that the safety of the business process is improved, and the situation that data are mutually covered due to the fact that a plurality of persons operate the same template at the same time is avoided.
Referring to fig. 6, another alternative template synchronization method according to an embodiment of the invention is shown schematically, comprising the steps of:
s601: receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
s602: invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
s603: generating a message based on the template information, the identification and the operation mark of each object in the set, and transmitting the message to a server in a message queue form;
s604: when a server monitors message touch, acquiring an operation mark, an object identifier and template information in the message, and determining an object corresponding to the object identifier;
s605: and calling an interface corresponding to the operation mark to execute the operation of creating, deleting or modifying the binding relation of the object aiming at the template in a database.
In the above embodiment, for the steps S601 to S603, reference may be made to the steps S101 to S102 shown in fig. 1 and the descriptions shown in fig. 2 to 4, and the descriptions are omitted here.
In the above embodiment, for steps S604 and S605, the service system may be a distributed system, configured with a plurality of service ends, and the message in the MQ may be randomly distributed to one of the service ends. And the Jar packet is provided with an MQ monitoring mechanism, and when the server monitors that the message is reached, the object to be processed can be determined according to the operation mark, the object identifier and the template information in the message.
Here, different interfaces are also set for different operation marks, and further, when the joining includes a service type, a method implemented by a corresponding binding relation interface is required to be called according to the service type and the operation mark.
For management visualization, a hash table is provided here. Taking Redis as an example, using an hSet method, taking key as a service type, splicing a fixed character (relation) and a template ID, taking the file as an object ID to be processed, defaulting the value to 0, and storing the value in a hash table. The method is a storage structure, mainly stores each object needing to be operated and the retried times, and deletes the data when the synchronous template binding relation is successful, but adds the retried times if the synchronous is failed.
Before processing the binding relationship, it is checked whether the retry number of the object in the hash table is greater than or equal to a predetermined retry number threshold according to the object identifier in the message:
1) And if the operation mark is not exceeded, calling a method for realizing the corresponding binding relation interface according to the operation mark in the message. If the call fails, the retry times are updated to the hash table again after being added with 1, the exception is thrown out, and the MQ retry mechanism pushes the message again. The number of retries at the time of initial storage was 0.
2) If greater than or equal to, the execution logic of the message is ended.
After the binding relation is successfully processed, deleting the data corresponding to the object identifier in the hash table. Judging whether the data residual quantity in the hash table is 0, if not, the binding relation is not processed, if so, the binding relation is synchronized, the template lock can be deleted, and the whole flow is ended.
Another use of the hash table is set up, and may also be used to analyze the execution results. If the operation mark is added, the total number of objects to be processed in the hash table is determined. After the message is transmitted to the server for processing, the operation of deleting the data in the hash table is executed based on the result transmitted by the server.
And calculating the ratio of the data residual quantity to the data total quantity so as to determine the current execution progress, and displaying that the task is executing in the page. The function is provided in an external interface mode, and a user can dynamically inquire to acquire progress and display the progress to the front end.
The method provided by the embodiment uses the distributed storage characteristic to enhance and monitor the operation state of the binding relation, and supplements the functions of progress calculation, retry compensation and the like.
Referring to fig. 7, a schematic diagram of main modules of a template synchronization apparatus 700 according to an embodiment of the present invention is shown, including:
a request receiving module 701, configured to receive a synchronization template request transmitted by a client, and obtain an entry in the synchronization template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
an operation marking module 702, configured to invoke an operation device corresponding to the operation type, process the template information and the object list to obtain an object set, and add an operation mark to each object in the set;
the relationship synchronization module 703 is configured to generate a message based on the template information, the identifier of each object in the set, and the operation label, and transmit the message to a server in a form of a message queue, so as to synchronize the binding relationship between the object and the template at the server.
In the implementation device of the invention, the operation type is creation;
the operation marking module 702 is configured to: calling a template creating device, generating a template based on the template information, storing the template information into a database, and taking a storage number as an identification of the template;
and taking a set formed by the objects in the object list as a set of objects to be newly built, and adding a new mark to each object in the set.
In the embodiment of the invention, the operation type is deletion, the template information comprises a template identifier, and the object list is empty;
the operation marking module 702 is configured to: invoking a template deleting device, and inquiring the history template information synchronized with the template and the bound history object list in a database based on the template identification;
deleting the history template information, taking a set formed by the objects in the history object list as an object set to be deleted, and adding a deletion mark to each object in the set.
In the implementation device of the invention, the operation type is modification, and the template information comprises a template identifier;
the operation marking module 702 is configured to: invoking a template modifying device, inquiring history template information synchronized with a template and a bound history object list in a database based on the template identification, and replacing the history template information with the template information;
Taking the intersection of the history object list and the object list as an object set to be updated, and adding an update mark to each object in the set;
taking a set formed by objects which belong to the object list and do not belong to the history object list as a set of objects to be newly built, and adding a new mark to each object in the set;
and taking a set formed by the objects which belong to the history object list and do not belong to the object list as an object set to be deleted, and adding a deletion mark to each object in the set.
In the embodiment of the present invention, the relationship synchronization module 703 is configured to: when the server monitors message touch, acquiring an operation mark, an object identifier and template information in the message, and determining an object corresponding to the object identifier;
and calling an interface corresponding to the operation mark to execute the operation of creating, deleting or modifying the binding relation of the object aiming at the template in a database.
The implementation device of the present invention further includes a storage module 704 (not shown in the figure), configured to store the identifier and the retry number of each object in the set into a hash table; wherein, the retry number in the primary preservation is 0;
A determining module 705 (not shown in the figure), configured to query the hash table for a retry number corresponding to the object identifier, and if the retry number is greater than or equal to a predetermined retry number threshold, end execution logic for the message;
the relationship synchronization module 703 is further configured to: if the call is successful, deleting the data corresponding to the object identifier in the hash table; or (b)
If the call fails, adding 10 to the retry times and updating the retry times to the hash table, and throwing out the exception so as to push the message again through a message retry mechanism.
In the embodiment of the invention, the joining also comprises a service type;
the operation marking module 702 is configured to invoke an operation device corresponding to the service type and the operation type;
the relationship synchronization module 703 is configured to invoke an interface corresponding to the service type and the operation flag.
The implementation device of the present invention further includes a locking module 706 (not shown) for:
when the operation type is deleting or modifying, a distributed lock device is adopted to judge whether the template identifier is in a locking state currently, and if the template identifier is not locked, locking operation is carried out on the template identifier;
and an unlocking module for:
And if the inquiry of the history object list fails, releasing the locking state of the template identifier.
The implementation device of the present invention further includes a progress calculation module 707 (not shown in the figure) for:
determining the total data amount in the hash table, acquiring the current residual data amount, calculating the duty ratio of the residual data amount in the total data amount, and taking the duty ratio as the current execution progress; wherein, the data in the hash table corresponds to a template information, an object identifier and an operation mark;
and if the residual data quantity is zero, determining that the synchronous binding relationship is over, and releasing the locking state of the template identifier.
In addition, the implementation of the apparatus in the embodiments of the present invention has been described in detail in the above method, so that the description is not repeated here.
Fig. 8 illustrates an exemplary system architecture 800 in which embodiments of the present invention may be applied.
As shown in fig. 8, a system architecture 800 may include terminal devices 801, 802, 803, a network 804, and a server 805 (by way of example only). The network 804 is the medium used to provide communication links between the terminal devices 801, 802, 803 and the server 805. The network 804 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with a server 805 through a network 804 using terminal devices 801, 802, 803 to receive or send messages, etc. Various communication client applications can be installed on the terminal devices 801, 802, 803.
The terminal devices 801, 802, 803 may be various electronic devices having a display screen and supporting web browsing, and the service terminal 805 may be a service terminal providing various services.
It should be noted that, the method provided in the embodiment of the present invention is generally executed by the server 805, and accordingly, the device is generally disposed in the server 805.
It should be understood that the number of terminal devices, networks and servers in fig. 8 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 9, there is illustrated a schematic diagram of a computer system 900 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 9 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 9, the computer system 900 includes a Central Processing Unit (CPU) 901, which can execute various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 902 or a program loaded from a storage section 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data necessary for the operation of the system 900 are also stored. The CPU 901, ROM 902, and RAM 903 are connected to each other through a bus 904. An input/output (I/O) interface 905 is also connected to the bus 904.
The following components are connected to the I/O interface 905: an input section 906 including a keyboard, a mouse, and the like; an output portion 907 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage portion 908 including a hard disk or the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as needed. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed as needed on the drive 910 so that a computer program read out therefrom is installed into the storage section 908 as needed.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from the network via the communication portion 909 and/or installed from the removable medium 911. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 901.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a request receiving module, an operation marking module, and a relationship synchronization module. The names of these modules do not constitute a limitation on the module itself in some cases, for example, a relationship synchronization module may also be described as a "synchronous binding relationship module".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include:
receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
invoking an operation device corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server.
According to the technical scheme of the embodiment of the invention, the method comprises a template processing stage and a template binding relation preservation stage, supports the simultaneous access of a distributed system and a plurality of services, extracts the personalized operation flow in a callback mode, externally energizes the template mode service in an extension packet (jar packet and the like), and rapidly adds and configures in a component mode, wherein a user only needs to pay attention to the addition, deletion, correction and simple configuration of own service data.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (12)
1. A method of synchronizing templates, comprising:
receiving a synchronous template request transmitted by a client, and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
invoking an operation method corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
based on the template information, the identification of each object in the set and the operation mark, generating a message and transmitting the message to a server in a form of a message queue so as to synchronize the binding relationship between the object and the template at the server.
2. The method of claim 1, wherein the type of operation is creation;
The operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
calling a template creation method, generating a template based on the template information, storing the template information into a database, and taking a storage number as an identification of the template;
and taking a set formed by the objects in the object list as a set of objects to be newly built, and adding a new mark to each object in the set.
3. The method of claim 1, wherein the type of operation is a delete, the template information includes a template identification, and the list of objects is empty;
the operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
calling a template deleting method, and inquiring the history template information synchronized with the template and the bound history object list in a database based on the template identification;
deleting the history template information, taking a set formed by the objects in the history object list as an object set to be deleted, and adding a deletion mark to each object in the set.
4. The method of claim 1, wherein the type of operation is modification, and wherein the template information includes a template identification;
the operation method corresponding to the operation type is called, the template information and the object list are processed to obtain an object set, and an operation mark is added to each object in the set, and the method comprises the following steps:
calling a template modification method, inquiring history template information synchronized with a template and a bound history object list in a database based on the template identification, and replacing the history template information with the template information;
taking the intersection of the history object list and the object list as an object set to be updated, and adding an update mark to each object in the set;
taking a set formed by objects which belong to the object list and do not belong to the history object list as a set of objects to be newly built, and adding a new mark to each object in the set;
and taking a set formed by the objects which belong to the history object list and do not belong to the object list as an object set to be deleted, and adding a deletion mark to each object in the set.
5. The method according to any one of claims 2-4, wherein synchronizing the binding relationship between the object and the template at the server comprises:
When the server monitors message touch, acquiring an operation mark, an object identifier and template information in the message, and determining an object corresponding to the object identifier;
and calling an interface corresponding to the operation mark to execute the operation of creating, deleting or modifying the binding relation of the object aiming at the template in a database.
6. The method of claim 5, further comprising, after adding the operation markers to each object in the collection: storing the identification and retry times of each object in the set into a hash table; wherein, the retry number in the primary preservation is 0;
before the calling the interface corresponding to the operation mark, the method further comprises the following steps: inquiring the retry times corresponding to the object identifier in the hash table, and ending the execution logic of the message if the retry times are greater than or equal to a preset retry times threshold;
the calling the interface corresponding to the operation mark further comprises:
if the call is successful, deleting the data corresponding to the object identifier in the hash table; or (b)
If the call fails, adding 1 to the retry times and updating the retry times to the hash table, and throwing out the exception so as to push the message again through a message retry mechanism.
7. The method of claim 5, wherein the joining further comprises a traffic type;
the calling the operation method corresponding to the operation type comprises the following steps: calling an operation method corresponding to the service type and the operation type;
the calling the interface corresponding to the operation mark comprises the following steps: and calling an interface corresponding to the service type and the operation mark.
8. The method according to claim 3 or 4, further comprising, prior to said invoking the operation method corresponding to said operation type:
when the operation type is deleting or modifying, judging whether the template identifier is in a locking state currently by adopting a distributed locking method, and if the template identifier is not locked, locking the template identifier;
the step of querying the database for the synchronized historical template information and the bound historical object list of the template based on the template identification further comprises the following steps:
and if the inquiry of the history object list fails, releasing the locking state of the template identifier.
9. The method as recited in claim 8, further comprising:
determining the total data amount in the hash table, acquiring the current residual data amount, calculating the duty ratio of the residual data amount in the total data amount, and taking the duty ratio as the current execution progress; wherein, the data in the hash table corresponds to a template information, an object identifier and an operation mark;
And if the residual data quantity is zero, determining that the synchronous binding relationship is over, and releasing the locking state of the template identifier.
10. A template synchronizing device, comprising:
the request receiving module is used for receiving a synchronous template request transmitted by a client and acquiring an entry in the synchronous template request; the parameter entering at least comprises template information, an object list to be bound and an operation type;
the operation marking module is used for calling an operation device corresponding to the operation type, processing the template information and the object list to obtain an object set, and adding an operation mark to each object in the set;
and the relation synchronizing module is used for generating a message based on the template information, the identification and the operation mark of each object in the set and transmitting the message to the server in a message queue form so as to synchronize the binding relation between the object and the template at the server.
11. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-9.
12. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010827913.6A CN113760871B (en) | 2020-08-17 | 2020-08-17 | Template synchronization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010827913.6A CN113760871B (en) | 2020-08-17 | 2020-08-17 | Template synchronization method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113760871A CN113760871A (en) | 2021-12-07 |
| CN113760871B true CN113760871B (en) | 2024-04-16 |
Family
ID=78785596
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010827913.6A Active CN113760871B (en) | 2020-08-17 | 2020-08-17 | Template synchronization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113760871B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104978385A (en) * | 2015-03-19 | 2015-10-14 | 腾讯科技（深圳）有限公司 | Information processing method, browser client and terminal |
| CN107342820A (en) * | 2017-01-09 | 2017-11-10 | 烽火通信科技股份有限公司 | VOLT method and system are realized based on Template Manager |
| CN107807931A (en) * | 2016-09-09 | 2018-03-16 | 北京京东尚科信息技术有限公司 | The method and system of Template Information management |
| CN108628812A (en) * | 2017-03-16 | 2018-10-09 | 北京京东尚科信息技术有限公司 | Method, apparatus, electronic equipment and the readable storage medium storing program for executing of self-defined face single mode plate |
| CN110222293A (en) * | 2019-04-30 | 2019-09-10 | 北京三快在线科技有限公司 | A kind of forms pages generation method and device |
| CN110290049A (en) * | 2019-05-20 | 2019-09-27 | 深圳壹账通智能科技有限公司 | Information push method, server and computer readable storage medium |
| CN110795443A (en) * | 2019-10-08 | 2020-02-14 | 中国建设银行股份有限公司 | Method, device, equipment and computer readable medium for data synchronization |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7739351B2 (en) * | 2004-03-23 | 2010-06-15 | Salesforce.Com, Inc. | Synchronous interface to asynchronous processes |
| EP3611871B1 (en) * | 2013-09-19 | 2021-12-08 | Intel Corporation | Technologies for synchronizing and restoring reference templates |
-
2020
- 2020-08-17 CN CN202010827913.6A patent/CN113760871B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104978385A (en) * | 2015-03-19 | 2015-10-14 | 腾讯科技（深圳）有限公司 | Information processing method, browser client and terminal |
| CN107807931A (en) * | 2016-09-09 | 2018-03-16 | 北京京东尚科信息技术有限公司 | The method and system of Template Information management |
| CN107342820A (en) * | 2017-01-09 | 2017-11-10 | 烽火通信科技股份有限公司 | VOLT method and system are realized based on Template Manager |
| CN108628812A (en) * | 2017-03-16 | 2018-10-09 | 北京京东尚科信息技术有限公司 | Method, apparatus, electronic equipment and the readable storage medium storing program for executing of self-defined face single mode plate |
| CN110222293A (en) * | 2019-04-30 | 2019-09-10 | 北京三快在线科技有限公司 | A kind of forms pages generation method and device |
| CN110290049A (en) * | 2019-05-20 | 2019-09-27 | 深圳壹账通智能科技有限公司 | Information push method, server and computer readable storage medium |
| CN110795443A (en) * | 2019-10-08 | 2020-02-14 | 中国建设银行股份有限公司 | Method, device, equipment and computer readable medium for data synchronization |
Non-Patent Citations (1)
| Title |
|---|
| 一种基于XML的任务驱动型数据传输与同步方法;乔得吉;肖卫东;;计算机科学;20160615(S1);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113760871A (en) | 2021-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110310034B (en) | Service arrangement and business flow processing method and device applied to SaaS | |
| CN110601952B (en) | Multi-channel message notification sending method and device | |
| US8326703B2 (en) | Architectural design for product catalog management application software | |
| CN111030784A (en) | Information synchronization method and device | |
| KR101283019B1 (en) | Method of generating saas appication and server performing the same | |
| US11381488B2 (en) | Centralized, scalable, resource monitoring system | |
| CN110851468A (en) | Method and device for making simulation response to test request of client | |
| CN112860342A (en) | Method, device, equipment, system and storage medium for microservice configuration | |
| CN112445868A (en) | Service message processing method and device | |
| CN111126948A (en) | Processing method and device for approval process | |
| CN111708836B (en) | Cluster management method, device and cluster system | |
| CN113672357A (en) | Task scheduling method, device and system | |
| CN110389976B (en) | Multi-interface data scheduling method and device | |
| CN110324384B (en) | Data pushing method and device | |
| CN113780969B (en) | Customs declaration method and system | |
| CN113760871B (en) | Template synchronization method and device | |
| CN115577040A (en) | Hierarchical data synchronization method and device, electronic equipment and readable medium | |
| US10067808B2 (en) | Nondeterministic operation execution environment utilizing resource registry | |
| CN112686580A (en) | Workflow definition method and system capable of customizing flow | |
| CN107203724A (en) | File submits method and apparatus | |
| CN112671877B (en) | Data processing method and device | |
| CN115526587A (en) | Method and device for generating customs message | |
| CN112836201A (en) | Method, device, equipment and computer readable medium for multi-platform information intercommunication | |
| CN115309612B (en) | Method and device for monitoring data | |
| US20200401993A1 (en) | Implementation of rolling key to identify systems inventories |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |