Cross-judicial institution business processing method, device and equipment

Abstract

The invention relates to a cross-judicial organization business processing method, device and equipment. The method comprises the following steps: converting multiple pieces of business data of multiple judicial institutions into a uniform format in advance, and constructing a database according to each entity, attribute information and an association relationship; when a service demand input by a user is received, analyzing the service demand to obtain a service element and a processing rule; determining a query statement template corresponding to the processing rule; filling the query statement template with the service elements to obtain a query statement; determining an optimal query path of the query statement in the database, and querying the database according to the optimal query path to obtain a query result; and processing the query result according to the processing rule to obtain a processing result of the business demand. Through the method of the specification, the user only needs to input the service demand, the system automatically displays the service processing result for the user, the storage structure and the query process of the data are optimized, the data query speed is increased, the waiting time of the user is shortened, and the user experience is improved.

Description

Technical Field

[0001] The embodiments of this specification relate to the technical field of data processing, and in particular, to a business processing method, device, and equipment across judicial institutions. Background Art

[0002] In the prior art, each judicial institution and business line operate independently, data storage is scattered, and there are certain differences in data formats, lacking the ability of cross-judicial institution and cross-business data fusion. As a result, when users handle business, the data formats obtained from each judicial institution are also different, and users need to organize the data by themselves, with a low degree of intelligence in business processing and a poor user experience. Summary of the Invention

[0003] To solve the problems existing in the prior art, the embodiments of this specification provide a business processing method, device, and equipment across judicial institutions, which support the fusion, standardization of all business data of judicial institutions, and the rapid and accurate analysis of complex problems, ensure the consistency, integrity, and reliability of data, and at the same time provide an intelligent business handling platform for users. Users only need to input business requirements in text form, and the system automatically displays the business processing results for users. In addition, the storage structure and query process of data are optimized, the data query speed is increased, the user waiting time is reduced, and the user experience is improved.

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

[0005] On the one hand, the embodiments of this specification provide a business processing method across judicial institutions, and the method includes:

[0006] Pre-convert the multiple business data of multiple judicial institutions into a unified format, and use multiple elements in the business data after conversion into the unified format as multiple entities. For each entity, use other elements in the corresponding business data except the elements corresponding to the entity as the attribute information of the entity, analyze the association relationships between the entities, and construct a database according to the entities, attribute information, and association relationships;

[0007] When receiving the business requirements input by the user, parse the business requirements to obtain business elements and processing rules;

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

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

[0010] Determine the optimal query path of the query statement in the database, and query the database according to the optimal query path to obtain a query result;

[0011] Process the query result according to the processing rule to obtain the processing result of the service requirement.

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

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

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

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

[0016] Search for the second-level query paths corresponding to each first-level query path of each parent node according to the schema of the database, and determine whether there are any second-level query paths for the first-level query path;

[0017] If there are any, obtain at least one second-level query path for the first-level query path, record the access times of the parent node according to the number of second-level query paths; use the second-level query paths as child nodes under the parent node; use the child nodes as the parent nodes, and repeat the step of searching for each first-level query path corresponding to each parent node according to the schema of the database;

[0018] If not, form a multi-level query path with 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, calculate the reward value according to the judgment result of whether the entity or attribute information included in the processing rule is queried by the first-level query path, update the cumulative reward values of the nodes corresponding to the multi-level query path according to the reward value, calculate the score of a node in the multi-level query path according to the cumulative reward value and the access times of the node, and finally, calculate the total score value of the multi-level query path according to the scores of the nodes in the multi-level query path.

[0019] Determine the optimal query path from multiple multi-level query paths according to the total score value.

[0020] Further, the step of searching for the second-level query paths corresponding to each first-level query path of each parent node according to the schema of the database and determining whether there are any second-level query paths for the first-level query path includes:

[0021] According to the corresponding relationship between the entities and attribute information recorded in the database, determine whether the attribute information of the entity queried by the first-level query path includes at least one business element in the database; and / or,

