A cross-judicial institution business processing method, device and equipment

Abstract

This specification relates to a cross-judicial agency business processing method, device and equipment. Multiple business data of multiple judicial agencies are converted into a unified format in advance, and a database is constructed according to each entity, attribute information and association relationship; when a business demand input by the user is received, the business demand is parsed to obtain business elements and processing rules; the query statement template corresponding to the processing rule is determined; the query statement template is filled with the business elements to obtain a query statement; the optimal query path of the query statement in the database is determined, and the database is queried according to the optimal query path to obtain the query result; the query result is processed according to the processing rule to obtain the processing result of the business demand. Through the method of this specification, the user only needs to input the business demand, and the system automatically displays the business processing result to the user, and also optimizes the data storage structure and query process, improves the data query speed, reduces the user waiting time, and improves the user experience.

Description

Technical Field

[0001] The embodiments of this specification relate to the field of data processing technology, and more particularly to a method, apparatus, and device for cross-judicial agency business processing. Background Art

[0002] In existing technologies, each judicial institution and business line operates independently, with fragmented data storage and varying data formats. This lacks cross-judicial and cross-business data integration capabilities. As a result, when users process business transactions, they receive data in different formats from various judicial institutions, forcing them to organize the data themselves. This results in a low level of intelligent business processing and a poor user experience. Summary of the Invention

[0003] In order to solve the problems existing in the prior art, the embodiments of this specification provide a cross-judicial institution business processing method, device and equipment, which support the integration and standardization of all business data of judicial institutions, and the rapid and accurate analysis of complex problems, ensuring the consistency, integrity and reliability of data. At the same time, it provides users with an intelligent business processing platform. Users only need to enter business requirements in text form, and the system automatically displays the business processing results to users. It also optimizes the data storage structure and query process, improves data query speed, reduces user waiting time, and improves user experience.

[0004] The specific technical solutions of the embodiments of this specification are as follows:

[0005] In one aspect, an embodiment of this specification provides a method for processing business across jurisdictions, the method comprising:

[0006] Convert multiple pieces of business data from multiple judicial institutions into a unified format in advance, and use multiple elements in the converted business data as multiple entities. For each entity, use all elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity. Analyze the associations between the entities, and construct a database based on the entities, attribute information, and associations.

[0007] When receiving a business requirement input by a user, the business requirement is parsed to obtain business elements and processing rules;

[0008] Determine a query statement template corresponding to the processing rule;

[0009] Fill the query statement template with the business elements to obtain a query statement;

[0010] Determining an optimal query path for the query statement in the database, and querying the database according to the optimal query path to obtain a query result;

[0011] The query result is processed according to the processing rules to obtain the processing result of the business requirement.

[0012] Furthermore, the query statement is used to query the entity in the database to obtain attribute information of the entity.

[0013] Furthermore, determining the optimal query path of the query statement in the database further includes:

[0014] Using the query conditions corresponding to each business element in the query statement as query constraints of the root node;

[0015] Generate multiple first-level query paths according to the query constraint and the database schema, and use each first-level query path as a parent node under the root node;

[0016] Searching the first-level query path corresponding to each parent node according to the database schema to determine whether there is a second-level query path for the first-level query path;

[0017] If so, obtaining at least one secondary query path of the primary query path and recording the number of visits to the parent node according to the number of secondary query paths; treating the secondary query path as a child node under the parent node; treating the child node as the parent node, and repeatedly performing the steps of searching each primary query path corresponding to each parent node according to the database schema;

[0018] If not, the first-level query path and the query path of the multi-level parent node of the node corresponding to the first-level query path are combined to form a multi-level query path, and a reward value is calculated based on the judgment result of whether the first-level query path queries the entity or attribute information contained in the processing rule, and the cumulative reward value of each node corresponding to the multi-level query path is updated according to the reward value. For a node in the multi-level query path, the score of the node is calculated according to the cumulative reward value and the number of visits of the node. Finally, the total score of the multi-level query path is calculated according to the score of each node in the multi-level query path;

[0019] An optimal query path is determined from the plurality of multi-level query paths according to the total score.

[0020] Furthermore, the step of searching the first-level query path corresponding to each parent node according to the schema of the database and determining whether there is a second-level query path of the first-level query path includes:

[0021] Determining, based on the correspondence between entities and attribute information recorded in the database, whether the attribute information of the entity found by the primary query path in the database contains at least one business element; and / or

[0022] Based on the association relationship between entities recorded in the database, determine whether the entity queried by the first-level query path has an entity with an association relationship in the database. If so, determine whether the entity with an association relationship with the entity queried by the first-level query path belongs to at least one business element.

[0023] Furthermore, if the attribute information of the entity queried by the first-level query path in the database includes at least one business element, the query condition corresponding to the business element included in the attribute information of the entity queried by the first-level query path in the database is used in the query statement as the query constraint condition of the parent node, and a second-level query path of the first-level query path corresponding to the parent node is generated based on the query constraint condition of the parent node and the schema of the database;

