Data query method and device for process task, terminal equipment and medium

Abstract

The embodiment of the invention provides a data query method and device for a process task, terminal equipment and a medium, and belongs to the technical field of data processing. The method comprises the following steps: setting a trigger mechanism, and loading a corresponding to-do task in a process system according to the trigger mechanism; obtaining a current process node corresponding to the to-do task, and determining an initial user corresponding to the current process node and an initial identifier corresponding to the initial user; performing data caching on the initial identifier and the current process node to obtain a target caching result; obtaining a target identifier corresponding to the target user, and performing flow query from the target cache result according to the target identifier to obtain a target flow node corresponding to the target user; and generating a target query result corresponding to the target user according to the target process node and the to-do task. The problem that the user experience is affected due to the fact that flow query is time-consuming in the prior art is solved, and the flow query efficiency and the user experience are improved.

Description

Technical Field

[0001] The present invention relates to the field of data processing technology, and in particular to a data query method, device, terminal equipment and medium for a process task. Background Art

[0002] Workflow systems are commonly used management tools in large companies, and many workflow engine solutions are usually based on relational databases. Due to differences in organizational structure, industry characteristics, and cultural environment among companies, basic workflow engines usually need to be customized to meet the company's specific management needs. This customized development often increases the complexity of the system because it needs to handle more business logic and special requirements. The database not only involves the relevant tables of the process engine, but also includes business data.

[0003] For example, originally the task would flow to Department A, but due to the division of the company's business sectors, Team C of Department B also needs to participate in the processing. This complex situation makes the task calculation more complicated, and the time required to query the task is significantly increased. When employees query their own to-do tasks, they usually need to query multiple tables and calculate specific business logic to find the process that needs to be processed. This process may take several seconds or even more than ten seconds, affecting the user experience, and querying to-do tasks is a high-frequency operation for employees. Therefore, an efficient data query method is needed to improve query efficiency and user experience. Summary of the invention

[0004] The main purpose of the embodiments of the present invention is to provide a data query method, apparatus, terminal device and medium for a process task, aiming to solve the problem in the related art that process query is time-consuming and affects user experience.

[0005] In a first aspect, an embodiment of the present invention provides a data query method for a process task, comprising:

[0006] Set a trigger mechanism and load the corresponding to-do tasks in the process system according to the trigger mechanism;

[0007] Obtaining a current process node corresponding to the pending task, and determining an initial user corresponding to the current process node and an initial identifier corresponding to the initial user;

[0008] Cache the initial identifier and the current process node to obtain a target cache result;

[0009] Obtain a target identifier corresponding to a target user, and perform a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user;

[0010] A target query result corresponding to the target user is generated according to the target process node and the to-be-done task.

[0011] In a second aspect, an embodiment of the present invention provides a data query device for a process task, comprising:

[0012] A data loading module is used to set a trigger mechanism and load the corresponding to-do tasks in the process system according to the trigger mechanism;

[0013] A data acquisition module, used to obtain the current process node corresponding to the pending task, and determine the initial user corresponding to the current process node and the initial identifier corresponding to the initial user;

[0014] A data cache module, used for caching the initial identifier and the current process node to obtain a target cache result;

[0015] A data query module is used to obtain a target identifier corresponding to a target user, and perform a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user;

[0016] A result determination module is used to generate a target query result corresponding to the target user according to the target process node and the to-be-done task.

[0017] In a third aspect, an embodiment of the present invention further provides a terminal device, comprising a processor, a memory, a computer program stored in the memory and executable by the processor, and a data bus for realizing connection and communication between the processor and the memory, wherein when the computer program is executed by the processor, the steps of the data query method of any process task provided in the specification of the present invention are implemented.

[0018] In a fourth aspect, an embodiment of the present invention further provides a storage medium for computer-readable storage, characterized in that the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the data query method of any process task provided in the specification of the present invention.