[0022] According to the association relationships between entities recorded in the database, determine whether there are entities with association relationships in the database for the entities queried by the first-level query path. If so, determine whether the entities with association relationships to the entities queried by the first-level query path belong to at least one business element.

[0023] Further, if the attribute information of the entity queried by the first-level query path in the database contains at least one business element, then use the query conditions corresponding to the business elements included in the attribute information of the entity queried by the first-level query path in the database as the query constraint conditions for this parent node, and generate a second-level query path for the first-level query path corresponding to this parent node according to the query constraint conditions of this parent node and the schema of the database;

[0024] If there are entities with association relationships in the database for the entity queried by the first-level query path, and the entities with association relationships to the entity queried by the first-level query path belong to at least one business element, then use the query conditions corresponding to the business elements of the entities with association relationships to the entity queried by the first-level query path in the database as the query constraint conditions for this parent node, and generate a second-level query path for the first-level query path corresponding to this parent node according to the query constraint conditions of this parent node and the schema of the database.

[0025] Further, generating multiple first-level query paths according to the query constraint conditions and the schema of the database further includes:

[0026] Among the multiple entities in the database, if there is an entity whose attribute information contains the query constraint conditions, then use this entity as the query target entity and generate the first-level query path for querying this query target entity; and / or,

[0027] If there is an entity corresponding to the business element of the query constraint conditions in the database, then use this entity as the query target entity and generate the first-level query path for querying this query target entity; and / or,

[0028] If there is an entity corresponding to the business element of the query constraint conditions in the database, then use the entity in the database that has an association relationship with this entity as the query target entity and generate the first-level query path for querying this query target entity.

[0029] Further, calculating the scores of each node according to the cumulative reward value and the access times of each node further includes:

[0030] Calculate the product of the cumulative reward value of the node and the access times to obtain the score.

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

[0032] ;

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

[0034] On the other hand, the embodiments of this specification also provide a business processing device across judicial institutions, and the device includes:

[0035] A database construction unit, configured to pre-convert multiple pieces of business data of multiple judicial institutions into a unified format, and use multiple elements in the business data converted into the unified format as multiple entities. For each entity, use other elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity, analyze the association relationships between the entities, and construct a database according to the entities, attribute information, and association relationships;

[0036] A business requirement analysis unit, configured to analyze the business requirement to obtain business elements and processing rules when receiving a business requirement input by a user;

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

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

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

[0040] A processing unit, configured to process the query result according to the processing rule to obtain a processing result of the business requirement.

[0041] On the other hand, the embodiments of this specification also provide a computer device, including a memory, a processor, and a computer program stored on the memory. When the processor executes the computer program, the above method is implemented.

[0042] In the embodiments of this specification, multiple pieces of business data of multiple judicial institutions are pre-converted into a unified format. Since there is a large amount of content in the business data, that is, each piece of business data contains multiple elements. Because the query of the database is based on query constraint conditions, while the storage of data requires the establishment of indexes, and the elements corresponding to the indexes will limit the query constraint conditions. Therefore, for the convenience of business processing, this specification takes multiple elements in the business data after conversion into a 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 relationships between the entities are analyzed. A cross-judicial-institution database is constructed based on the entities, attribute information, and association relationships. The query constraint conditions can query the corresponding entities, obtain the attribute information corresponding to the entities, and then obtain the corresponding query results from the attribute information. Therefore, when the embodiments of this specification perform business processing, multiple query constraint conditions can be issued. It can be understood that queries are made from multiple data dimensions, avoiding the limitation that the query constraint conditions can only be specified conditions, and improving the convenience of querying.

[0043] In addition, an entity in the database of the embodiments of this specification may simultaneously be the attribute information under other entities, so there may be multiple query paths for a query statement. Therefore, the embodiments of this specification analyze 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 querying, thereby improving the query efficiency and accuracy.

[0044] Finally, through the method of the embodiments of this specification, the user only needs 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, improving the convenience of the user. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the technical solutions in the embodiments of this specification or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the following drawings are only some embodiments of the embodiments of this specification. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0046] Figure 1 The figure shows a schematic diagram of an implementation system of a cross-judicial-institution business processing method in the embodiments of this specification;

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

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