[0024] If the entity queried by the first-level query path has an entity with an associated relationship in the database, and the entity with an associated relationship with the entity queried by the first-level query path belongs to at least one business element, then the query condition corresponding to the business element corresponding to the entity with an associated relationship with the entity queried by the first-level query path in the query statement is used as the query constraint condition of the parent node, and the second-level query path of the first-level query path corresponding to the parent node is generated according to the query constraint condition of the parent node and the schema of the database.

[0025] Furthermore, generating a plurality of primary query paths according to the query constraint conditions and the schema of the database further includes:

[0026] If, among the multiple entities in the database, there is an entity whose attribute information contains the query constraint condition, then the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or,

[0027] If an entity of the business element corresponding to the query constraint condition exists in the database, the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or,

[0028] If an entity of the business element corresponding to the query constraint condition exists in the database, an entity in the database that has an association relationship with the entity is used as a query target entity, and the primary query path for querying the query target entity is generated.

[0029] Furthermore, calculating the score of each node based on the accumulated reward value and the number of visits of each node further includes:

[0030] The product of the accumulated reward value of the node and the number of visits is calculated to obtain the score.

[0031] Furthermore, the formula for calculating the total score of the multi-level query path composed of each node based on the score of each node is:

[0032] ;

[0033] Among them, Score represents the total score, N represents the total number of nodes in the multi-level query path, and s i represents the score of node i, and α represents the coefficient.

[0034] On the other hand, an embodiment of this specification further provides a cross-jurisdictional business processing device, the device comprising:

[0035] A database construction unit is configured to convert multiple pieces of business data from multiple judicial institutions into a unified format in advance, and to use multiple elements in the business data converted into the unified format as multiple entities. For each entity, other elements in the corresponding business data, except for the elements corresponding to the entity, are used as attribute information of the entity. The unit also analyzes the associations between the entities and constructs a database based on the entities, attribute information, and associations.

[0036] A business requirement parsing unit is used to parse the business requirement input by the user to obtain business elements and processing rules;

[0037] A query statement template determining unit, configured to determine a query statement template corresponding to the processing rule;

[0038] A query statement template filling unit, configured to fill the query statement template with the business elements to obtain a query statement;

[0039] an optimal query path query unit, configured to determine an optimal query path for the query statement in the database, and query the database according to the optimal query path to obtain a query result;

[0040] The processing unit is used to process the query result according to the processing rule to obtain the processing result of the business requirement.

[0041] On the other hand, an embodiment of this specification further provides a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the processor implements the above method when executing the computer program.

[0042] The embodiment of this specification converts multiple business data of multiple judicial institutions into a unified format in advance, because the business data contains a lot of content, that is, each business data contains multiple elements, because the query of the database is based on the query constraint conditions, and the storage of data requires the establishment of an index, and the elements corresponding to the index will limit the query constraint conditions. Therefore, in order to facilitate business processing, this specification converts the multiple elements in the business data after conversion into a unified format as multiple entities. For each entity, the other elements in the corresponding business data except the elements corresponding to the entity are used as the attribute information of the entity, and the association relationship between the entities is analyzed. A database across judicial institutions is constructed based on the entities, attribute information and association relationships. The query constraint conditions can query the corresponding entity, obtain the attribute information corresponding to the entity, and then obtain the corresponding query results from the attribute information. Therefore, when performing business processing, the embodiment of this specification can issue multiple query constraint conditions, which can be understood as querying from multiple data dimensions, avoiding the limitation that the query constraint conditions can only be specified conditions, and improving the convenience of query.

[0043] In addition, an entity in the database of the embodiment of this specification may also be attribute information under other entities, so there may be multiple query paths for a query statement. Therefore, the embodiment of this specification analyzes the optimal query path of the query statement in the database. The optimal query path avoids multiple path attempts controlled by the internal logic of the database during the query, thereby improving the query efficiency and accuracy.

[0044] Ultimately, through the methods of the embodiments of this specification, users only need to input business requirements. Even if the business requirements are related to multiple judicial institutions or the business requirements include multiple business elements, the embodiments of this specification can quickly return the processing results of the business requirements, thereby improving user convenience. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the embodiments of this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0046] Figure 1 FIG2 is a schematic diagram of an implementation system of a cross-judicial institution business processing method in an embodiment of this specification;

[0047] Figure 2 The figure shows a flowchart of a cross-judicial institution business processing method in an embodiment of this specification;

[0048] Figure 3The figure shows a flow chart of determining the optimal query path of the query statement in the database in an embodiment of this specification;

[0049] Figure 4 The figure shows a schematic diagram of the structure of a cross-judicial institution business processing device in an embodiment of this specification;

[0050] Figure 5 The figure shows a schematic diagram of the structure of a computer device in an embodiment of this specification.