[0019] The embodiment of the present invention provides a data query method, device, terminal device and medium for process tasks. The method includes: by setting a trigger mechanism, the to-do tasks in the work flow can be automatically managed, thereby reducing manual intervention and improving work efficiency. Obtaining the current process node corresponding to the to-do task and the initial identifier of the initial user helps to accurately identify the status and responsible person of the task, and ensure that the task can be assigned to the correct person for processing. Caching the data of the initial identifier and the current process node can effectively reduce repeated calculations, improve the system response speed, and thus improve the efficiency of task query and processing. Obtaining the target process node from the cached result through the identifier of the target user can provide each user with personalized task query results, so that the user can clearly understand the tasks to be processed and their current status. This method helps to quickly locate and obtain relevant task information, reduce unnecessary query overhead, and improve the accuracy and efficiency of information retrieval. Finally, the target query result is generated through the target process node and the to-do task, so that the target user can clearly see his or her task progress and status, enhance the transparency of the system, and thus improve the work efficiency and satisfaction of the user. The method also solves the problem that process query is relatively time-consuming and affects the user experience in the related art, and improves the process query efficiency and user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0021] Figure 1 A flowchart of a data query method for a process task provided by an embodiment of the present invention;

[0022] Figure 2 for Figure 1 Schematic diagram of the sub-step S103 of the data query method of the process task in;

[0023] Figure 3 A schematic diagram of a scenario for implementing the data query method for a process task provided in this embodiment;

[0024] Figure 4 A schematic diagram of the module structure of a data query device for a process task provided by an embodiment of the present invention;

[0025] Figure 5 A schematic block diagram of the structure of a terminal device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0026] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0027] The flowcharts shown in the accompanying drawings are only examples and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may also be decomposed, combined or partially merged, so the actual execution order may change according to actual conditions.

[0028] It should be understood that the terms used in this specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the specification of the present invention and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.

[0029] The embodiment of the present invention provides a data query method, apparatus, terminal device and medium for a process task. The data query method for a process task can be applied to a terminal device, which can be an electronic device such as a tablet computer, a laptop computer, a desktop computer, a personal digital assistant and a wearable device. The terminal device can be a server or a server cluster.

[0030] Some embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.

[0031] Please refer to Figure 1 , Figure 1 A flowchart of a data query method for a process task provided by an embodiment of the present invention.

[0032] like Figure 1 As shown, the data query method of the process task includes steps S101 to S105.

[0033] Step S101: setting a trigger mechanism, and loading corresponding to-do tasks in the process system according to the trigger mechanism.

[0034] For example, determine the trigger condition: clarify what kind of event or state change will serve as the trigger mechanism. For example, a user submits a form, a task reaches a specific time, a process state changes, etc., and the trigger mechanism can be implemented based on event-driven (such as a message queue) or scheduled tasks (such as a timer).

[0035] For example, in the insurance field, when the insurance policy needs to be reviewed by various process personnel, an event listener is set. When the current process status changes, the listener will trigger the corresponding operation and then load the corresponding to-do tasks in the process system.

[0036] For example, after setting the trigger mechanism according to the trigger condition, when the trigger condition triggers the corresponding trigger mechanism, the unfinished tasks in the loading process system are determined as pending tasks, so that the trigger mechanism can be effectively implemented and the pending tasks in the loading process system can be loaded according to the trigger condition. This implementation method is helpful for automated process management and improves the response efficiency and task processing capability of the system.

[0037] In some embodiments, the trigger mechanism is a timing mechanism, and loading the corresponding to-do tasks in the process system according to the trigger mechanism includes: obtaining department information contained in the process system; loading the tasks in the department information according to the timing mechanism to obtain the initial tasks; determining a special situation table, and adjusting the initial tasks according to the special situation table to obtain the to-do tasks.

[0038] Exemplarily, the trigger mechanism is a timing mechanism, for example, loading the to-do task at a preset time point or after a preset time period. Thus, a timer is configured in the process system to trigger the task loading operation under the predetermined timing mechanism, thereby ensuring that the timing mechanism can run at the expected time.

[0039] For example, select an appropriate timing mechanism (such as a Cron job, timer, or task scheduling system). Configure the execution frequency and interval of the timer, such as every hour or at a specific time every day.

[0040] Exemplarily, department information corresponding to all users is loaded from a database corresponding to the process system, and tasks in the processing flow corresponding to the department information are loaded according to a timing mechanism to obtain initial tasks.

[0041] Exemplarily, a special situation table is established according to the special needs of the user, such as whether the special attributes of a process enable the next node of the process to be processed by a special person, etc., so that the initial task is adjusted according to the special situation table to obtain the to-do task.

[0042] For example, prepare a special situation table to define the task types or conditions that require special processing. For example: special task priority, special processing rules (such as holidays, emergency task processing). In addition, it is necessary to ensure that the maintenance of the special situation table is dynamic to adapt to changes in business tasks. In this way, the initial tasks that meet the conditions of the special situation table can be adjusted, such as: adjusting task priority, reallocating initial tasks to different personnel or departments, modifying the processing flow or deadline of initial tasks, and ensuring that task adjustments meet business needs and process requirements. After completing task adjustments, the final to-do tasks are generated.