[0049] Figure 4 The figure shows a schematic structural diagram of a business processing device across judicial institutions in an embodiment of this specification;

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

[0051]

Explanation of the reference numerals

[0052] 101, terminal;

[0053] 102, server;

[0054] 401, database construction unit;

[0055] 402, business requirement 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 device;

[0061] 504, processor;

[0062] 506, memory;

[0063] 508, driving mechanism;

[0064] 510, input / output module;

[0065] 512, input device;

[0066] 514, output device;

[0067] 516, presentation device;

[0068] 518, graphical user interface;

[0069] 520, network interface;

[0070] 522, communication link;

[0071] 524, communication bus. Detailed implementation manners

[0072] Next, the technical solutions in the embodiments of this specification will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of this specification. Obviously, the described embodiments are only a part of the embodiments in this specification, rather than all the embodiments. Based on the embodiments in this specification, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall 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 accompanying drawings are used to distinguish similar objects, and do not necessarily have to be used to describe a specific order or sequence. It should be understood that such data can be interchanged under appropriate circumstances so that the embodiments of the embodiments of this specification described here can be implemented in an order other than those illustrated or described here. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, device, product, or equipment that includes a series of steps or units does not necessarily have to be limited to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products, or equipment.

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

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

[0076] As Figure 1 shown is a schematic diagram of an implementation system of a business processing method across judicial agencies in the embodiments of this specification, including a terminal 101 and a server 102. The terminal 101 and the server 102 can communicate with each other through a network. The network can include a local area network (LAN for short), a wide area network (WAN for short), the Internet, or a combination thereof, and is connected to websites, user devices (such as computing devices), and backend systems.

[0077] A user can input business requirements into server 102 through terminal 101. A database storing business data of multiple judicial institutions is pre-deployed on server 102. Server 102 parses the business requirements, automatically queries the database to obtain a query result, and automatically processes the query result to obtain a processing result of the business requirements. Then, server 102 can provide the obtained processing result to the user through terminal 101.

[0078] Optionally, server 102 can be a node of a cloud computing system (not shown in the figure), or each server can be an independent 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 an application environment provided by the embodiments of this specification. In actual applications, other application environments may also be included, which are not limited in this specification.

[0080] In view of the problems existing in the prior art, the embodiments of this specification provide a business processing method across judicial institutions. As Figure 2 shown, the method includes:

[0081] Step 201: Convert multiple pieces of business data of multiple judicial institutions into a unified format in advance, and use multiple elements in the business data converted into the unified format as multiple entities. For each entity, use other elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity, and analyze the association relationships between the entities. Build a database based on the entities, attribute information, and association relationships.

[0082] Step 202: When receiving the business requirements input by the user, parse the business requirements 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: Determine the optimal query path of the query statement in the database, and query 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 of the business requirements.

[0087] In the embodiments of this specification, multiple pieces of business data of multiple judicial institutions are pre-converted into a unified format. Since there is a large amount of content in the business data, that is, each piece of business data contains multiple elements. Because database queries are based on query constraint conditions, while data storage requires building indexes, and the elements corresponding to the indexes will limit the query constraint conditions. Therefore, for the convenience of business processing, this specification takes multiple elements in the business data after being converted 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 relationships between the entities are analyzed. A cross-judicial-institution database is constructed based on the entities, attribute information, and association relationships. The query constraint conditions can query the corresponding entities, obtain the attribute information corresponding to the entities, and then obtain the corresponding query results from the attribute information. Therefore, when conducting business processing in the embodiments of this specification, multiple query constraint conditions can be issued. It can be understood that queries are made from multiple data dimensions, avoiding the limitation that the query constraint conditions can only be specified conditions, and improving the convenience of queries.

[0088] In addition, an entity in the database of the embodiments of this specification may simultaneously be the attribute information under other entities. Therefore, a query statement may have multiple query paths. Thus, the embodiments of this specification analyze 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 querying, thereby improving the query efficiency and accuracy.