[0051]

Description of the accompanying drawings

[0052] 101. Terminal;

[0053] 102. Server;

[0054] 401. Database construction unit;

[0055] 402. Business requirements analysis unit;

[0056] 403. Query statement template determination unit;

[0057] 404. Query statement template filling unit;

[0058] 405. Optimal query path query unit;

[0059] 406, processing unit;

[0060] 502. Computer equipment;

[0061] 504, processor;

[0062] 506. Memory;

[0063] 508, driving mechanism;

[0064] 510, input / output module;

[0065] 512. Input devices;

[0066] 514. Output device;

[0067] 516. Presentation equipment;

[0068] 518. Graphical User Interface;

[0069] 520, network interface;

[0070] 522, communication link;

[0071] 524. Communication bus. DETAILED DESCRIPTION

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

[0073] It should be noted that the terms "first", "second", etc. in the description and claims of the embodiments of this specification and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the embodiments of this specification described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, apparatus, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0074] It should be noted that the acquisition, storage, use, and processing of data in the technical solutions of the embodiments of this specification comply with the relevant provisions of national laws and regulations.

[0075] It should be noted that in the embodiments of this specification, certain software, components, models and other existing solutions in the industry may be mentioned. They should be regarded as exemplary and their purpose is only to illustrate the feasibility of implementing the technical solution of this application, but it does not mean that the applicant has or will necessarily use the solution.

[0076] like Figure 1 FIG2 is a schematic diagram of a system for implementing a cross-judicial institution business processing method in an embodiment of the present specification, including a terminal 101 and a server 102. The terminal 101 and the server 102 can communicate with each other via a network, which can include a local area network (LAN), a wide area network (WAN), the Internet, or a combination thereof, and is connected to a website, a user device (e.g., a computing device), and a back-end system.

[0077] A user can input a business requirement into server 102 via terminal 101. Server 102 is pre-installed with a database storing business data of multiple judicial institutions. Server 102 parses the business requirement, automatically queries the database to obtain a query result, and automatically processes the query result to obtain a processing result for the business requirement. Server 102 can then provide the processing result to the user via terminal 101.

[0078] Alternatively, the server 102 may be a node of a cloud computing system (not shown), or each server may be a separate cloud computing system including multiple computers interconnected by a network and operating as a distributed processing system.

[0079] It should be noted that Figure 1 What is shown is only one application environment provided by the embodiment of this specification. In actual application, other application environments may also be included, and this specification does not limit them.

[0080] In view of the problems existing in the prior art, the embodiments of this specification provide a cross-judicial institution business processing method, such as Figure 2 As shown, the method includes:

[0081] Step 201: Multiple pieces of business data from multiple judicial institutions are pre-converted into a unified format. Multiple elements in the business data after conversion into the unified format are used as multiple entities. For each entity, all elements in the corresponding business data, except for the elements corresponding to the entity, are used as attribute information of the entity. The associations between the entities are analyzed, and a database is constructed based on the entities, attribute information, and associations.

[0082] Step 202: When receiving a business requirement input by a user, the business requirement is parsed to obtain business elements and processing rules;

[0083] Step 203: Determine the query statement template corresponding to the processing rule;

[0084] Step 204: Fill the query statement template with the business elements to obtain a query statement;

[0085] Step 205: determining an optimal query path for the query statement in the database, and querying the database according to the optimal query path to obtain a query result;

[0086] Step 206: Process the query result according to the processing rule to obtain a processing result that meets the business requirement.

[0087] The embodiment of this specification converts multiple business data of multiple judicial institutions into a unified format in advance, because the business data contains a lot of content, that is, each business data contains multiple elements, because the query of the database is based on the query constraint conditions, and the storage of data requires the establishment of an index, and the elements corresponding to the index will limit the query constraint conditions. Therefore, in order to facilitate business processing, this specification converts the multiple elements in the business data after conversion into a unified format as multiple entities. For each entity, the other elements in the corresponding business data except the elements corresponding to the entity are used as the attribute information of the entity, and the association relationship between the entities is analyzed. A database across judicial institutions is constructed based on the entities, attribute information and association relationships. The query constraint conditions can query the corresponding entity, obtain the attribute information corresponding to the entity, and then obtain the corresponding query results from the attribute information. Therefore, when performing business processing, the embodiment of this specification can issue multiple query constraint conditions, which can be understood as querying from multiple data dimensions, avoiding the limitation that the query constraint conditions can only be specified conditions, and improving the convenience of query.

[0088] In addition, an entity in the database of the embodiment of this specification may also be attribute information under other entities, so there may be multiple query paths for a query statement. Therefore, the embodiment of this specification analyzes the optimal query path of the query statement in the database. The optimal query path avoids multiple path attempts controlled by the internal logic of the database during the query, thereby improving the query efficiency and accuracy.