[0043] Specifically, through automated task loading and adjustment, the speed and accuracy of task processing can be significantly improved. The combination of timing mechanism and special case handling improves the intelligence level of the system, making task management more efficient and reliable. Through reasonable task allocation and adjustment, the overall workflow can be optimized and the overall operational efficiency of the organization can be improved.

[0044] Step S102: obtaining the current process node corresponding to the pending task, and determining the initial user corresponding to the current process node and the initial identifier corresponding to the initial user.

[0045] Exemplarily, detailed information corresponding to the pending task is obtained. Usually, the detailed information includes basic attributes of the task, such as task ID, current process node, current status, associated process, current responsible person, unique ID corresponding to the current responsible person, etc. Thus, the current process node can be identified from the detailed information corresponding to the pending task.

[0046] Exemplarily, the current responsible person is identified from the detailed information corresponding to the to-do task, and then the current responsible person is determined as the initial user, and the unique ID corresponding to the current responsible person is determined as the initial identification corresponding to the initial user.

[0047] Step S103: cache the initial identifier and the current process node to obtain a target cache result.

[0048] Exemplarily, the initial identifier is determined as a unique cache key, and then the current process nodes are merged according to the initial identifier to obtain all process nodes corresponding to the initial identifier, and then a key-value pair is constructed based on the initial identifier and all process nodes to obtain a construction result, and the construction result is stored in the cache to obtain a target cache result.

[0049] For example, the initial identifier and all process node information are encapsulated into a simple cache object or JSON structure for easy storage. The API provided by the cache technology is used to write data into the cache to obtain the target cache result.

[0050] In one embodiment, the initial identifier and the current process node are cached to obtain a target cache result. Specifically, refer to Figure 2 , step S103 includes: sub-step S1031 to sub-step S1034.

[0051] Sub-step S1031, determining the process identifier and process data corresponding to the current process node.

[0052] Exemplarily, a process identifier is extracted from the current process node. The process identifier is usually a unique identifier used to identify the current process instance. And process data associated with the process identifier is obtained from the current process node. The process data includes all information related to the current process state, such as task lists, node states, execution history, etc.

[0053] Sub-step S1032, combining the process identifier and the initial identifier to obtain a combined identifier.

[0054] Exemplarily, the process identifier and the initial identifier are combined. A separator (such as "-" or "_") may be used to connect the two identifiers to form a unique combined identifier. Ensure that the combined identifier is unique and can be used to retrieve related data.

[0055] Sub-step S1033, constructing a key-value pair according to the merge identifier and the process data to obtain a combination result.

[0056] For example, ensure that the merge identifier conforms to the expected format and does not conflict in different systems. You can ensure its consistency through standardization operations. Use the merge identifier as the key and the process data as the value to build a key-value pair. This key-value pair is used to store and retrieve related data. Ensure that the key-value pair is in the correct format and can be serialized into a format suitable for storage, such as JSON, XML, or a simple key-value pair format.

[0057] Sub-step S1034, determining a cache tool, and storing the combination result in the cache tool to obtain the target cache result.

[0058] Exemplarily, a cache tool is determined, and the combined result is stored in the cache tool to obtain a target cache result. Common cache tools include but are not limited to Redis, Memcached, EhCache, etc. The selection of a suitable tool is usually based on performance requirements, data volume, and system architecture.

[0059] Specifically, generating a merge identifier ensures that each piece of data can be uniquely identified, avoiding data conflicts or overwriting, and improving the accuracy of data management. The merge identifier provides a clear retrieval path for the data, making it more efficient when data needs to be found or operated. The data is stored in the form of key-value pairs, and the structured data format is easier to manage, query, and maintain. The key-value pair storage method makes data reading and writing operations more efficient and reduces access latency. Caching technology can effectively handle high-concurrency requests and improve the system's concurrent processing capabilities.

[0060] Step S104: Obtain a target identifier corresponding to the target user, and perform a process query from the target cache result according to the target identifier to obtain a target process node corresponding to the target user.

[0061] Exemplarily, if the target user is a user who performs a process query, a target identifier corresponding to the target user is obtained, and then a process query is performed from the target cache result according to the target identifier, thereby obtaining a target process node corresponding to the target user.