[0089] Finally, through the method of the embodiments of this specification, the user only needs to input business requirements. Even if the business requirements are associated with 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, improving the convenience for the user.

[0090] In the embodiments of this specification, the formats of the business data stored by different judicial institutions are different. For example, the case status "closed" of judicial institution A and the case status "closed" of judicial institution B may have different meanings. For example, if judicial institution A is a primary institution, then "closed" of judicial institution A may mean that the primary review is closed. If judicial institution B is an intermediate institution, then "closed" of judicial institution B may mean that the intermediate review is closed. However, for this case, it may still be in an unclosed state because the parties to the case may continue to initiate a review to a higher-level judicial institution.

[0091] Therefore, the embodiments of this specification convert the business data of multiple judicial institutions into a unified format, and use multiple elements in the business data after conversion into the unified format as multiple entities. For each entity, the other elements in the corresponding business data except the element corresponding to the entity are used as the attribute information of the entity, and the association relationships between the entities are analyzed. A database is constructed based on the entities, attribute information, and association relationships.

[0092] Exemplarily, the business data includes elements such as case ID, party ID, judicial institution ID, judicial institution level, region where the judicial institution is located, examiner ID, examiner contact information, case status, party characteristics, party contact information, and party home address. The business data including the above elements is converted into a unified format, and multiple elements therein (such as case ID, party ID, judicial institution ID, examiner ID, which can be set by the staff according to needs) are used as multiple entities, and the other elements in the business data except the element corresponding to the entity are used as the attribute information of the entity. The entities and attribute information shown in Table 1 can be obtained:

[0093] Table 1

[0094]

[0095] After converting each piece of business data of each judicial institution into a unified format, splitting as shown in Table 1 can obtain multiple entities of a piece of business data.

[0096] Then, analyze the association relationships between the entities. For example, the parties of the entities with two case IDs are the same, the matters concerned are the same, the judicial institutions accepting the cases are different, and the levels of the judicial institutions are also different. Then, the entities with these two case IDs and their respective attribute information may be the review results of the same case. Therefore, an association relationship is constructed between the entities with these two case IDs. For example, a certain examiner belongs to a certain judicial institution. Therefore, an association relationship is constructed between the entity of this examiner and the entity of the judicial institution.

[0097] Finally, a database can be constructed based on the entities, attribute information, and association relationships.

[0098] The query statement is used to query the entities in the database to obtain the attribute information of the entity. Since the database in the embodiments of this specification contains entities with multiple data dimensions, the query constraint conditions can be more extensive. For example, the case ID, party ID, judicial institution ID, and examiner ID can be used as query constraint conditions respectively to query the entities of the case ID, party ID, judicial institution ID, and examiner ID, and obtain the attribute information under each entity.

[0099] In the traditional method, since the database only contains entities of one data dimension, only the entities of this one dimension can be used as query constraint conditions, resulting in poor query convenience.

[0100] In the embodiments 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. Among them, the business requirement can be a requirement in text form.

[0101] The business elements represent the keywords for database query, and the processing rules can include the fields to be queried and the query results of displaying the fields in a specified form.

[0102] The business requirement in text form can be parsed by a trained large language model to obtain business elements and processing rules.

[0103] For example: if the business requirement is "the status of all cases handled by the intermediate judicial institution in Area A for Party M", the large language model parses this business requirement and obtains the business elements as "Area A", "intermediate judicial structure", and "Party M", and obtains the processing rule as "count the case status".

[0104] After obtaining the business elements, the database can be queried based on the business elements. In the embodiments of this specification, query statement templates corresponding to multiple processing rules are predefined in advance. After obtaining the processing rules, the corresponding query statement template is determined, and then the business elements are filled into the query statement template to obtain a query statement, and then the database can be queried using the query statement.

[0105] Taking the database schema shown in Table 1 as an example, if the business elements are "Area A", "intermediate judicial structure", and "Party M", and the processing rule is "count the case status", the query path can include:

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