[0089] Ultimately, through the methods of the embodiments of this specification, users only need to input business requirements. Even if the business requirements are related to multiple judicial institutions or the business requirements include multiple business elements, the embodiments of this specification can quickly return the processing results of the business requirements, thereby improving user convenience.

[0090] In the embodiments of this specification, the formats of business data stored by different judicial institutions vary. For example, the case status "closed" for Judicial Institution A may have different meanings than the case status "closed" for Judicial Institution B. For example, if Judicial Institution A is a primary institution, then "closed" for Judicial Institution A may refer to the completion of the primary review. If Judicial Institution B is an intermediate institution, then "closed" for Judicial Institution B may refer to the completion of the intermediate review. However, the case may still be in an open state because the parties involved may continue to initiate review at a higher judicial institution.

[0091] Therefore, the embodiment of this specification converts multiple business data of multiple judicial institutions into a unified format, and uses multiple elements in the business data converted into the unified format as multiple entities. For each entity, other elements in the corresponding business data except the elements corresponding to the entity are used as the attribute information of the entity, and the association relationship between the entities is analyzed, and a database is constructed based on the entities, attribute information and association relationship.

[0092] For example, business data includes elements such as case ID, party ID, judicial institution ID, judicial institution level, judicial institution location, adjudicator ID, adjudicator contact information, case status, party characteristics, party contact information, and party home address. Business data containing these elements is converted into a unified format, and multiple elements (such as case ID, party ID, judicial institution ID, and adjudicator ID, which can be set by staff as needed) are treated as multiple entities. All elements in the business data other than the element corresponding to the entity are treated as attribute information for the entity. The entity and attribute information are shown in Table 1:

[0093] Table 1

[0094]

[0095] After converting each piece of business data of each judicial institution into a unified format, the data is split as shown in Table 1 to obtain multiple entities of one piece of business data.

[0096] Then, we analyze the relationships between entities. For example, if the entity of one case ID and the entity of another case ID have the same parties and the same subject matter, but are handled by different judicial institutions and at different levels, then the entities and attribute information of these two case IDs may represent the review results of the same case. Therefore, we construct a relationship between the entities of these two case IDs. For example, if a judge belongs to a certain judicial institution, we construct a relationship between the entity of this judge and the entity of the judicial institution.

[0097] Finally, the database can be constructed based on each entity, attribute information and relationship.

[0098] A query statement is used to query an entity in a database and obtain attribute information for that entity. Because the database in the embodiments of this specification contains entities in multiple data dimensions, the query constraints can be more general. For example, the case ID, party ID, judicial institution ID, and adjudicator ID can be used as query constraints to query the entities for each of the case ID, party ID, judicial institution ID, and adjudicator ID, and obtain attribute information for each entity.

[0099] In traditional methods, because the database only contains entities of one data dimension, only entities of this one dimension can be used as query constraints, resulting in poor query convenience.

[0100] In the embodiment of this specification, when a business requirement input by a user is received, the business requirement is parsed to obtain business elements and processing rules.

[0101] Business elements represent keywords for database queries, and processing rules may include the fields to be queried and the query results for the fields to be displayed in a specified format.

[0102] The trained large language model can be used to parse business requirements in text form to obtain business elements and processing rules.

[0103] For example, if a business requirement is "the status of all cases involving party M heard by the intermediate judicial institution in region A," the large language model analyzes the business requirement and derives the business elements as "region A," "intermediate judicial structure," and "party M," and the processing rule as "statistical case status."

[0104] After the business elements are derived, the database can be queried based on the business elements. The embodiment of this specification predefines query statement templates corresponding to multiple processing rules. After the processing rules are derived, the corresponding query statement template is determined, and then the query statement template is filled with the business elements to obtain a query statement, which can then be used to query the database.

[0105] Taking the database model shown in Table 1 as an example, if the business elements are "A region", "intermediate judicial structure" and "party M", and the processing rule is "statistical case status", the query path may include:

[0106] Path 1: Query all entities with judicial structure IDs, and obtain the level and region from the attribute information under all judicial structure ID entities; select the judicial structure with region A and intermediate level as the target judicial structure; query the case ID list from the attribute information under the target judicial structure ID entity; query all entities with case IDs in the case ID list, and obtain the party ID from the attribute information under all case ID entities; select the case ID with party M as the target case ID; and then query the case status from the attribute information under the target case ID entity.

[0107] Path 2: Query all party ID entities and take the party M entity as the target entity; extract the case ID list attribute information under the party M entity; query the attribute information of each case ID in the case ID list to obtain the judicial structure ID in the attribute information of each case ID; query the entities of these judicial structure IDs to obtain the level and region in the attribute information under these judicial structure ID entities; select the judicial structure with region A and intermediate level as the target judicial structure; take the case ID entity with the target judicial structure ID in the attribute information as the target case ID; and then query the case status in the attribute information under the target case ID entity.