[0062] For example, the target ID is used as a query key to retrieve the target process node corresponding to the target user from the target cache result.

[0063] Exemplarily, the data query method of the process task combines the advantages of relational database and distributed cache. The process engine and business data are stored in the relational database, which is suitable for large and complex business operations. The disadvantage is that the query response is slow; the distributed cache is a non-relational database, which is not suitable for large-scale business calculations, but supports fast queries. This solution decouples the calculation and query of task to-dos, and batch calculates all to-do tasks for all target users when the application is initialized. Although this process takes a long time, it is only executed once. The initialized batch calculation combines the process engine, employee role department, special business data tables, special management requirements, etc., and assigns each process to the corresponding to-do person. The final result data is a simple KV key-value pair and is stored in the distributed cache. When the target user queries his to-do, the cache query returns the result quickly, improving the user experience and making the complex calculation logic imperceptible to the user.

[0064] In some embodiments, performing a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user includes: generating a corresponding fuzzy query structure according to the target identifier; performing a process query in the target cache result using the fuzzy query structure to obtain the target process node corresponding to the target user.

[0065] Exemplarily, the rules and scope of the fuzzy query are determined. For example, a wildcard can be established according to the target identifier for fuzzy matching, and when the key in the target cache result contains the target identifier, the corresponding target process node can be matched according to the fuzzy matching.

[0066] Exemplarily, according to the defined rules, the target identifier is converted into a fuzzy query structure. The fuzzy query structure usually includes a search condition, a wildcard or a regular expression, which is used for matching in the cache data.

[0067] Exemplarily, a query operation is performed in the cache system using a fuzzy query structure. The specific operation may include using a specific query interface, filter, or search engine function to match the fuzzy query condition. Data matching the fuzzy query structure is retrieved from the target cache result. The query result should contain all information related to the target identifier, so as to obtain the target process node corresponding to the target user.

[0068] For example, for data with process ID id1, three target users user1, user2, and user3 are calculated, and the target cache result is that the cache keys are process ID id1+user1, process ID id1+user2, and process ID id1+user3, and the values ​​are all detailed information of process ID id1. Therefore, according to the fuzzy query structure corresponding to the target ID, a fuzzy query is performed in the cache keys of process ID id1+user1, process ID id1+user2, and process ID id1+user3, so as to obtain the target key corresponding to the target ID of the target user in the cache key, and then obtain the target value corresponding to the target key from the target cache result, so as to determine the target process node corresponding to the target user according to the target value and the target key.

[0069] Specifically, through the fuzzy query structure, data related to the target identifier can be quickly located in the cache, which can significantly improve the user's response speed and satisfaction with the system. Using the fuzzy query structure in the target cache results can effectively utilize the cached data and reduce direct access to the backend database, thereby improving the overall system performance and response speed.

[0070] In some embodiments, after generating the target query result corresponding to the target user based on the target process node and the to-do task, the method also includes: obtaining the processing result corresponding to the target query result by the target user; when the processing result is that the target user has completed the task processing corresponding to the target process node, the target cache result is updated to obtain the updated target cache result.

[0071] Exemplarily, the processing result of the target user on the target query result is obtained. The processing result includes whether the target user has completed the task processing corresponding to the target process node and whether the target user has not completed the task processing corresponding to the target process node. That is, whether the target user has processed the task of the target process node. If it has been processed, the processing result is determined to be that the target user has completed the task processing corresponding to the target process node; if it has not been processed, the processing result is determined to be that the target user has not completed the task processing corresponding to the target process node.

[0072] Exemplarily, when the processing result is that the target user completes the task processing corresponding to the target process node, the corresponding new to-do task in the process system is reloaded, and then the target cache result is updated according to the new to-do task to obtain an updated target cache result.

[0073] For example, check the task status field or completion flag corresponding to the target process node to determine whether the processing result of the target user indicates that the task of the target process node has been completed. If the processing result shows that the task has been completed, reload the corresponding new to-do task in the process system, and then update the target cache result according to the new to-do task to obtain the updated target cache result. If the processing result shows that the task is not completed, there is no need to update the cache.

[0074] Specifically, by updating the cache results, you can ensure that the data in the cache is synchronized with the actual task processing status. This helps avoid information inconsistency problems caused by data asynchrony, accurately reflects the latest status of the task, and prevents old data from affecting subsequent operations and decisions. The updated cache results can provide a more accurate data foundation and provide good support for the accuracy of subsequent data queries.

