Dynamic institution tree management method and device of bank institution, equipment and medium

By creating relational data model structures and association tables, banking institutions can dynamically manage institutional relationship trees, solving the problems of difficulty in adjustment and long change cycles caused by fixed institutional hierarchy processing, and achieving rapid adjustment and efficient management.

CN119441221APending Publication Date: 2025-02-14PING AN BANK CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411496002.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-23
Publication Date
2025-02-14

AI Technical Summary

Technical Problem

When banking institutions develop business and adjust their institutions, the use of current fixed institutional hierarchy results in difficult adjustments, long change cycles, and inefficient cooperation between business departments.

Method used

By creating a relational data model structure, including organizational basic information table, organizational control table, relationship type definition table and relationship level definition table, we associate these tables to form an organization relationship table, and use the relationship level definition table and the relationship chain fields in the organizational control table. Record the current organization's superior organization to achieve rapid positioning and management.

Benefits of technology

It realizes a dynamic management organization relationship tree, adapts to institutional changes, and quickly adjusts organization relationships without modifying the full table data, reducing the change cycle and adjustment difficulty.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119441221A_ABST
    Figure CN119441221A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of big data processing, and discloses a dynamic institution tree management method and device of a bank institution, equipment and a medium, and the method comprises the steps: creating a relational data model structure, and recording data into the relational data model structure, the relational data model structure at least comprises a mechanism basic information table, a mechanism control table, a relation type definition table and a relation level definition table; the mechanism basic information table and the relation type definition table are associated to form a mechanism relation table, and the mechanism relation table comprises different mechanism relation trees; in the mechanism relation table, all superior mechanisms of the current mechanism are recorded by using relation chain fields in the relation level definition table and the mechanism control table, and during searching, quick positioning is performed when the current field is passed. Coexistence management of multiple relation trees is achieved, and rapid adjustment is achieved when the mechanism changes are adapted.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of big data processing technology, and in particular to a dynamic organization tree management method, device, equipment and medium for a banking institution. Background Art

[0002] The branches of Chinese banks are an important basis for serving customers. At present, the retail structure of institutional relationships is a four-level structure of head office-branch-sub-branch office, and the corporate structure is a five-level structure of head office-division-branch-sub-branch office, etc. From the perspective of the software system, each downstream system will use the basic information of the corresponding institutional branches to obtain the branch name, etc. From the management perspective, the corresponding positioning of each institution is different, including accounting institutions, management institutions, etc. From the perspective of the institution itself, there are situations such as institutional activation, deactivation, and merger.

[0003] With the rapid development of business, there are adjustments in the organization, which need to be processed using the currently commonly used fixed organizational hierarchy, and each business department needs to cooperate in the changes, resulting in great difficulty in adjustments, low efficiency in cooperation among business departments, and long change cycles. Summary of the invention

[0004] The present invention provides a dynamic organization tree management method, device, computer equipment and medium for a banking institution, so as to solve the technical problems that the currently commonly used fixed organization hierarchy processing adjustment is difficult and the modification cycle is long when the organization is adjusted.

[0005] In a first aspect, a dynamic organization tree management method for a banking institution is provided, comprising:

[0006] Creating a relational data model structure and recording data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table;

[0007] The basic information table of related institutions and the relationship type definition table constitute an institution relationship table, wherein the institution relationship table includes different institution relationship trees;

[0008] In the institution relationship table, use the relationship chain fields in the relationship level definition table and the institution control table to record all the parent institutions of the current institution. When searching, they can be quickly located through the current field.

[0009] In a second aspect, a dynamic organization tree management device for a banking institution is provided, comprising:

[0010] A creation module, used to create a relational data model structure and record data into the relational data model structure, wherein the relational data model structure at least includes an institution basic information table, an institution control table, a relation type definition table, and a relation level definition table;

[0011] A composition module, used to associate the basic information table of the organization with the relationship type definition table to form an organization relationship table, wherein the organization relationship table includes different organization relationship trees;