[0107] Path 2: Query the entities of all party IDs, and take the entity of Party M as the target entity; Extract the attribute information of the case ID list under the entity of Party M; 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 location in the attribute information under the entities of these judicial structure IDs; Select the judicial structure with the location in Area A and the level of intermediate as the target judicial structure; Take the case ID entity with the judicial structure ID in the attribute information as the target judicial structure as the target case ID; Then query the case status in the attribute information under the target case ID entity.

[0108] Path 3: Query the judicial structure IDs associated with the entity of Party M to obtain the level and location in the attribute information under the entities of these associated judicial structure IDs; Select the judicial structure with the location in Area A and the level of intermediate as the target judicial structure; Query the case ID entities with edges to the entity of the target judicial structure; Then find the case IDs associated with the entity of Party M among these case ID entities 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 speeds and computational amounts of different paths may be different. Therefore, to improve the query efficiency of the database, the embodiments of this specification first determine the optimal query path of the query statement in the database, and then query the database according to the optimal query path to obtain the query result.

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

[0111] Step 301: Use the query conditions corresponding to each business element in the query statement as the query constraint conditions of the root node;

[0112] In this step, the format of the query constraint condition can 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 conditions and the schema of the database, and take each first-level query path as the parent node under the root node;

[0114] In this step, the query path refers to which dimension of entity to query.

[0115] Among multiple entities in the database, if there is an entity whose attribute information contains the query constraint condition, then use this entity as the query target entity and generate a first-level query path for querying this query target entity; and / or,

[0116] If there is an entity of the business element corresponding to the query constraint condition in the database, then use this entity as the query target entity and generate a first-level query path for querying this query target entity; and / or,

[0117] If there is an entity of the business element corresponding to the query constraint condition in the database, then use the entity associated with this entity in the database as the query target entity and generate a first-level query path for querying this query target entity.

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

[0119] In this step, according to the corresponding relationship between the entities and attribute information recorded in the database, determine whether the attribute information of the entity queried by the first-level query path contains at least one business element; and / or,

[0120] According to the association relationship between entities recorded in the database, determine whether there is an entity with an association relationship for the entity queried by the first-level query path in the database. If so, determine whether the entity associated with the entity queried by this 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 the multi-level query path.

[0122] Step 3031: If there is, obtain at least one second-level query path for this first-level query path;

[0123] In this step, if the attribute information of the entity queried by the first-level query path contains at least one business element, then use the query conditions corresponding to the business elements included in the attribute information of the entity queried by this first-level query path in the query statement as the query constraint condition for this parent node, and generate a second-level query path for the first-level query path corresponding to this parent node according to the query constraint condition of this parent node and the schema of the database.

[0124] It can be understood that if the attribute information of the entity queried by the primary query path (determined according to the schema of the database shown in Table 1 without actual query) contains one of all the parsed business elements, it means that there is a secondary query path for this primary query path. The secondary query path is to query this business element contained in the attribute information. Then, refer to the method in step 302 to generate the secondary query path of the parent node.

[0125] If there is an entity associated with the entity queried by the primary query path in the database, and the entity associated with the entity queried by the primary query path belongs to at least one business element, then use the query condition corresponding to the business element of the entity associated with the entity queried by the primary query path in the query statement as the query constraint condition of this parent node, and generate the secondary query path of the primary query path corresponding to this parent node according to the query constraint condition of this parent node and the schema of the database.

[0126] It can be understood that if there is an entity associated with the entity queried by the primary query path in the database (determined according to the schema of the database without actual query), and this associated entity belongs to one of all the parsed business elements, it means the secondary query path of this primary query path. The secondary query path is to query this associated entity. Then, refer to the method in step 302 to generate the secondary query path of the parent node.

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

[0128] In this step, the number of secondary query paths can be used as the access times of this parent node.

[0129] Step 3033: Take the secondary query path as the child node under this parent node; take the child node as the parent node, and repeat the step of searching each primary query path corresponding to each parent node according to the schema of the database;