[0108] Path 3: Query the judicial structure IDs that are associated with the entity of party M, and obtain the level and region in the attribute information under these judicial structure ID entities that are associated; select the judicial structure with region A and intermediate level as the target judicial structure; query the case ID entities that have edges with the entity of the target judicial structure; then find the case IDs that are associated with the entity of party M among these case ID entities, and use them as the target case IDs; then query the case status in the attribute information under the target case ID entity.

[0109] Any of the above paths can complete the query, but the query speed and computational complexity of different paths may be different. Therefore, in order to improve the query efficiency of the database, the embodiment of this specification first determines the optimal query path of the query statement in the database, and then queries the database according to the optimal query path to obtain the query results.

[0110] like Figure 3 As shown, determining the optimal query path of the query statement in the database further includes:

[0111] Step 301: Using the query conditions corresponding to the business elements in the query statement as query constraints of the root node;

[0112] In this step, the format of the query constraint condition may be "entity / attribute information=business element", for example, "party=party M".

[0113] Step 302: Generate multiple first-level query paths according to the query constraint and the database schema, and use each first-level query path as a parent node under the root node;

[0114] In this step, the query path refers to the dimension of entities to be queried.

[0115] If, among the multiple entities in the database, there is an entity whose attribute information contains the query constraint condition, then the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or,

[0116] If an entity of the business element corresponding to the query constraint condition exists in the database, the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or,

[0117] If an entity of the business element corresponding to the query constraint condition exists in the database, an entity in the database that has an association relationship with the entity is used as a query target entity, and the primary query path for querying the query target entity is generated.

[0118] Step 303: Search the first-level query path corresponding to each parent node according to the database schema to determine whether there is a second-level query path for the first-level query path;

[0119] In this step, based on the correspondence between the entity and the attribute information recorded in the database, it is determined whether the attribute information of the entity queried by the first-level query path in the database contains at least one business element; and / or,

[0120] Based on the association relationship between entities recorded in the database, determine whether the entity queried by the first-level query path has an entity with an association relationship in the database. If so, determine whether the entity with an association relationship with the entity queried by the first-level query path belongs to at least one business element.

[0121] It should be noted that a business element will only be queried once in a multi-level query path.

[0122] Step 3031: If it exists, obtain at least one secondary query path of the primary query path;

[0123] In this step, if the entity queried by the first-level query path contains at least one business element in the attribute information in the database, the query condition corresponding to the business element contained in the attribute information of the entity queried by the first-level query path in the database is used as the query constraint condition of the parent node, and the second-level query path of the first-level query path corresponding to the parent node is generated according to the query constraint condition of the parent node and the schema of the database.

[0124] It can be understood that if the attribute information of the entity queried by the first-level query path (for example, determined based on the database schema shown in Table 1, without the need for actual querying) contains one of the parsed business elements, then a second-level query path exists for that first-level query path. The second-level query path queries the business element contained in that attribute information. The second-level query path for the parent node is then generated using the method in step 302.

[0125] If the entity queried by the first-level query path has an entity with an associated relationship in the database, and the entity with an associated relationship with the entity queried by the first-level query path belongs to at least one business element, then the query condition corresponding to the business element corresponding to the entity with an associated relationship with the entity queried by the first-level query path in the query statement is used as the query constraint condition of the parent node, and the second-level query path of the first-level query path corresponding to the parent node is generated according to the query constraint condition of the parent node and the schema of the database.

[0126] It can be understood that if the entity found by the first-level query path has an associated entity in the database (determined based on the database schema, without the need for an actual query), and the associated entity belongs to one of the resolved business elements, then a second-level query path for the first-level query path is generated, and the second-level query path queries the associated entity. The second-level query path for the parent node is then generated using the method in step 302.

[0127] Step 3032: Record the number of visits to the parent node according to the number of secondary query paths;

[0128] In this step, the number of secondary query paths may be used as the number of visits to the parent node.

[0129] Step 3033: using the secondary query path as a child node under the parent node; using the child node as the parent node, and repeatedly performing the step of searching each primary query path corresponding to each parent node according to the database schema;

[0130] Step 3041: If it does not exist, the first-level query path and the query paths of the multi-level parent nodes of the node corresponding to the first-level query path are combined to form a multi-level query path;

[0131] It can be understood that the node that is finally determined to have no secondary query path is the leaf node, and the query path of the leaf node and its multi-level parent node constitutes a multi-level query path for querying the entity corresponding to the leaf node.

[0132] Step 3042: Calculate the reward value based on the result of determining whether the first-level query path finds the entity or attribute information included in the processing rule;