[0075] In some embodiments, updating the target cache result to obtain the updated target cache result includes: obtaining the process node relationship corresponding to the to-do task from the process system, and then obtaining the latest process node corresponding to the current process node based on the process node relationship; obtaining the associated user corresponding to the latest process node and the associated identifier corresponding to the associated user; deleting the target identifier and the current process node from the target cache result to obtain the intermediate cache result after deletion; adding the association identifier and the latest process node to the intermediate cache result to obtain the updated target cache result.

[0076] Exemplarily, the process node relationship corresponding to the pending task is obtained from the process system. For example, when the processing result of the current process node is processing completion, the downstream process node corresponding to the current process node is obtained according to the process node relationship.

[0077] For example, when creating a task, the heads of different departments establish a process sequence according to the priority order, thereby generating a process node relationship between different process nodes according to the process sequence.

[0078] Exemplarily, the downstream process node corresponding to the current process node is obtained according to the process node relationship, and the downstream process node is determined as the latest process node, so as to query the associated users associated with it according to the information of the latest process node. The identifier of each associated user (such as user ID, account number, etc.) is determined, and these identifiers are used for subsequent cache updates.

[0079] Exemplarily, data splicing is performed according to the target identifier and the node identifier corresponding to the current process node, and the spliced ​​result is used as the key value, and then the corresponding key value in the target cache result is deleted to obtain the deleted intermediate cache result.

[0080] Exemplarily, the latest process identifier and the associated identifier corresponding to the latest process node are combined. A separator (such as "-" or "_") can be used to connect the two identifiers to form a unique new combined identifier. Ensure that the new combined identifier is unique and can be used to retrieve related data.

[0081] Exemplarily, ensure that the new merge identifier conforms to the expected format and does not conflict in different systems. The consistency can be ensured through standardized operations. Use the new merge identifier as the key, the new process data corresponding to the latest process node as the value, construct a key-value pair, and then add the key-value pair to the intermediate cache result to obtain the updated target cache result.

[0082] Specifically, after deleting the target identifier and the current process node, the old data that is no longer needed is cleaned up to keep the data in the cache concise. The updated cache results can more effectively utilize cache resources and avoid storing redundant or invalid data in the cache. Updating the process node information in the cache can support the continuity and consistency of the business process, ensure that the task can proceed smoothly to the next node, and provide strong support for the efficient execution of subsequent business processes.

[0083] Step S105: Generate a target query result corresponding to the target user according to the target process node and the to-be-done task.

[0084] Exemplarily, the task data corresponding to the target process node is obtained from the to-do tasks, and the extracted task data is analyzed to identify key display information, such as the current status, progress, priority, deadline, task content, etc. of the task. The content and format of the display information are determined. This may include a description of the task, status updates, related documents or attachments, etc. Based on the analysis results and the defined format, the task data is converted into a target query result for the target process node. Ensure that the information is clear and accurate, and can effectively convey the key content and progress of the task. Determine the presentation method of the target query results, which may include a user interface, report, notification, or other appropriate method. The target query results are thus presented to the target user in the selected manner.

[0085] In some embodiments, after obtaining the target query result, the method further includes: obtaining the number of queries corresponding to the target query result; determining the number of page numbers corresponding to the target query result based on the number of queries and a preset number; and paging the target query result according to the number of page numbers to obtain a target paging result.

[0086] Exemplarily, the target query results are counted to obtain the total number of data entries corresponding to the target query results, that is, the query quantity is obtained. The number of data entries displayed per page (i.e., the preset number) is determined. This is a predefined parameter that determines how many records are displayed per page.

[0087] Exemplarily, the number of queries in the target query result is divided by the preset number to calculate the number of pages. If the number of queries cannot be divided by the preset number, the result is usually rounded up to ensure that all data can be displayed in pages.

[0088] Exemplarily, the target query result is paginated based on the calculated number of page numbers. The amount of data on each page is equal to the preset number, and the last page may contain the remaining data entries. The data on each page is extracted from the target query result. For each page, the data items of the corresponding range are selected and organized into a target paginated result. For example, if the preset number is 10 records, the first page contains records 1 to 10, the second page contains records 11 to 20, and so on.

[0089] Specifically, for long pages or large amounts of data, vertical scrolling becomes cumbersome, and paging allows users to get relevant information in a shorter time and reduce browsing fatigue. Through paging, users can view and process large amounts of data more efficiently, providing a smooth user experience.