[0130] Step 3041: If not, form a multi-level query path with this primary query path and the query paths of the multi-level parent nodes of the node corresponding to this primary query path;

[0131] It can be understood that finally, the node where no secondary query path is found is the leaf node, and the query path of this leaf node and its multi-level parent nodes forms the multi-level query path for querying the entity corresponding to the leaf node.

[0132] Step 3042: Calculate a reward value based on the judgment result of whether the entity or attribute information included in the processing rule is retrieved according to the first-level query path;

[0133] In this step, although the multi-level query path has retrieved the leaf node, this does not mean that the attribute information of the retrieved entity includes the entity or attribute information included in the parsed processing rule. It can be understood that although the multi-level query path can complete the query, it does not necessarily retrieve the result desired by the requirement. If the multi-level query path does not retrieve the result desired by the requirement, 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 retrieve the result desired by the requirement, then this multi-level query path is a correct query path, and the reward value can be a positive value. However, this correct query path is not necessarily the multi-level query path with the highest query efficiency, so subsequent steps of calculation need to be performed.

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

[0135] Step 3043: Update the cumulative reward values of the nodes 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 according to the cumulative reward value and the access times of the node;

[0138] In this step, if the cumulative reward value of a certain node is higher, it means that the correct rate of the query path corresponding to this node is higher. If the access times of a certain node are higher, it means that there are more second-level query paths under the first-level query path of this node. More second-level query paths mean that after the first-level query path retrieves the target entity, there are more directions for continued query. Multiple query directions can be queried in parallel, and then the intersection of the query results is taken. The query efficiency of this method is higher than that of serial query. Therefore, the embodiments of this specification can calculate the product of the cumulative reward value and the access times of the node to obtain the score.

[0139] Step 3045: Calculate the total score value of the multi-level query path according to the scores of the nodes 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 rate of this multi-level query path and the query efficiency of each node. However, if the total number of nodes in the multi-level query path is larger, it means that the multi-level query path needs to go through multiple serial queries, and the overall efficiency is reduced instead. Therefore, in the embodiments of this specification, the formula for calculating the total score value of the multi-level query path composed of each node based on the scores of each node is:

[0141] ;

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

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

[0144] Step 305: Determine the optimal query path from multiple said multi-level query paths according to the total score value.

[0145] It can be understood that through the formula for calculating the total score value in the embodiments of this specification, a multi-level query path with a higher score and a smaller number of nodes can be selected, and the query efficiency of this multi-level query path is higher.

[0146] In the embodiments of this specification, after obtaining the optimal query path, the database can be queried according to the optimal query path. When querying, the query paths ranked in the front are executed first (that is, the query paths of the parent nodes are queried first) to obtain a query result set, and then the query paths ranked in the back (that is, the query paths of the child nodes) continue to query in the query result set to further screen relevant data. After the optimal query path is executed, the final query result can be obtained.

[0147] Finally, the embodiments of this specification process the query result according to the processing rule to obtain the processing result of the service requirement.

[0148] In the embodiments of this specification, the processing rule may include counting the result quantity, extracting the result content, etc., which are not limited in the embodiments of this specification.

[0149] Based on the same inventive concept, the embodiments of this specification also provide a service processing device across judicial institutions, such asFigure 4 As shown in

[0150] A database construction unit 401, configured to pre-convert multiple pieces of service data of multiple judicial institutions into a unified format, and use multiple elements in the service data converted into the unified format as multiple entities. For each entity, use other elements in the corresponding service data except the element corresponding to the entity as the attribute information of the entity, analyze the association relationships between the entities, and construct a database according to the entities, attribute information, and association relationships;

[0151] A service requirement analysis unit 402, configured to, when receiving a service requirement input by a user, analyze the service requirement to obtain service elements and processing rules;

[0152] A query statement template determination unit 403, configured to determine a query statement template corresponding to the processing rules;

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

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

[0155] A processing unit 406, configured to process the query result according to the processing rules to obtain a processing result of the service requirement.

[0156] The beneficial effects obtained by the above device are the same as those obtained by the above method, and are not elaborated in the embodiments of this specification.