[0012] The record module is used to record all the parent institutions of the current institution in the institution relationship table, using the relationship chain fields in the relationship level definition table and the institution control table. When searching, it can be quickly located through the current field.

[0013] In a third aspect, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned method for dynamic organization tree management of a banking institution when executing the computer program.

[0014] In a fourth aspect, a computer-readable storage medium is provided, which stores a computer program, and when the computer program is executed by a processor, the steps of the dynamic organization tree management method of the above-mentioned banking institution are implemented.

[0015] In the scheme implemented by the dynamic organization tree management method, device, computer equipment and storage medium of the above-mentioned banking institution, a relational data model structure can be created and data can be recorded in the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table; the organization basic information table and the relationship type definition table are linked to form an organization relationship table, wherein the organization relationship table includes different organization relationship trees; in the organization relationship table, the relationship chain field in the relationship level definition table and the organization control table is used to record all the superior organizations of the current organization, and when searching, it can be quickly located through the current field. For different business relationship types and multiple organization relationships, new business relationship trees are added through parameter configuration and managed by the relationship table, so that multiple relationship trees can be managed in parallel, meeting the requirements of business multi-dimensional management, and realizing rapid adjustment in adapting to organization changes; for changes in the relationship of organization promotion and demotion, only the relationship chain field in the organization relationship needs to be adjusted, without modifying the data of the entire table, and without the need to update the data synchronously due to changes in the organization relationship. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0017] Figure 1 It is a schematic diagram of an application environment of a dynamic organization tree management method of a banking organization in one embodiment of the present invention;

[0018] Figure 2 It is a flow chart of a dynamic organization tree management method of a banking organization in one embodiment of the present invention;

[0019] Figure 3 It is a structural diagram of a dynamic organization tree management device of a banking organization in one embodiment of the present invention;

[0020] Figure 4 is a schematic diagram of a structure of a computer device in one embodiment of the present invention;

[0021] Figure 5 It is another structural schematic diagram of a computer device in one embodiment of the present invention. DETAILED DESCRIPTION

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

[0023] The dynamic organization tree management method of a banking institution provided by the embodiment of the present invention can be applied in the following aspects: Figure 1 In the application environment, the client communicates with the server through the network. The server can create a relational data model structure and record data in the relational data model structure, wherein the relational data model structure at least includes an institution basic information table, an institution control table, a relationship type definition table, and a relationship level definition table; the institution basic information table and the relationship type definition table are linked to form an institution relationship table, wherein the institution relationship table includes different institution relationship trees; in the institution relationship table, the relationship chain field in the relationship level definition table and the institution control table is used to record all the superior institutions of the current institution, and when searching, it will be quickly located through the current field. For different business relationship types and multiple institution relationships, a new business relationship tree is added through parameter configuration, and is managed by the relationship table, so that multiple relationship trees can be managed in parallel, meet the requirements of business multi-dimensional management, and adapt to changes in institutions and achieve rapid adjustment; for changes in the relationship between the promotion and demotion of institutions, only the relationship chain field in the institution relationship needs to be adjusted, without modifying the entire table data, and without the need to synchronize data updates due to changes in institution relationships. Among them, the client can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, and portable wearable devices. The server side can be implemented by an independent server or a server cluster composed of multiple servers. The present invention is described in detail below through specific embodiments.

[0024] See also Figure 2 As shown, Figure 2 A flow chart of a dynamic organization tree management method for a banking institution provided by an embodiment of the present invention includes the following steps:

[0025] S10: creating a relational data model structure and recording data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table;

[0026] In order to cope with the rapid development of business and the rapid adjustment of organizational structure, the organization relationship is separated from the organization information to manage different business relationships separately, and the concept of organization relationship tree is introduced. Each organization can have different organization relationship trees for different business scenarios, and each relationship tree can have different relationship level divisions (organization relationship level definitions). Business scenarios include core business scenarios and business scenarios of peripheral systems, that is, the core system can manage the organization tree for the peripheral system and notify each system through the parameter publishing mechanism. Common relationship trees include: management relationship tree, account relationship tree, offshore organization report tree, community organization report tree, cash transfer relationship tree, voucher transfer relationship tree, authorization relationship tree, etc.