[0090] Please refer to Figure 3 , Figure 3A schematic diagram of a scenario for implementing a data query method for a process task provided in this embodiment, the method comprising: setting a trigger mechanism, and loading corresponding to-do tasks from a process system according to the trigger mechanism. Finding the current process node corresponding to the to-do task, identifying the initial user of the current process node and the initial identifier corresponding to the initial user, and identifying the process identifier of the current process node and related process data. Combining the process identifier and the initial identifier to form a merge identifier. Creating a key-value pair using the merge identifier and the process data, and generating a combined result. Selecting a suitable cache tool, and storing the combined result therein, thereby obtaining a target cache result. Extracting the process query result from the cache tool according to the target identifier of the target user to obtain the target process node corresponding to the target user. Generating a target query result of the target user based on the target process node and the to-do task. Determining the query quantity of the target query result, and calculating the required number of pages according to a preset number. Paging the target query result according to the calculated number of pages to generate a target paging result. Obtaining processing feedback of the target user on the target query result. If the processing result indicates that the target user has completed the task processing, updating the target cache result to ensure the accuracy and timeliness of the cached data. This method solves the problem in related technologies that process query is time-consuming and affects user experience, improves process query efficiency, and further improves user experience.

[0091] See also Figure 4 , Figure 4 A data query device 200 for a process task provided in an embodiment of the present application includes a data loading module 201, a data acquisition module 202, a data caching module 203, a data query module 204, and a result determination module 205, wherein the data loading module 201 is used to set a trigger mechanism and load the corresponding pending tasks in the process system according to the trigger mechanism; the data acquisition module 202 is used to obtain the current process node corresponding to the pending task, and determine the initial user corresponding to the current process node and the initial identifier corresponding to the initial user; the data caching module 203 is used to cache the initial identifier and the current process node to obtain a target cache result; the data query module 204 is used to obtain a target identifier corresponding to the target user, and perform a process query from the target cache result according to the target identifier to obtain the target process node corresponding to the target user; the result determination module 205 is used to generate a target query result corresponding to the target user according to the target process node and the pending task.

[0092] In some implementations, the trigger mechanism is a timing mechanism, and the data loading module 201 performs the following steps during the process of loading the corresponding to-do tasks in the process system according to the trigger mechanism:

[0093] Obtaining department information contained in the process system;

[0094] Loading the tasks in the department information according to the timing mechanism to obtain the initial tasks;

[0095] A special situation table is determined, and the initial task is adjusted according to the special situation table to obtain the to-do task.

[0096] In some implementations, after generating the target query result corresponding to the target user according to the target process node and the to-do task, the result determination module 205 further performs:

[0097] Obtaining a processing result corresponding to the target query result by the target user;

[0098] When the processing result is that the target user completes the task processing corresponding to the target process node, the target cache result is updated to obtain the updated target cache result.

[0099] In some implementations, the result determination module 205, in the process of updating the target cache result to obtain the updated target cache result, executes:

[0100] Obtaining the process node relationship corresponding to the pending task from the process system, and then obtaining the latest process node corresponding to the current process node according to the process node relationship;

[0101] Obtaining an associated user corresponding to the latest process node and an associated identifier corresponding to the associated user;

[0102] Deleting the target identifier and the current process node from the target cache result to obtain a deleted intermediate cache result;

[0103] The association identifier and the latest process node are added to the intermediate cache result to obtain the updated target cache result.

[0104] In some implementations, the data cache module 203 performs, during the process of caching the initial identifier and the current process node to obtain a target cache result:

[0105] Determine the process identifier and process data corresponding to the current process node;

[0106] Combining the process identifier and the initial identifier to obtain a combined identifier;

[0107] Constructing a key-value pair according to the merge identifier and the process data to obtain a combination result;

[0108] A cache tool is determined, and the combination result is stored in the cache tool to obtain the target cache result.

[0109] In some implementations, the data query module 204 performs, during the process of performing a process query from the target cache result according to the target identifier to obtain the target process node corresponding to the target user:

[0110] Generate a corresponding fuzzy query structure according to the target identifier;

[0111] The fuzzy query structure is used to perform a process query in the target cache result to obtain the target process node corresponding to the target user.

[0112] In some implementations, the result determination module 205, after obtaining the target query result, further executes:

[0113] Obtaining the query quantity corresponding to the target query result;

[0114] Determine the number of pages corresponding to the target query result according to the query number and the preset number;