[0133] In this step, although the multi-level query path has queried the leaf node, this does not mean that the attribute information of the queried entity includes the entity or attribute information contained in the parsed processing rule. It can be understood that although the multi-level query path can complete the query, it may not necessarily be able to query the desired result. If the multi-level query path does not query the desired result, then this multi-level query path is an incorrect query path, and the reward value can be a negative value. On the contrary, if the multi-level query path can query the desired result, then this multi-level query path is the correct query path, and the reward value can be a positive value, but the correct query path is not necessarily the most efficient multi-level query path, so subsequent steps need to be calculated.

[0134] It should be noted that the size of the reward value can be set based on experience, and the embodiments of this specification do not limit the actual value of the reward value.

[0135] Step 3043: updating the cumulative reward value of each node corresponding to the multi-level query path according to the reward value;

[0136] In this step, the calculated reward value (positive or negative) is added to the current cumulative reward value of each node to complete the update of the cumulative reward value.

[0137] Step 3044: For a node in the multi-level query path, calculate the score of the node based on the accumulated reward value and the number of visits of the node;

[0138] In this step, a higher cumulative reward value for a node indicates a higher accuracy rate for the query path corresponding to that node. A higher number of visits to a node indicates a higher number of secondary query paths under that node's primary query path. Having more secondary query paths indicates that after the primary query path finds the target entity, there are more directions for further queries. Multiple query directions can be queried in parallel, and the query results can then be intersected. This method of querying is more efficient than serial queries. Therefore, in embodiments of this specification, the score can be calculated by multiplying the cumulative reward value of the node by the number of visits.

[0139] Step 3045: Calculate the total score of the multi-level query path according to the score of each node in the multi-level query path;

[0140] In the embodiments of this specification, the higher the sum of the scores of each node in the multi-level query path, the higher the accuracy of the multi-level query path and the higher the query efficiency of each node. However, if the total number of nodes in the multi-level query path is large, it means that the multi-level query path needs to go through multiple serial queries, which actually reduces the overall efficiency. Therefore, in the embodiments of this specification, the formula for calculating the total score of the multi-level query path composed of each node based on the score of each node is:

[0141] ;

[0142] Among them, Score represents the total score, N represents the total number of nodes in the multi-level query path, and s i represents the score of node i, and α represents the coefficient.

[0143] In the embodiments of this specification, the coefficient α can be set according to actual needs. The value of the coefficient α determines the strength of the influence of the number of nodes. When α = 1, the total score degenerates into the average score (the sum of the node scores / the number of nodes). When α > 1, the inhibitory effect of the number of nodes on the total score is stronger (for example, when α = 2, the total score = the sum of the node scores / the number of nodes). 2 When 0 < α < 1, the number of nodes has a weaker impact on the total score, which is suitable for scenarios that require moderate suppression.

[0144] Step 305: Determine an optimal query path from the plurality of multi-level query paths according to the total score.

[0145] It can be understood that, by using the formula for calculating the total score in the embodiment of this specification, a multi-level query path with a higher score and fewer nodes can be selected, and the query efficiency of this multi-level query path is higher.

[0146] In the embodiments of the present specification, after the optimal query path is obtained, the database can be queried according to the optimal query path. When querying, the query path ranked first is executed first (that is, the query path of the parent node is queried first) to obtain a query result set. Then, the query path ranked later (that is, the query path of the child node) continues to query in the query result set to further filter relevant data. After the optimal query path is executed, the final query result can be obtained.

[0147] Finally, the embodiment of this specification processes the query result according to the processing rules to obtain the processing result of the business requirement.

[0148] In the embodiment of this specification, the processing rules may include the number of statistical results, the content of the extraction results, etc., which are not limited in the embodiment of this specification.

[0149] Based on the same inventive concept, the embodiment of this specification also provides a cross-judicial institution business processing device, such as Figure 4 Shown, including:

[0150] Database construction unit 401 is configured to convert multiple pieces of business data from multiple judicial institutions into a unified format in advance, and to treat multiple elements in the business data after conversion into the unified format as multiple entities. For each entity, other elements in the corresponding business data, excluding the elements corresponding to the entity, are used as attribute information of the entity. The database is constructed based on the entities, attribute information, and associations, by analyzing the associations between the entities.

[0151] The business requirement parsing unit 402 is used to parse the business requirement input by the user to obtain business elements and processing rules;

[0152] A query statement template determining unit 403 is configured to determine a query statement template corresponding to the processing rule;

[0153] A query statement template filling unit 404 is configured to fill the query statement template with the business elements to obtain a query statement;

[0154] An optimal query path query unit 405 is configured to determine an optimal query path for the query statement in the database, and query the database according to the optimal query path to obtain a query result;

[0155] The processing unit 406 is configured to process the query result according to the processing rule to obtain a processing result that meets the business requirement.

[0156] The beneficial effects achieved by the above-mentioned device are consistent with the beneficial effects achieved by the above-mentioned method, and will not be described in detail in the embodiments of this specification.

