CN114971566A - Activiti-based predefined process dynamic approval method, system and storage medium - Google Patents
Activiti-based predefined process dynamic approval method, system and storage medium Download PDFInfo
- Publication number
- CN114971566A CN114971566A CN202210626172.4A CN202210626172A CN114971566A CN 114971566 A CN114971566 A CN 114971566A CN 202210626172 A CN202210626172 A CN 202210626172A CN 114971566 A CN114971566 A CN 114971566A
- Authority
- CN
- China
- Prior art keywords
- node
- approval
- returned
- task
- predefined process
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 105
- 230000000694 effects Effects 0.000 title claims abstract description 15
- 238000004540 process dynamic Methods 0.000 title claims abstract description 11
- 239000003999 initiator Substances 0.000 claims abstract description 4
- 230000000052 comparative effect Effects 0.000 claims description 3
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012217 deletion Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method, a system and a storage medium for predefining a process dynamic approval based on Activiti, and belongs to the technical field of process dynamic approval. The problem that the process approval system cannot quickly find the nodes to be returned is solved. The dynamic approval method based on the Activiti predefined process comprises the following steps of: step S1: starting: selecting predefined process data, and dynamically transmitting a process associated data id, a process variable, a process initiator and a next-level approver; step S2: approval: the process variable is transmitted into the task, the gateway executes the task according to the predefined process data according to the variable, and a next-level approver is set; step S3: and (3) rollback: and receiving a backspacing signal, acquiring a passed previous-stage node, and backspacing the node to the previous-stage node until the node is returned to the node to be returned. The invention is a general step-by-step backspacing method, quickly finds nodes to be returned, improves the development efficiency, and has the characteristics of reusability, strong transportability and strong universality.
Description
Technical Field
The invention belongs to the technical field of dynamic approval of processes, and particularly relates to a method, a system and a storage medium for predefined dynamic approval of processes based on Activiti.
Background
The process approval exists in daily offices and is also an important work. In the traditional process approval process, various problems such as timeliness of personnel approval seriously affect the process approval efficiency, further affect the office efficiency and the operation speed, and bring many problems to the progress development of work.
Particularly, in the process of approval, if the existing process approval system needs to return, the existing process approval system cannot quickly find a node to be returned, so that time delay is easily caused, and the approval efficiency is affected.
Disclosure of Invention
The invention provides a dynamic approval method, a system and a storage medium based on an Activiti predefined process, which can quickly acquire nodes needing to be backed and return approval tasks.
The first object of the present invention can be achieved by the following technical solutions: a dynamic approval method based on an Activiti predefined process is characterized by comprising the following steps:
step S1: starting: selecting predefined process data, and dynamically transmitting a process associated data id, a process variable, a process initiator and a next-level approver;
step S2: approval: the process variable is transmitted into the task, the gateway executes the task according to the predefined process data according to the variable, and a next-level approver is set;
step S3: and (3) rollback: and receiving a backspacing signal, acquiring a passed previous-stage node, and backspacing the node to the previous-stage node until the node is returned to the node to be returned.
The working principle of the invention is as follows: by obtaining the upper-level node until the node returns to the return result, the node to be returned can be quickly found, the examination and approval process is saved, and the examination and approval efficiency is improved.
In the above dynamic approval method based on actinti predefined process, the step S3 includes the following steps:
let the user submit the application as X and let the final approval as X N Setting the intermediate approval link as X 2 To X N-1 ；
Step S3.1: acquiring a reversed-order arrangement table A of the traveled path;
step S3.2: performing de-duplication according to A [ ] to obtain a list B [ ];
step S3.3: cycle B [ ] comparing A [ ] -1 to obtain nodes with repetition number greater than 1 and counting to obtain C [ ];
step S3.4: reversely circulating A [ ] and deleting the data in A [ ] according to C [ ] to obtain D [ ];
step S3.5: the A is reversed and the repeated second node is deleted according to the C to obtain the E;
step S3.6: circulating D and adding F to obtain F until the comparative value is E size-1;
step S3.7: and judging the reverse cycle E and comparing the reverse cycle E with the reverse cycle F to obtain a node to be returned.
In the above dynamic approval method based on the actinti predefined process, in step S3.7, the method further includes the following steps:
step S3.7.1: if the node to be returned can be obtained by reversing the cycle E and comparing the F, the node to be returned is F-1;
step S3.7.2: if the node to be rejected cannot be obtained by reversing cycle E and comparing F, the node to be rejected is E size-1.
In the above dynamic approval method based on the actinti predefined process, the method further includes: step S4: delegating: and receiving a delegation signal, and appointing the examining and approving person again in the running process.
In the above dynamic approval method based on the actinti predefined process, the method further includes: step S5: withdrawing: and receiving an active withdrawal signal, and withdrawing the approved process.
In the above dynamic approval method based on the actinti predefined process, the method further includes: step S6: and (3) cancelling: and receiving a cancel signal, canceling the initiated flow and deleting the task.
In the above dynamic approval method based on the actinti predefined process, the method further includes: step S7: and (3) task query: and receiving a task query signal, and querying the task to be handled or the processed task.
In the above dynamic approval method based on the actinti predefined process, the method further includes: step S8: and (6) viewing: and reading the flow node flow chart and the task handling record.
The second object of the present invention can be achieved by the following technical solutions: an apparatus for dynamic approval of predefined processes based on Activiti, comprising an input, an output, a server, one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs comprising instructions for performing the above-described method for dynamic approval of predefined processes based on Activiti.
The third object of the present invention can be achieved by the following technical solutions: a computer readable storage medium storing a computer program executable by a processor to perform the above-mentioned method for dynamic approval based on an actinti predefined process.
Compared with the prior art, the invention has the advantages of saving the examination and approval process and improving the examination and approval efficiency.
Drawings
FIG. 1 is a logic flow diagram of the present invention.
Fig. 2 is a logic flow diagram of step S3 in the present invention.
FIG. 3 is a schematic view of the approval process of the present invention.
Detailed Description
The following are specific embodiments of the present invention and are further described with reference to the drawings, but the present invention is not limited to these embodiments.
As shown in fig. 1 and fig. 2, the dynamic approval method based on the Activiti predefined process includes the following steps:
step S1: starting: selecting predefined process data, and dynamically transmitting a process associated data id, a process variable, a process initiator and a next-level approver;
step S2: approval: the process variable is transmitted into the task, the gateway executes the task according to the predefined process data according to the variable, and a next-level approver is set;
step S3: and (3) rollback: and receiving a backspacing signal, acquiring a passed previous-stage node, and backspacing the node to the previous-stage node until the node is returned to the node to be returned.
In more detail, the step S3 includes the following steps:
let the user submit the application as X and let the final approval as X N Setting the intermediate approval link as X 2 To X N-1 ；
Step S3.1: acquiring a reversed-order arrangement table A of the traveled path;
step S3.2: carrying out de-duplication according to the A to obtain a list B;
step S3.3: cycle B [ ] comparing A [ ] -1 to obtain nodes with repetition number greater than 1 and counting to obtain C [ ];
step S3.4: reversely circulating A [ ] and deleting the data in A [ ] according to C [ ] to obtain D [ ];
step S3.5: the A is reversed and the repeated second node is deleted according to the C to obtain the E;
step S3.6: circulating D and adding F to obtain F until the comparative value is E size-1;
step S3.7: and judging the reverse cycle E [ ] and comparing the reverse cycle E [ ] to obtain a returned node to be returned.
In more detail, the step S3.7 further includes the following steps:
step S3.7.1: if the node to be returned can be obtained by reversing the cycle E and comparing the F, the node to be returned is F-1;
step S3.7.2: if the node to be rejected cannot be obtained by reversing cycle E and comparing F, the node to be rejected is E size-1.
In further detail, the method also comprises the following steps: step S4: delegating: and receiving a delegation signal, and appointing the examining and approving person again in the running process.
In further detail, the method also comprises the following steps: step S5: withdrawing: and receiving an active withdrawal signal, and withdrawing the approved process.
In further detail, the method also comprises the following steps: step S6: and (3) cancellation: and receiving a cancel signal, canceling the initiated flow and deleting the task.
In further detail, the method also comprises the following steps: step S7: and (3) task query: and receiving a task query signal, and querying the task to be handled or the processed task.
In further detail, the method also comprises the following steps: step S8: checking: and reading the flow node flow chart and the task handling record.
As shown in fig. 2 and 3:
example 1: user submits application as X 1 First-order approval is X 2 Second level approval is X 3 And the third level approval is X 4 And the final approval is X 5 。
The user submits the examination and approval to the second examination and approval for the first time until the user finds that the examination and approval should be firstly carried out from the first examination and approval and needs to return to the third examination and approval when finally examining and approving, and the obtained node path is [ X ] 1 ，X 3 ，X 4 ，X 5 ]And finally approval is carried out at present.
Obtaining the reversed order arrangement table A [ X ] of the traveled path 1 ,X 3 ,X 4 ,X 5 ]；
In the above range of A]De-duplication is performed to obtain list B [ X ] 1 ,X 3 ,X 4 ,X 5 ]；
Cycle B [ 2 ]]And compare A [ 2 ]]-1 finding out the number of internal repetitions greater than 1 to obtain C [ { X [ ] 1 ＝1},{X 2 ＝1},{X 3 ＝1},{X 4 ＝1}]；
Reverse circulation A2]And according to C2]Deletion of A [ 2 ]]Obtaining D [ X ] from the data 1 ,X 3 ,X 4 ,X 5 ]；
Reverse circulation A2]And according to C2]Deleting the second post-deletion of the repeat to obtain E [ X ] 1 ,X 3 ,X 4 ,X 5 ]；
Cycle D [ 2 ]]And added to F2]Contrast value in circulation is E [ size-1]]To obtain F [ X ] 1 ,X 3 ,X 4 ]；
Reverse circulation E [ 2 ]]And compare F2]Finding returns to get the last node, so the node should be returned to: x 4 I.e. three-level approval.
Example 2: user submits application as X 1 First-order approval is X 2 Second level approval is X 3 And the third level approval is X 4 And the final approval is X 5 。
The user submits to the second-level examination and approval for the first time, the user returns to the user after finding that the first-level examination and approval is needed before the final examination and approval, the user finds that the second-level information is wrongly written when submitting to the first-level examination and approval for the second time and finally approving, and the user returns to the first-level examination and approval after finding that the second-level information is wrongly written. The current node path is [ X ] 1 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 1 ,X 2 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ]And (6) currently, performing secondary approval.
Obtaining the reversed order arrangement table A [ X ] of the traveled path 1 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 1 ,X 2 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ]；
In the above range of A]De-duplication is performed to obtain list B [ X ] 1 ,X 3 ,X 4 ,X 5 ,X 2 ]；
Cycle B [ 2 ]]And compare A [ 2 ]]-1 finding the number of internal repeats greater than 1 to obtain CxX 4 ,X 3 ,X 1 ,X 3 ,X 4 ,X 5 ,X 4 ]I.e. C [ { X [ ] 1 ＝1},{X 3 ＝2},{X 4 ＝3},{X 5 ＝1}]；
Reverse circulation A2]And according to C2]Delete A2]Obtaining D [ X ] from the data 1 ,X 2 ,X 3 ,X 5 ,X 4 ,X 3 ]；
Reverse circulation A2]And according to C2]Deleting the second post-deletion of the repeat to obtain E [ X ] 1 ,X 2 ,X 5 ,X 4 ,X 3 ]；
Cycle D [ 2 ]]And added to F2]Contrast value in circulation is E [ size-1]]To obtain F [ X ] 1 ,X 2 ]；
Reverse circulation E [ 2 ]]And compare F2]Finding returns to get the last node, so the node should be returned to: x 2 I.e., a first level of approval.
Example 3: user submits application as X 1 First-order approval is X 2 Second level approval is X 3 And the third-level approval is X 4 And the final approval is X 5 。
The method comprises the steps that a user submits to a second-level examination and approval for the first time, the user returns to the user after finding that the first-level examination and approval should be carried out firstly when the user finally submits to the first-level examination and approval, the user finds that second-level examination and approval information is wrongly filled when the user finally submits to the first-level examination and approval, the user finds that the second-level examination and approval information is wrongly filled when the user secondly submits to the first-level examination and approval, the user returns to the first-level examination and approval when the user secondly submits to the second-level examination and approval, the user finally finishes the third-level examination and approval, the user returns to the third-level examination and approval after the third-level examination and approval is carried out, the user returns to the third-level examination and approval after finding that the third-level examination and approval is supplemented with a material, and the current node path is [ X 1 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 1 ,X 2 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 2 ,X 1 ,X 4 ,X 5 ,X 4 ]Currently, three-level approval.
Obtaining the reversed order arrangement table A [ X ] of the traveled path 1 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 1 ,X 2 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 2 ,X 1 ,X 4 ,X 5 ,X 4 ]；
In the above range of A]De-duplication is performed to obtain list B [ X ] 1 ,X 2 ,X 3 ,X 4 ,X 5 ]；
Cycle B [ 2 ]]And compare A [ 2 ]]-1 finding the number of internal repeats greater than 1 to obtain CxX 1 ,X 3 ,X 4 ,X 5 ,X 4 ,X 3 ,X 4 ,X 3 ,X 2 ,X 1 ,X 4 ,X 5 ,]I.e. C [ { X [ ] 1 ＝2},{X 2 ＝1},{X 3 ＝3},{X 4 ＝4},{X 5 ＝2}]；
Reverse circulation A [ 2 ]]And according to C2]Delete A2]Obtaining D [ X ] from the data 3 ,X 2 ,X 1 ,X 4 ,X 5 ,X 4 ]；
Reverse circulation A [ 2 ]]And according to C2]Deleting the second post-deletion of the repeat to obtain E [ X ] 3 ,X 2 ,X 1 ,X 5 ,X 4 ]；
Cycle D [ 2 ]]And added to F2]Contrast value in circulation is E [ size-1]]To obtain F [ X ] 3 ,X 2 ,X 1 ]；
Reverse circulation E [ 2 ]]And compare F2]Finding returns to get the last node, so the node should be returned to: x 1 I.e. the user.
The device for dynamically approving the predefined processes based on the Activiti comprises an input end, an output end, a server, one or more processors, a memory and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the programs comprise a program for executing the above method for dynamically approving the predefined processes based on the Activiti.
The computer readable storage medium stores a computer program executable by a processor to perform the above-mentioned method for dynamic approval based on an actinti predefined process.
The specific embodiments described herein are merely illustrative of the spirit of the invention. Various modifications or additions may be made to the described embodiments or alternatives may be employed by those skilled in the art without departing from the spirit or ambit of the invention as defined in the appended claims.
Although a large number of terms are used here more, the possibility of using other terms is not excluded. These terms are used merely to more conveniently describe and explain the nature of the present invention; they are to be construed as being without limitation to any additional limitations that may be imposed by the spirit of the present invention.
Claims (10)
1. A dynamic approval method based on an Activiti predefined process is characterized by comprising the following steps:
step S1: starting: selecting predefined process data, and dynamically transmitting a process associated data id, a process variable, a process initiator and a next-level approver;
step S2: approval: the process variable is transmitted into the task, the gateway executes the task according to the predefined process data according to the variable, and a next-level approver is set;
step S3: and (3) returning: and receiving a backspacing signal, acquiring a passed previous-stage node, and backspacing the node to the previous-stage node until the node is returned to the node to be returned.
2. The method according to claim 1, wherein the step S3 comprises the following steps:
let the user submit the application as X and let the final approval as X N Setting the intermediate approval link as X 2 To X N-1 ；
Step S3.1: acquiring a reversed-order arrangement table A of the traveled path;
step S3.2: performing de-duplication according to A [ ] to obtain a list B [ ];
step S3.3: loop B [ ] comparing a [ ] -1 to obtain nodes with a number of repeats greater than 1 and counting to obtain C [ ];
step S3.4: reversely circulating A [ ] and deleting the data in A [ ] according to C [ ] to obtain D [ ];
step S3.5: the A is reversed and the repeated second node is deleted according to the C to obtain the E;
step S3.6: circulating D and adding to F until the comparative value of the circulation is E [ size-1] to obtain F;
step S3.7: and judging the reverse cycle E [ ] and comparing the reverse cycle E [ ] to obtain a returned node to be returned.
3. The method for dynamic approval of a predefined process based on actinti according to claim 2, wherein said step S3.7 further comprises the steps of:
step S3.7.1: if the node to be returned can be obtained by reversing the cycle E and comparing the F, the node to be returned is F-1;
step S3.7.2: if the node to be rejected cannot be obtained by reversing cycle E and comparing F, the node to be rejected is E size-1.
4. The method for predefined process dynamic approval based on activit according to claim 1, further comprising: step S4: delegating: and receiving a delegation signal, and appointing the examining and approving person again in the running process.
5. The method for predefined process dynamic approval based on activit according to claim 1, further comprising: step S5: withdrawing: and receiving an active withdrawal signal, and withdrawing the approved process.
6. The method for predefined process dynamic approval based on activit according to claim 1, further comprising: step S6: and (3) cancelling: and receiving a cancel signal, canceling the initiated flow and deleting the task.
7. The method for predefined process dynamic approval based on activit according to claim 1, further comprising: step S7: and (3) task query: and receiving a task query signal, and querying the task to be handled or the processed task.
8. The method for predefined process dynamic approval based on activit according to claim 1, further comprising: step S8: and (6) viewing: and reading the flow node flow chart and the task handling record.
9. An apparatus for predefined process dynamic approval based on Activiti, comprising an input, an output, a server, one or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs comprising instructions for performing the predefined process dynamic approval based on Activiti method of any one of claims 1-9.
10. A computer readable storage medium storing a computer program executable by a processor to perform the method for dynamic approval based on an actinti predefined procedure according to any one of claims 1 to 9.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2022106115357 | 2022-05-31 | ||
| CN202210611535 | 2022-05-31 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114971566A true CN114971566A (en) | 2022-08-30 |
Family
ID=82959658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210626172.4A Pending CN114971566A (en) | 2022-05-31 | 2022-06-02 | Activiti-based predefined process dynamic approval method, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114971566A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109146227A (en) * | 2018-06-26 | 2019-01-04 | 四川驹马科技有限公司 | A kind of parallel measures and procedures for the examination and approval of workflow and its system |
| CN110619473A (en) * | 2019-09-19 | 2019-12-27 | 福建博思软件股份有限公司 | Method for realizing reverse circulation based on Activiti workflow |
| CN111369225A (en) * | 2020-03-18 | 2020-07-03 | 浩云科技股份有限公司 | Special safety inspection work system |
| CN111897815A (en) * | 2020-07-15 | 2020-11-06 | 中国建设银行股份有限公司 | Service processing method and device |
| CN113535684A (en) * | 2021-07-26 | 2021-10-22 | 北京计算机技术及应用研究所 | Activiti-based autonomous command control method |
-
2022
- 2022-06-02 CN CN202210626172.4A patent/CN114971566A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109146227A (en) * | 2018-06-26 | 2019-01-04 | 四川驹马科技有限公司 | A kind of parallel measures and procedures for the examination and approval of workflow and its system |
| CN110619473A (en) * | 2019-09-19 | 2019-12-27 | 福建博思软件股份有限公司 | Method for realizing reverse circulation based on Activiti workflow |
| CN111369225A (en) * | 2020-03-18 | 2020-07-03 | 浩云科技股份有限公司 | Special safety inspection work system |
| CN111897815A (en) * | 2020-07-15 | 2020-11-06 | 中国建设银行股份有限公司 | Service processing method and device |
| CN113535684A (en) * | 2021-07-26 | 2021-10-22 | 北京计算机技术及应用研究所 | Activiti-based autonomous command control method |
Non-Patent Citations (2)
| Title |
|---|
| 任铭亮等: "基于Activiti的工作流引擎在中小企业中的应用研究", 《中国高新技术企业》 * |
| 李秋荻等: "基于Activiti流程管理关键技术设计与实现", 《科研信息化技术与应用》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9129038B2 (en) | Discovering and exploiting relationships in software repositories | |
| US9928113B2 (en) | Intelligent compiler for parallel graph processing | |
| US8380680B2 (en) | Piecemeal list prefetch | |
| US10394694B2 (en) | Unexplored branch search in hybrid fuzz testing of software binaries | |
| CN112463886B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN117076719B (en) | Database joint query method, device and equipment based on large language model | |
| CN109947804B (en) | Data set query optimization method and device, server and storage medium | |
| CN113661488A (en) | Method for accessing data records of a master data management system | |
| CN112818181B (en) | Graph database searching method, system, computer device and storage medium | |
| EP4193268A1 (en) | Data processing systems and methods for automatically redacting unstructured data from a data subject access request | |
| US20150120697A1 (en) | System and method for analysis of a database proxy | |
| CN108140022B (en) | Data query method and database system | |
| CN111737564A (en) | Information query method, device, equipment and medium | |
| CN108549666B (en) | Data table sorting method, device, equipment and storage medium | |
| CN114647853A (en) | Method and system for improving distributed application program vulnerability detection accuracy | |
| US20170262507A1 (en) | Feedback mechanism for query execution | |
| CN114971566A (en) | Activiti-based predefined process dynamic approval method, system and storage medium | |
| CN109542912B (en) | Interval data storage method, device, server and storage medium | |
| Kripke | Ungroundedness in Tarskian languages | |
| CN109344145A (en) | A kind of data cleaning method based on data standard specification, device and system | |
| CN109241027B (en) | Data migration method, device, electronic equipment and computer readable storage medium | |
| CN113282616A (en) | Incremental time sequence data conflict detection method and device and storage medium | |
| CN112307272A (en) | Method and device for determining relation information between objects, computing equipment and storage medium | |
| CN111625570A (en) | List data resource retrieval method and device | |
| KR100588739B1 (en) | Method for preventing duplication of internet documents |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220830 |