[0115] The target query result is paginated according to the number of page numbers to obtain a target paginated result.

[0116] In some implementations, the process task data query device 200 may be applied to a terminal device.

[0117] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the data query device 200 for the process task described above can refer to the corresponding process in the aforementioned process task data query method embodiment, and will not be repeated here.

[0118] See also Figure 5 , Figure 5 A schematic block diagram of the structure of a terminal device provided in an embodiment of the present invention.

[0119] like Figure 5 As shown, the terminal device 300 includes a processor 301 and a memory 302, and the processor 301 and the memory 302 are connected via a bus 303, such as an I2C (Inter-integrated Circuit) bus.

[0120] Specifically, the processor 301 is used to provide computing and control capabilities to support the operation of the entire terminal device. The processor 301 can be a central processing unit (CPU), and the processor 301 can also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc.

[0121] Specifically, the memory 302 may be a Flash chip, a read-only memory (ROM) disk, an optical disk, a USB flash drive, or a mobile hard disk.

[0122] Those skilled in the art will understand that Figure 5 The structure shown in the figure is only a block diagram of a partial structure related to the embodiment of the present invention, and does not constitute a limitation on the terminal device to which the embodiment of the present invention is applied. The specific server may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0123] The processor is used to run the computer program stored in the memory, and implement any one of the process task data query methods provided by the embodiments of the present invention when executing the computer program.

[0124] In one embodiment, the processor is used to run a computer program stored in the memory, and implements the following steps when executing the computer program:

[0125] Set a trigger mechanism and load the corresponding to-do tasks in the process system according to the trigger mechanism;

[0126] Obtaining a current process node corresponding to the pending task, and determining an initial user corresponding to the current process node and an initial identifier corresponding to the initial user;

[0127] Cache the initial identifier and the current process node to obtain a target cache result;

[0128] Obtain a target identifier corresponding to a target user, and perform a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user;

[0129] A target query result corresponding to the target user is generated according to the target process node and the to-be-done task.

[0130] In some implementations, the trigger mechanism is a timing mechanism, and the processor 301, in the process of loading the corresponding to-do task in the process system according to the trigger mechanism, executes:

[0131] Obtaining department information contained in the process system;

[0132] Loading the tasks in the department information according to the timing mechanism to obtain the initial tasks;

[0133] A special situation table is determined, and the initial task is adjusted according to the special situation table to obtain the to-do task.

[0134] In some implementations, after the target query result corresponding to the target user is generated according to the target process node and the to-do task, the processor 301 further executes:

[0135] Obtaining a processing result corresponding to the target query result by the target user;

[0136] When the processing result is that the target user completes the task processing corresponding to the target process node, the target cache result is updated to obtain the updated target cache result.

[0137] In some implementations, the processor 301, in the process of updating the target cache result to obtain the updated target cache result, executes:

[0138] Obtaining the process node relationship corresponding to the pending task from the process system, and then obtaining the latest process node corresponding to the current process node according to the process node relationship;

[0139] Obtaining an associated user corresponding to the latest process node and an associated identifier corresponding to the associated user;

[0140] Deleting the target identifier and the current process node from the target cache result to obtain a deleted intermediate cache result;

[0141] The association identifier and the latest process node are added to the intermediate cache result to obtain the updated target cache result.

[0142] In some implementations, the processor 301, in the process of caching the initial identifier and the current process node to obtain a target cache result, executes:

[0143] Determine the process identifier and process data corresponding to the current process node;

[0144] Combining the process identifier and the initial identifier to obtain a combined identifier;

[0145] Constructing a key-value pair according to the merge identifier and the process data to obtain a combination result;

[0146] A cache tool is determined, and the combination result is stored in the cache tool to obtain the target cache result.

[0147] In some implementations, the processor 301 performs, during the process of performing a process query from the target cache result according to the target identifier to obtain the target process node corresponding to the target user:

[0148] Generate a corresponding fuzzy query structure according to the target identifier;

[0149] The fuzzy query structure is used to perform a process query in the target cache result to obtain the target process node corresponding to the target user.

[0150] In some implementations, the processor 301, after obtaining the target query result, further executes:

[0151] Obtaining the query quantity corresponding to the target query result;

[0152] Determine the number of pages corresponding to the target query result according to the query number and the preset number;

[0153] The target query result is paginated according to the number of page numbers to obtain a target paginated result.