[0027] In this embodiment, the account relationship tree is as follows:

[0028] Record the basic information of the institution in the institution basic information table. The basic information of the institution shall at least include the institution number, institution type, institution name, institution address, etc.; record the relevant controls of the institution in the institution control table. The relevant controls of the institution shall at least include the institution status, activation date, accounting processing indicator light, etc.; record the relevant types of functional relationships in the relationship type definition table. The relevant types of functional relationships shall at least include accounting relationships, management relationships, etc.; record the relevant levels of the institution in the relationship level definition table. The relevant levels of the institution shall at least include first-level branches, third-level sub-branches, etc.

[0029] S20: linking the basic information table of the institution and the relationship type definition table to form an institution relationship table, wherein the institution relationship table includes different institution relationship trees;

[0030] Specifically, by respectively confirming the primary keyword of the organization basic information table and the primary keyword of the relationship type definition table; searching for the same primary keyword in the primary keyword of the organization basic information table and the primary keyword of the organization basic information table; based on the same primary keyword, associating the organization basic information table with the relationship type definition table to form an organization relationship table.

[0031] Table connection refers to retrieving related data from one or more tables by associating tables in a SQL statement. Connection is achieved through multiple table names in the FROM clause of the SQL statement and the connection conditions between tables defined in the WHERE clause. When a SQL statement associates more than two tables, first connect two of them to generate a result set; then associate the generated result set with the next table; continue this process until all tables are connected; finally generate the required data. Among them, there are several different ways to connect two tables:

[0032] 1. Equal join: By using columns with the same meaning in two tables, you can establish equal join conditions. Only rows with equal values ​​in the join columns that appear in both tables will appear in the query results. Example: query the institution number, the corresponding institution type, the corresponding institution name, and the corresponding institution address.

[0033] 2. In addition to displaying information that matches the equal join condition, an outer join also displays information about a table that does not match the equal join condition. An outer join is identified by (+).

[0034] A) Left condition (+) = right condition, which means that in addition to displaying the information that matches the equal join condition, it also displays the information in the table where the right condition is located that cannot match the equal join condition. This is also called "right outer join". Another way to express it is:

[0035] B) Left condition = right condition (+), which means that in addition to displaying the information that matches the equal join condition, it also displays the information that cannot match the equal join condition in the table where the left condition is located. This is also called "left outer join".

[0037] 3. Self-join: Self-join is a frequently used join method in databases. By using self-join, a mirror image of a table can be treated as another table, so that some special data can be obtained. Specifically:

[0038] Copy the original table as another table, and do a Cartesian product equijoin on the two tables. A Cartesian product equijoin combines each row in two tables with each row in the other table. If table A has n rows and table B has m rows, then their Cartesian product will have n*m ​​rows. This join operation is mainly used to return all possible combination results without considering the matching of attribute values.

[0039] 4. Hash join: When the memory can provide enough space, in the hash join, the optimizer first selects the smaller table of the two tables based on statistical information, and creates a hash table based on the join key of this table in the memory; the optimizer then scans the larger table in the table join, compares the data in the larger table with the hash table, and if there is related data, adds the data to the result set.

[0040] Hash joins work best when the smaller table in the table join can be completely cached into available memory. The cost of a hash join is only the cost of reading the two tables from disk into memory.

[0041] However, if the hash table is too large to be cached in all available memory, the optimizer will divide the hash table into multiple partitions and cache the partitions one by one in memory. When the number of partitions in a table exceeds the available memory, part of the partition data will be temporarily written to a temporary tablespace on disk. Therefore, when writing partition data to disk, a larger extent will improve I / O performance. The optimizer recommends a temporary tablespace extent of 1MB. The extent size of the temporary tablespace is determined based on usage requirements.

[0042] When the hash table is built, the following processing is performed:

[0043] 1) The second large table is scanned; 2) If the large table cannot be completely cached into the available memory, the large table will also be divided into many partitions; 3) The first partition of the large table is cached into the memory; 4) The data of the first partition of the large table is scanned and compared with the hash table. If there is a matching record, it is added to the result set; 5) As with the first partition, other partitions are processed similarly; 6) After all partitions are processed, the optimizer merges and summarizes the generated result sets to produce the final result.

[0044] When the hash table is too large or the available memory is limited, the hash table cannot be completely cached in memory. As the number of result sets that meet the connection conditions increases, the available memory will decrease. At this time, the data that has been cached in memory may be written back to the hard disk. If this happens, the performance of the system will deteriorate.

[0045] The optimizer may use hash join only when the two tables are connected using equal join and the amount of data in the tables is relatively large. Hash join is based on CBO. The cache will use hash edge join only when the database initialization parameter HASH_JOIN_ENABLED is set to True and a sufficiently large value is set for the parameter PGA_AGGREGATE_TARGET. HASH_AREA_SIZE is a backward compatible parameter. When the ORDERED hint is used, the first table in the FROM clause will be used to build the hash table. You can force the optimizer to generate an execution plan for a hash join by adding HINTS to the SQL statement.

[0046] It should be noted that different institution relationship trees include at least a management relationship tree and an accounting relationship tree.

[0047] S30: In the institution relationship table, the relationship chain field in the relationship level definition table and the institution control table is used to record all the parent institutions of the current institution. When searching, the current field can be used to quickly locate the parent institutions.

[0048] Specifically, extract the relationship chain field defined in the relationship level definition table and the relationship chain field in the institution control table; add the relationship chain field defined in the relationship level definition table and the relationship chain field in the institution control table to the institution relationship table, and record all the superior institutions of the current institution in the relationship chain field defined in the relationship level definition table in the institution relationship table and the relationship chain field in the institution control table. When the promotion and demotion relationship of the institution changes, adjust the relationship chain field in the institution relationship table.

[0049] Among them, the relationship chain field is the relationship chain system that supports standard relationship chain fields and custom relationship chain fields. For example, the relationship chain field is represented in the form of Key-Value. A field class1_Key-Value is added to the Class2 table to associate with the Key-Value field of the Class1 table; the association relationship between the Class1 table and the Class2 table is established through class1_Key-Value.

[0050] It can be seen that in the above scheme, for the establishment of the relationship table of the relationship chain system, the relationship data model structure is first created and the data is recorded in the relationship data model structure, wherein the relationship data model structure at least includes the basic information table of the organization, the organization control table, the relationship type definition table, and the relationship level definition table; the basic information table of the organization is associated with the relationship type definition table to form the organization relationship table, wherein the organization relationship table includes different organization relationship trees; in the organization relationship table, the relationship chain field in the relationship level definition table and the organization control table is used to record all the superior organizations of the current organization, and when searching, it will be quickly located through the current field. For different business relationship types and multiple organization relationships, new business relationship trees are added through parameter configuration and managed by the relationship table, so that multiple relationship trees can be managed coexistently, meeting the requirements of multiple dimensional management of the business, and realizing rapid adjustment in adapting to organization changes; for changes in the relationship of organization promotion and demotion, it is only necessary to adjust the relationship chain field in the organization relationship, without modifying the data of the entire table, and without the need to update the data synchronously due to changes in the organization relationship.

[0051] It should be understood that the order of execution of the steps in the above embodiment does not necessarily 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 embodiment of the present invention.

[0052] In one embodiment, a dynamic organization tree management device for a banking institution is provided, and the dynamic organization tree management device for a banking institution corresponds one-to-one to the dynamic organization tree management method for a banking institution in the above embodiment. Figure 3 As shown, the dynamic organization tree management device of the bank organization includes a creation module 101, a composition module 102, a recording module 103, a judgment module 104, an adjustment module 105, a selection module 106 and a response module 107. The detailed description of each functional module is as follows:

[0053] The creation module 101 is used to create a relational data model structure and record data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table;

[0054] A composition module 102 is used to associate the basic information table of the organization with the relationship type definition table to form an organization relationship table, wherein the organization relationship table includes different organization relationship trees;