[0157] like Figure 5As shown, a computer device provided in an embodiment of this document is shown. The apparatus herein may be a computer device in this embodiment, executing the method described above. The computer device 502 may include one or more processors 504, such as one or more central processing units (CPUs), each of which may implement one or more hardware threads. The computer device 502 may also include any memory 506 for storing any type of information, such as code, settings, data, etc. For example, without limitation, the memory 506 may include any one or more combinations of the following: any type of RAM, any type of ROM, a flash memory device, a hard disk, an optical disk, etc. More generally, any memory may use any technology to store information. Furthermore, any memory may provide volatile or non-volatile retention of information. Furthermore, any memory may represent a fixed or removable component of the computer device 502. In one embodiment, when the processor 504 executes associated instructions stored in any memory or combination of memories, the computer device 502 may perform any operation of the associated instructions. The computer device 502 also includes one or more drive mechanisms 508, such as a hard disk drive mechanism, an optical disk drive mechanism, etc., for interacting with any memory.

[0158] Computer device 502 may also include an input / output module 510 (I / O) for receiving various inputs (via input devices 512) and providing various outputs (via output devices 514). A specific output mechanism may include a presentation device 516 and an associated graphical user interface (GUI) 518. In other embodiments, input / output module 510 (I / O), input devices 512, and output devices 514 may not be included, and the computer device 502 may simply function as a single computer device on a network. Computer device 502 may also include one or more network interfaces 520 for exchanging data with other devices via one or more communication links 522. One or more communication buses 524 couple the components described above.

[0159] The communication link 522 may be implemented in any manner, for example, via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, etc., or any combination thereof. The communication link 522 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

[0160] The embodiments of this specification also provide a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0161] The embodiments of this specification also provide a computer-readable instruction, wherein when a processor executes the instruction, the program therein causes the processor to execute the above method.

[0162] It should be understood that in the various embodiments of the present specification, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present specification.

[0163] It should also be understood that in the embodiments of this specification, the term "and / or" is merely a description of the relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent three situations: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, in the embodiments of this specification, the character " / " generally indicates that the associated objects are in an "or" relationship.

[0164] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in the embodiments of this specification can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the embodiments of this specification.

[0165] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0166] In the several embodiments provided in the embodiments of this specification, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or can be electrical, mechanical or other forms of connection.

[0167] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of this specification.

[0168] In addition, the functional units in each embodiment of the present specification may be integrated into a single processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0169] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiments of this specification is essentially or the part that contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the embodiments of this specification. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, and other media that can store program code.

[0170] The embodiments of this specification use specific embodiments to illustrate the principles and implementation methods of the embodiments of this specification. The description of the above embodiments is only used to help understand the methods and core ideas of the embodiments of this specification. At the same time, for those skilled in the art, based on the ideas of the embodiments of this specification, there will be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be understood as a limitation on the embodiments of this specification.

Claims

1. A cross-jurisdictional business processing method, characterized in that: The method comprises: Convert multiple pieces of business data from multiple judicial institutions into a unified format in advance, and use multiple elements in the converted business data as multiple entities. For each entity, use all elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity. Analyze the associations between the entities, and construct a database based on the entities, attribute information, and associations. When receiving a business requirement input by a user, the business requirement is parsed to obtain business elements and processing rules; Determine a query statement template corresponding to the processing rule; Fill the query statement template with the business elements to obtain a query statement; Determining an optimal query path for the query statement in the database, and querying the database according to the optimal query path to obtain a query result; Process the query result according to the processing rules to obtain the processing result of the business requirement; The query statement is used to query the entity in the database to obtain the attribute information of the entity; Determining the optimal query path of the query statement in the database further includes: Using the query conditions corresponding to each business element in the query statement as query constraints of the root node; Generate multiple first-level query paths according to the query constraint and the database schema, and use each first-level query path as a parent node under the root node; Searching the first-level query path corresponding to each parent node according to the database schema to determine whether there is a second-level query path for the first-level query path; If so, obtaining at least one secondary query path of the primary query path and recording the number of visits to the parent node according to the number of secondary query paths; treating the secondary query path as a child node under the parent node; treating the child node as the parent node, and repeatedly performing the steps of searching each primary query path corresponding to each parent node according to the database schema; If not, the first-level query path and the query path of the multi-level parent node of the node corresponding to the first-level query path are combined to form a multi-level query path, and a reward value is calculated based on the judgment result of whether the first-level query path queries the entity or attribute information contained in the processing rule, and the cumulative reward value of each node corresponding to the multi-level query path is updated according to the reward value. For a node in the multi-level query path, the score of the node is calculated according to the cumulative reward value and the number of visits of the node. Finally, the total score of the multi-level query path is calculated according to the score of each node in the multi-level query path; Determining an optimal query path from a plurality of the multi-level query paths according to the total score; Generating a plurality of primary query paths according to the query constraint conditions and the database schema further includes: If, among the multiple entities in the database, there is an entity whose attribute information contains the query constraint condition, then the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or, If an entity of the business element corresponding to the query constraint condition exists in the database, the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or, If an entity of the business element corresponding to the query constraint condition exists in the database, an entity in the database that has an association relationship with the entity is used as a query target entity, and the primary query path for querying the query target entity is generated.