[0154] It should be noted that technicians in the relevant field can clearly understand that for the convenience and simplicity of description, the specific working process of the terminal device described above can refer to the corresponding process in the data query method embodiment of the aforementioned process task, and will not be repeated here.

[0155] An embodiment of the present invention also provides a storage medium for computer-readable storage, wherein the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the data query method of any process task provided in the description of the embodiment of the present invention.

[0156] The storage medium may be an internal storage unit of the terminal device in the aforementioned embodiment, such as a hard disk or memory of the terminal device. The storage medium may also be an external storage device of the terminal device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the terminal device.

[0157] It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules / units in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In a hardware embodiment, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those of ordinary skill in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0158] It should be understood that the term "and / or" used in the present specification and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, including these combinations. It should be noted that, in this article, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "including a..." does not exclude the presence of other identical elements in the process, method, article or system including the element.

[0159] The serial numbers of the embodiments of the present invention are only for description and do not represent the advantages and disadvantages of the embodiments. The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A data query method for a process task, characterized in that: The method comprises: Set a trigger mechanism and load the corresponding to-do tasks in the process system according to the trigger mechanism; Obtaining a current process node corresponding to the pending task, and determining an initial user corresponding to the current process node and an initial identifier corresponding to the initial user; Cache the initial identifier and the current process node to obtain a target cache result; Obtain a target identifier corresponding to a target user, and perform a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user; A target query result corresponding to the target user is generated according to the target process node and the to-be-done task.

2. The method according to claim 1, characterized in that The trigger mechanism is a timing mechanism, and the loading of the corresponding to-do tasks in the process system according to the trigger mechanism includes: Obtaining department information contained in the process system; Loading the tasks in the department information according to the timing mechanism to obtain the initial tasks; A special situation table is determined, and the initial task is adjusted according to the special situation table to obtain the to-do task.

3. The method according to claim 1, characterized in that After generating the target query result corresponding to the target user according to the target process node and the to-do task, the method further includes: Obtaining a processing result corresponding to the target query result by the target user; When the processing result is that the target user completes the task processing corresponding to the target process node, the target cache result is updated to obtain the updated target cache result.

4. The method according to claim 3, characterized in that The updating of the target cache result to obtain the updated target cache result includes: Obtaining the process node relationship corresponding to the pending task from the process system, and then obtaining the latest process node corresponding to the current process node according to the process node relationship; Obtaining an associated user corresponding to the latest process node and an associated identifier corresponding to the associated user; Deleting the target identifier and the current process node from the target cache result to obtain a deleted intermediate cache result; The association identifier and the latest process node are added to the intermediate cache result to obtain the updated target cache result.

5. The method according to claim 1, characterized in that The caching the initial identifier and the current process node to obtain a target cache result includes: Determine the process identifier and process data corresponding to the current process node; Combining the process identifier and the initial identifier to obtain a combined identifier; Constructing a key-value pair according to the merge identifier and the process data to obtain a combination result; A cache tool is determined, and the combination result is stored in the cache tool to obtain the target cache result.

6. The method according to claim 5, characterized in that The step of performing a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user includes: Generate a corresponding fuzzy query structure according to the target identifier; The fuzzy query structure is used to perform a process query in the target cache result to obtain the target process node corresponding to the target user.

7. The method according to any one of claims 1 to 6, characterized in that After obtaining the target query result, the method further includes: Obtaining the query quantity corresponding to the target query result; Determine the number of pages corresponding to the target query result according to the query number and the preset number; The target query result is paginated according to the number of page numbers to obtain a target paginated result.

8. A data query device for a process task, characterized in that: include: A data loading module is used to set a trigger mechanism and load the corresponding to-do tasks in the process system according to the trigger mechanism; A data acquisition module, used to obtain the current process node corresponding to the pending task, and determine the initial user corresponding to the current process node and the initial identifier corresponding to the initial user; A data cache module, used for caching the initial identifier and the current process node to obtain a target cache result; A data query module is used to obtain a target identifier corresponding to a target user, and perform a process query from a target cache result according to the target identifier to obtain a target process node corresponding to the target user; A result determination module is used to generate a target query result corresponding to the target user according to the target process node and the to-be-done task.

9. A terminal device, characterized in that: The terminal device includes a processor and a memory; The memory is used to store computer programs; The processor is used to execute the computer program and implement the data query method for the process task according to any one of claims 1 to 7 when executing the computer program.

10. A computer storage medium for computer storage, characterized in that: The computer storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the data query method for the process task described in any one of claims 1 to 7.

Images