[0055] The recording module 103 is used to record all the superior organizations of the current organization in the organization relationship table by using the relationship chain fields in the relationship level definition table and the organization control table, so that the organization can be quickly located when searching through the current field.

[0056] In one embodiment, the creation module 101 is specifically used to:

[0057] Record the basic information of the organization in the basic information table of the organization;

[0058] Record organization-related controls in the organization control table;

[0059] Record the relevant types of functional relationships in the relationship type definition table;

[0060] Records the agency level related grades to the relationship level definition table.

[0061] In one embodiment, the creation module 101 is further used to:

[0062] The basic information of the institution shall at least include the institution number, institution type, institution name, institution address, etc.;

[0063] Institution-related controls at least include institution status, activation date, accounting processing indicator lights, etc.;

[0064] The types of functional relationships at least include accounting relationships, management relationships, etc.;

[0065] Institutional level-related information includes at least first-level branches, third-level sub-branches, etc.

[0066] In one embodiment, the component module 102 is specifically configured to:

[0067] Confirm the primary key of the organization basic information table and the primary key of the relationship type definition table respectively;

[0068] Find the primary key in the organization basic information table that is the same as the primary key in the organization basic information table;

[0069] Based on the same primary key, the organization basic information table is associated with the relationship type definition table to form an organization relationship table.

[0070] In one embodiment, the recording module 103 is specifically configured to:

[0071] Extract the relationship chain fields defined in the relationship level definition table and the relationship chain fields in the organization control table;

[0072] Add the relationship chain field defined in the relationship level definition table and the relationship chain field in the institution control table in the institution relationship table, and record all the superior institutions of the current institution in the relationship chain field defined in the relationship level definition table in the institution relationship table and the relationship chain field in the institution control table.

[0073] The present invention provides a dynamic organization tree management device for a banking institution. First, a relational data model structure is created and data is recorded in the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table; the organization basic information table is associated with the relationship type definition table to form an organization relationship table, wherein the organization relationship table includes different organization relationship trees; in the organization relationship table, the relationship chain field in the relationship level definition table and the organization control table is used to record all the superior organizations of the current organization, and when searching, the current field is used to quickly locate the organization. For different business relationship types and multiple organization relationships, new business relationship trees are added through parameter configuration and managed by the relationship table, so that multiple relationship trees can be managed in parallel, meeting the requirements of multiple dimensional management of business, and realizing rapid adjustment in adapting to organization changes; for changes in the relationship of organization promotion and demotion, only the relationship chain field in the organization relationship needs to be adjusted, without modifying the data of the entire table, and without the need to update the data synchronously due to changes in the organization relationship.

[0074] The specific definition of the dynamic organization tree management device of a banking institution can be found in the definition of the dynamic organization tree management method of a banking institution mentioned above, which will not be repeated here. Each module in the dynamic organization tree management device of the banking institution can be implemented in whole or in part by software, hardware and a combination thereof. The above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0075] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 4 As shown. The computer device includes a processor, a memory, a network interface and a database connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile and / or volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external client through a network connection. When the computer program is executed by the processor, it realizes the functions or steps on the service side of a dynamic institution tree management method of a banking institution.

[0076] In one embodiment, a computer device is provided. The computer device may be a client, and its internal structure diagram may be as follows: Figure 5As shown. The computer device includes a processor, a memory, a network interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external server through a network connection. When the computer program is executed by the processor, it realizes the functions or steps on the client side of a dynamic institution tree management method of a banking institution

[0077] In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the following steps when executing the computer program:

[0078] Creating a relational data model structure and recording data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table;

[0079] The basic information table of related institutions and the relationship type definition table constitute an institution relationship table, wherein the institution relationship table includes different institution relationship trees;

[0080] In the institution relationship table, use the relationship chain fields in the relationship level definition table and the institution control table to record all the parent institutions of the current institution. When searching, they can be quickly located through the current field.

[0081] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0082] Creating a relational data model structure and recording data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table;