2. The method according to claim 1, characterized in that The steps of searching the first-level query path corresponding to each parent node according to the database schema and determining whether there is a second-level query path for the first-level query path include: Determining, based on the correspondence between entities and attribute information recorded in the database, whether the attribute information of the entity found by the primary query path in the database contains at least one business element; and / or Based on the association relationship between entities recorded in the database, determine whether the entity queried by the first-level query path has an entity with an association relationship in the database. If so, determine whether the entity with an association relationship with the entity queried by the first-level query path belongs to at least one business element.

3. The method according to claim 2, characterized in that If the attribute information of the entity queried by the first-level query path in the database contains at least one business element, the query condition corresponding to the business element contained in the attribute information of the entity queried by the first-level query path in the database is used as the query constraint condition of the parent node, and the second-level query path of the first-level query path corresponding to the parent node is generated according to the query constraint condition of the parent node and the schema of the database; If the entity queried by the first-level query path has an entity with an associated relationship in the database, and the entity with an associated relationship with the entity queried by the first-level query path belongs to at least one business element, then the query condition corresponding to the business element corresponding to the entity with an associated relationship with the entity queried by the first-level query path in the query statement is used as the query constraint condition of the parent node, and the second-level query path of the first-level query path corresponding to the parent node is generated according to the query constraint condition of the parent node and the schema of the database.

4. The method according to claim 1, wherein Calculating the score of each node based on the accumulated reward value and the number of visits of each node further includes: The product of the accumulated reward value of the node and the number of visits is calculated to obtain the score.

5. The method according to claim 4, characterized in that The formula for calculating the total score of the multi-level query path composed of each node based on the score of each node is: ； in, Score Indicates the total score, N Indicates the total number of nodes in the multi-level query path, s i Representation node i The score, α Represents the coefficient.

6. A cross-judicial business processing device, characterized in that: The device comprises: A database construction unit is configured to convert multiple pieces of business data from multiple judicial institutions into a unified format in advance, and to use multiple elements in the business data converted into the unified format as multiple entities. For each entity, other elements in the corresponding business data, except for the elements corresponding to the entity, are used as attribute information of the entity. The unit also analyzes the associations between the entities and constructs a database based on the entities, attribute information, and associations. A business requirement parsing unit is used to parse the business requirement input by the user to obtain business elements and processing rules; A query statement template determining unit, configured to determine a query statement template corresponding to the processing rule; A query statement template filling unit, configured to fill the query statement template with the business elements to obtain a query statement; an optimal query path query unit, configured to determine an optimal query path for the query statement in the database, and query the database according to the optimal query path to obtain a query result; A processing unit, configured to process the query result according to the processing rule to obtain a processing result that meets the business requirement; The query statement is used to query the entity in the database to obtain the attribute information of the entity; Determining the optimal query path of the query statement in the database further includes: Using the query conditions corresponding to each business element in the query statement as query constraints of the root node; Generate multiple first-level query paths according to the query constraint and the database schema, and use each first-level query path as a parent node under the root node; Searching the first-level query path corresponding to each parent node according to the database schema to determine whether there is a second-level query path for the first-level query path; If so, obtaining at least one secondary query path of the primary query path and recording the number of visits to the parent node according to the number of secondary query paths; treating the secondary query path as a child node under the parent node; treating the child node as the parent node, and repeatedly performing the steps of searching each primary query path corresponding to each parent node according to the database schema; If not, the first-level query path and the query path of the multi-level parent node of the node corresponding to the first-level query path are combined to form a multi-level query path, and a reward value is calculated based on the judgment result of whether the first-level query path queries the entity or attribute information contained in the processing rule, and the cumulative reward value of each node corresponding to the multi-level query path is updated according to the reward value. For a node in the multi-level query path, the score of the node is calculated according to the cumulative reward value and the number of visits of the node. Finally, the total score of the multi-level query path is calculated according to the score of each node in the multi-level query path; Determining an optimal query path from a plurality of the multi-level query paths according to the total score; Generating a plurality of primary query paths according to the query constraint conditions and the database schema further includes: If, among the multiple entities in the database, there is an entity whose attribute information contains the query constraint condition, then the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or, If an entity of the business element corresponding to the query constraint condition exists in the database, the entity is used as the query target entity, and the primary query path for querying the query target entity is generated; and / or, If an entity of the business element corresponding to the query constraint condition exists in the database, an entity in the database that has an association relationship with the entity is used as a query target entity, and the primary query path for querying the query target entity is generated.

7. A computer device comprising a memory, a processor, and a computer program stored in the memory, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 5 is implemented.

Images