[0157] Such as Figure 5As shown, a computer device provided by an embodiment of this article. The device in this article may be the computer device in this embodiment and execute the method described above. The computer device 502 may include one or more processors 504, such as one or more central processing units (CPUs), and each processing unit may implement one or more hardware threads. The computer device 502 may also include any memory 506, which is used to store any kind of information such as code, settings, data, etc. Non-limitingly, for example, the memory 506 may include any one or more combinations of the following: any type of RAM, any type of ROM, flash memory devices, hard disks, optical discs, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent a fixed or removable component of the computer device 502. In one case, when the processor 504 executes the 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 for interacting with any memory, such as a hard disk drive mechanism, an optical disc drive mechanism, etc.

[0158] The computer device 502 may also include an input / output module 510 (I / O), which is used to receive various inputs (via the input device 512) and to provide various outputs (via the output device 514). A specific output mechanism may include a presentation device 516 and an associated graphical user interface (GUI) 518. In other embodiments, the input / output module 510 (I / O), the input device 512, and the output device 514 may not be included, and it may only be a computer device in a network. The computer device 502 may also include one or more network interfaces 520, which are used to exchange data with other devices via one or more communication links 522. One or more communication buses 524 couple the components described above together.

[0159] The communication link 522 may be implemented in any way, for example, through 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] An embodiment of this specification also provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the above method is implemented.

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

[0162] It should be understood that in various embodiments of this specification, the magnitudes of the serial numbers of the above processes do not imply the order of execution. The order of execution of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of this specification.

[0163] It should also be understood that in the embodiments of this specification, the term "and / or" is merely a description of the association relationship between associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in the embodiments of this specification generally represents an "or" relationship between the associated objects before and after.

[0164] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed in the embodiments of this specification can be implemented by electronic hardware, computer software, or a combination of the two. To clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described according to functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the embodiments of this specification.

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

[0166] In several embodiments provided by 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 illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed coupling or direct coupling or communication connection to each other can be an indirect coupling or communication connection through some interfaces, devices, or units, and can also be a connection in electrical, mechanical, or other forms.

[0167] The unit described as a separation component may or may not be physically separated. The component shown as a unit may or may not be a physical unit, that is, it may be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiments of this specification.

[0168] In addition, in each of the embodiments of this specification, each functional unit may be integrated in a processing unit, may exist separately as individual physical units, or two or more units may be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of 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 such an understanding, the technical solution of the embodiments of this specification, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the embodiments of this specification. The aforementioned storage medium includes: USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs and other various media that can store program codes.

[0170] In the embodiments of this specification, specific embodiments are used to elaborate on the principles and implementation manners of the embodiments of this specification. The descriptions of the above embodiments are only used to help understand the methods and their core ideas of the embodiments of this specification; at the same time, for those of ordinary skill in the art, according to the ideas of the embodiments of this specification, there will be changes in the specific implementation manners and application scopes. In summary, the content of this specification should not be construed as a limitation to the embodiments of this specification.

Claims

1. A business processing method across judicial institutions, characterized in that, The method includes: Pre-converting multiple pieces of business data of multiple judicial institutions into a unified format, and taking multiple elements in the business data after being converted into the unified format as multiple entities. For each entity, taking other elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity, and analyzing the association relationships between the entities, and constructing a database according to the entities, the attribute information, and the association relationships; When receiving a business requirement input by a user, parsing the business requirement to obtain business elements and processing rules; Determining a query statement template corresponding to the processing rule; Filling the query statement template with the business elements to obtain a query statement; Determining an optimal query path of the query statement in the database, and querying the database according to the optimal query path to obtain a query result; Processing the query result according to the processing rule to obtain a processing result of the business requirement.

2. The method according to claim 1, wherein The query statement is used to query an entity in the database to obtain the attribute information of the entity.