[0083] The basic information table of related institutions and the relationship type definition table constitute an institution relationship table, wherein the institution relationship table includes different institution relationship trees;

[0084] In the institution relationship table, use the relationship chain fields in the relationship level definition table and the institution control table to record all the parent institutions of the current institution. When searching, they can be quickly located through the current field.

[0085] It should be noted that the above functions or steps that can be implemented by the computer-readable storage medium or computer device can refer to the relevant descriptions on the server side and the client side in the aforementioned method embodiment. To avoid repetition, they will not be described one by one here.

[0086] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in the present application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0087] Those skilled in the art can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above.

[0088] The embodiments described above are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.

Claims

1. A dynamic organization tree management method for a banking institution, characterized in that: include: Creating a relational data model structure and recording data into the relational data model structure, wherein the relational data model structure at least includes an organization basic information table, an organization control table, a relationship type definition table, and a relationship level definition table; The basic information table of related institutions and the relationship type definition table constitute an institution relationship table, wherein the institution relationship table includes different institution relationship trees; In the institution relationship table, use the relationship chain fields in the relationship level definition table and the institution control table to record all the parent institutions of the current institution. When searching, they can be quickly located through the current field.

2. The dynamic organization tree management method of a banking institution as claimed in claim 1, characterized in that: The step of recording data into a relational data model structure comprises: Record the basic information of the organization in the basic information table of the organization; Record organization-related controls in the organization control table; Record the relevant types of functional relationships in the relationship type definition table; Records the agency level related grades to the relationship level definition table.

3. The dynamic organization tree management method of a banking institution as claimed in claim 2, characterized in that: The basic information of the institution shall at least include the institution number, institution type, institution name, institution address, etc.; Institution-related controls at least include institution status, activation date, accounting processing indicator lights, etc.; The types of functional relationships at least include accounting relationships, management relationships, etc.; Institutional level-related information includes at least first-level branches, third-level sub-branches, etc.

4. The dynamic organization tree management method of a banking institution as claimed in claim 1, characterized in that: The steps of forming the organization relationship table by the basic information table of the associated organizations and the relationship type definition table include: Confirm the primary key of the organization basic information table and the primary key of the relationship type definition table respectively; Find the primary key in the organization basic information table that is the same as the primary key in the organization basic information table; Based on the same primary key, the organization basic information table is associated with the relationship type definition table to form an organization relationship table.

5. The dynamic organization tree management method of a banking institution as claimed in claim 1, characterized in that: In the institution relationship table, the relationship chain fields in the relationship level definition table and the institution control table are used to record all the superior institutions of the current institution. When searching, the steps of quickly locating through the current field include: Extract the relationship chain fields defined in the relationship level definition table and the relationship chain fields in the organization control table; Add the relationship chain field defined in the relationship level definition table and the relationship chain field in the institution control table in the institution relationship table, and record all the superior institutions of the current institution in the relationship chain field defined in the relationship level definition table in the institution relationship table and the relationship chain field in the institution control table.

6. The dynamic organization tree management method of a banking institution as claimed in claim 1, characterized in that: The different institution relationship trees include at least a management relationship tree and an accounting relationship tree.

7. The dynamic organization tree management method of a banking institution as claimed in claim 1, characterized in that: When the promotion and demotion relationship of an institution changes, adjust the relationship chain field in the institution relationship table.

8. A dynamic organization tree management device for a banking institution, characterized in that: include: A creation module, used to create a relational data model structure and record data into the relational data model structure, wherein the relational data model structure at least includes an institution basic information table, an institution control table, a relation type definition table, and a relation level definition table; A composition module, used to associate the basic information table of the organization with the relationship type definition table to form an organization relationship table, wherein the organization relationship table includes different organization relationship trees; The record module is used to record all the parent institutions of the current institution in the institution relationship table, using the relationship chain fields in the relationship level definition table and the institution control table. When searching, it can be quickly located through the current field.

9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the processor implements the steps of the dynamic organization tree management method of a banking institution as described in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the dynamic organization tree management method of a banking institution as described in any one of claims 1 to 7 are implemented.