3. The method according to claim 2, wherein Determining the optimal query path of the query statement in the database further includes: Taking the query conditions corresponding to the business elements in the query statement as the query constraint conditions of the root node; Generating multiple first-level query paths according to the query constraint conditions and the schema of the database, and taking each first-level query path as a parent node under the root node; Searching for a second-level query path of each first-level query path corresponding to a 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; If there is, obtaining at least one second-level query path of the first-level query path, and recording the access times of the parent node according to the number of the second-level query paths; taking the second-level query path as a child node under the parent node; taking the child node as the parent node, and repeating the step of searching for each first-level query path corresponding to a parent node according to the schema of the database; If not, forming a multi-level query path with the first-level query path and the query paths of multiple-level parent nodes of the node corresponding to the first-level query path, calculating a reward value according to a judgment result on whether the entity or attribute information included in the processing rule is queried by the first-level query path, updating the cumulative reward values of the nodes corresponding to the multi-level query path according to the reward value, calculating a score of a node in the multi-level query path according to the cumulative reward value and the access times of the node, and finally calculating a total score value of the multi-level query path according to the scores of the nodes in the multi-level query path; Determining an optimal query path from multiple multi-level query paths according to the total score value.

4. The method according to claim 3, wherein The step of searching for a second-level query path of each first-level query path corresponding to a 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: Judging whether at least one business element is included in the attribute information of the entity queried by the first-level query path in the database according to the corresponding relationship between the entities and the attribute information recorded in the database; and / or, Based on the association relationships between entities recorded in the database, determine whether there are entities with association relationships in the database for the entities queried by the first-level query path. If so, determine whether the entities associated with the entities queried by the first-level query path belong to at least one business element.

5. The method according to claim 4, wherein if the attribute information of the entity queried by the first-level query path in the database contains at least one business element, then use the query conditions corresponding to the business elements contained in the attribute information of the entity queried by the first-level query path in the database as the query constraint conditions for this parent node, and generate a second-level query path for the first-level query path corresponding to this parent node according to the query constraint conditions of this parent node and the schema of the database; if there are entities with association relationships in the database for the entity queried by the first-level query path, and the entities associated with the entity queried by the first-level query path belong to at least one business element, then use the query conditions corresponding to the business elements of the entities associated with the entity queried by the first-level query path in the database as the query constraint conditions for this parent node, and generate a second-level query path for the first-level query path corresponding to this parent node according to the query constraint conditions of this parent node and the schema of the database.

6. The method according to claim 3, wherein Generating multiple first-level query paths according to the query constraint conditions and the schema of the database further includes: Among the multiple entities in the database, if there is an entity whose attribute information contains the query constraint conditions, then use this entity as the query target entity and generate the first-level query path for querying this query target entity; and / or, if there is an entity corresponding to the business element of the query constraint conditions in the database, then use this entity as the query target entity and generate the first-level query path for querying this query target entity; and / or, if there is an entity corresponding to the business element of the query constraint conditions in the database, then use the entity associated with this entity in the database as the query target entity and generate the first-level query path for querying this query target entity.

7. The method according to claim 3, characterized in that Calculating the scores of each node according to the cumulative reward values and access times of each node further includes: Calculate the product of the cumulative reward value and the access times of the node to obtain the score.

8. The method according to claim 7, wherein The formula for calculating the total score of the multi-level query path composed of each node according to the scores of each node is: ； Among them, Score represents the total score value, N represents the total number of nodes in this multi-level query path, and s i represents the score of node i, and α represents the coefficient.

9. A business processing device across judicial agencies, characterized in that The device includes: A database construction unit, configured to pre-convert multiple pieces of business data of multiple judicial institutions into a unified format, use multiple elements in the business data after being converted into the unified format as multiple entities, for each entity, use the other elements in the corresponding business data except the element corresponding to the entity as the attribute information of the entity, analyze the association relationships between the entities, and construct a database according to each entity, attribute information, and association relationship; A business requirement analysis unit, configured to, when receiving a business requirement input by a user, analyze the business requirement to obtain business elements and processing rules; A query statement template determination 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 service elements to obtain a query statement; An optimal query path query unit, configured to determine an optimal query path of 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 of the service requirement.

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

Images